Alexei Vernitski

According to our database1, Alexei Vernitski authored at least 23 papers between 2004 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 




An application of neural networks to a problem in knot theory and group theory (untangling braids).
CoRR, 2022

Training AI to Recognize Realizable Gauss Diagrams: The Same Instances Confound AI and Human Mathematicians.
Proceedings of the 14th International Conference on Agents and Artificial Intelligence, 2022

Reinforcement learning algorithms for the Untangling of Braids.
Proceedings of the Thirty-Fifth International Florida Artificial Intelligence Research Society Conference, 2022

Circle graphs (chord interlacement graphs) of Gauss diagrams: Descriptions of realizable Gauss diagrams, algorithms, enumeration.
CoRR, 2021

Experimental Mathematics Approach to Gauss Diagrams Realizability.
CoRR, 2021

Untangling Braids with Multi-Agent Q-Learning.
Proceedings of the 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2021

Gauss-Lintel, an Algorithm Suite for Exploring Chord Diagrams.
Proceedings of the Intelligent Computer Mathematics - 14th International Conference, 2021

Towards Human Readability of Automated Unknottedness Proofs.
Proceedings of the fourth Workshop on Bridging the Gap between Human and Automated Reasoningco-located with the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (IJCAI-ECAI 2018), 2018

Visual Algebraic Proofs for Unknot Detection.
Proceedings of the Diagrammatic Representation and Inference, 2018

Automated Reasoning for Knot Semigroups and \pi π -orbifold Groups of Knots.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Efficient Adaptive Implementation of the Serial Schedule Generation Scheme Using Preprocessing and Bloom Filters.
Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

Encoding Shortest Paths in Triangular Grids for Delivery Without Errors.
Proceedings of the International Conference on Future Networks and Distributed Systems, 2017

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters.
Eur. J. Oper. Res., 2016

Yes-no Bloom filter: A way of representing sets with fewer false positives.
CoRR, 2016

Routing in hexagonal computer networks: How to present paths by Bloom filters without false positives.
Proceedings of the 2016 8th Computer Science and Electronic Engineering Conference, 2016

"Too Taxing on the Mind!" Authentication Grids are not for Everyone.
Proceedings of the Human Aspects of Information Security, Privacy, and Trust, 2015

Optimized hash for network path encoding with minimized false positives.
Comput. Networks, 2014

Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions.
J. Discrete Algorithms, 2012

Performance modelling and analysis of dynamic virtual optical network composition.
Proceedings of the 16th International Conference on Optical Network Design and Modelling, 2012

One-Side Nielsen Transformations in Free Groups.
Int. J. Algebra Comput., 2009

Ordered and J-Trivial Semigroups as Divisors of Semigroups of Languages.
Int. J. Algebra Comput., 2008

Can Unbreakable Mean Incomputable?
Comput. J., 2006

Finite quasivarieties and self-referential conditions.
Stud Logica, 2004