default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexei Vernitski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c15]Alexei Lisitsa, Mateo Salles, Alexei Vernitski:
Supervised Learning for Untangling Braids. ICAART (3) 2023: 784-789- [c14]Federica Armani, Ian Daly, Alexei Vernitski, Helge Gillmeister, Reinhold Scherer
:
Maths Anxiety and cognitive state monitoring for neuroadaptive learning systems using electroencephalography. MetroXRAINE 2023: 467-472 - [c13]Alexei Lisitsa, Alexei Vernitski:
On Strong Anti-learning of Parity. OL2A (2) 2023: 271-279 - [i7]Alexei Lisitsa, Mateo Salles, Alexei Vernitski:
Machine learning discovers invariants of braids and flat braids. CoRR abs/2307.12185 (2023) - 2022
- [c12]Abdullah Khan, Alexei Vernitski, Alexei Lisitsa:
Reinforcement learning algorithms for the Untangling of Braids. FLAIRS 2022 - [c11]Abdullah Khan, Alexei Lisitsa, Alexei Vernitski:
Training AI to Recognize Realizable Gauss Diagrams: The Same Instances Confound AI and Human Mathematicians. ICAART (3) 2022: 990-995 - [i6]Alexei Lisitsa, Mateo Salles, Alexei Vernitski:
An application of neural networks to a problem in knot theory and group theory (untangling braids). CoRR abs/2206.05373 (2022) - 2021
- [c10]Abdullah Khan, Alexei Lisitsa, Alexei Vernitski:
Gauss-Lintel, an Algorithm Suite for Exploring Chord Diagrams. CICM 2021: 197-202 - [c9]Abdullah Khan, Alexei Vernitski, Alexei Lisitsa:
Untangling Braids with Multi-Agent Q-Learning. SYNASC 2021: 135-139 - [i5]Abdullah Khan, Alexei Lisitsa, Alexei Vernitski:
Experimental Mathematics Approach to Gauss Diagrams Realizability. CoRR abs/2103.02102 (2021) - [i4]Abdullah Khan, Alexei Lisitsa, Viktor Lopatkin, Alexei Vernitski:
Circle graphs (chord interlacement graphs) of Gauss diagrams: Descriptions of realizable Gauss diagrams, algorithms, enumeration. CoRR abs/2108.02873 (2021) - [i3]Abdullah Khan, Alexei Vernitski, Alexei Lisitsa:
Untangling Braids with Multi-agent Q-Learning. CoRR abs/2109.14502 (2021)
2010 – 2019
- 2018
- [c8]Andrew Fish, Alexei Lisitsa, Alexei Vernitski:
Visual Algebraic Proofs for Unknot Detection. Diagrams 2018: 89-104 - [c7]Andrew Fish, Alexei Lisitsa, Alexei Vernitski:
Towards Human Readability of Automated Unknottedness Proofs. Bridging@IJCAI/ECAI 2018: 27-32 - 2017
- [c6]Gökçe Çaylak Kayaturan, Alexei Vernitski:
Encoding Shortest Paths in Triangular Grids for Delivery Without Errors. ICFNDS 2017: 12:1-12:5 - [c5]Daniel Karapetyan, Alexei Vernitski:
Efficient Adaptive Implementation of the Serial Schedule Generation Scheme Using Preprocessing and Bloom Filters. LION 2017: 124-138 - [c4]Alexei Lisitsa, Alexei Vernitski:
Automated Reasoning for Knot Semigroups and \pi π -orbifold Groups of Knots. MACIS 2017: 3-18 - [i2]Daniel Karapetyan, Alexei Vernitski:
Efficient Adaptive Implementation of the Serial Schedule Generation Scheme using Preprocessing and Bloom Filters. CoRR abs/1708.07786 (2017) - 2016
- [j7]Xinan Yang, Alexei Vernitski, Laura Carrea:
An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters. Eur. J. Oper. Res. 252(3): 985-994 (2016) - [c3]Gökçe Çaylak Kayaturan, Alexei Vernitski:
Routing in hexagonal computer networks: How to present paths by Bloom filters without false positives. CEEC 2016: 95-100 - [i1]Laura Carrea, Alexei Vernitski, Martin Reed:
Yes-no Bloom filter: A way of representing sets with fewer false positives. CoRR abs/1603.01060 (2016) - 2015
- [c2]Kat Krol, Constantinos Papanicolaou, Alexei Vernitski, Martina Angela Sasse:
"Too Taxing on the Mind!" Authentication Grids are not for Everyone. HCI (22) 2015: 71-82 - 2014
- [j6]Laura Carrea, Alexei Vernitski, Martin J. Reed:
Optimized hash for network path encoding with minimized false positives. Comput. Networks 58: 180-191 (2014) - 2012
- [j5]Alexei Vernitski, Artem V. Pyatkin:
Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions. J. Discrete Algorithms 12: 24-28 (2012) - [c1]Shuping Peng, Reza Nejabati, Eduard Escalona, Dimitra Simeonidou, Markos P. Anastasopoulos, Konstantinos Georgakilas, Anna Tzanakaki, Alexei Vernitski:
Performance modelling and analysis of dynamic virtual optical network composition. ONDM 2012: 1-5
2000 – 2009
- 2009
- [j4]Alexei Vernitski:
One-Side Nielsen Transformations in Free Groups. Int. J. Algebra Comput. 19(7): 855-871 (2009) - 2008
- [j3]Alexei Vernitski:
Ordered and J-Trivial Semigroups as Divisors of Semigroups of Languages. Int. J. Algebra Comput. 18(7): 1223-1229 (2008) - 2006
- [j2]Alexei Vernitski:
Can Unbreakable Mean Incomputable? Comput. J. 49(1): 108-112 (2006) - 2004
- [j1]Alexei Vernitski:
Finite quasivarieties and self-referential conditions. Stud Logica 78(1-2): 337-348 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
