Alexej P. Lisitsa

Available identifiers

zbMath Open lisitsa.alexeiMaRDI QIDQ1662268

List of research outcomes

Publication	Date of Publication	Type
Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs	2023-12-11	Paper
Automated reasoning for proving non-orderability of groups	2023-10-09	Paper
Machine learning discovers invariants of braids and flat braids	2023-07-22	Paper
Correction to: ``Parameterized verification of leader/follower systems via first-order temporal logic	2023-05-08	Paper
Representation and processing of instantaneous and durative temporal phenomena	2023-05-08	Paper
Visual Algebraic Proofs for Unknot Detection	2023-02-23	Paper
Abstract State Machines and System Theoretic Process Analysis for Safety-Critical Systems	2022-11-04	Paper
An application of neural networks to a problem in knot theory and group theory (untangling braids)	2022-06-10	Paper
\texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams	2022-04-22	Paper
Untangling Braids with Multi-agent Q-Learning	2021-09-29	Paper
Circle graphs (chord interlacement graphs) of Gauss diagrams: Descriptions of realizable Gauss diagrams, algorithms, enumeration	2021-08-05	Paper
Experimental Mathematics Approach to Gauss Diagrams Realizability	2021-03-02	Paper
https://portal.mardi4nfdi.de/entity/Q5111907	2020-05-27	Paper
Automated Reasoning for Knot Semigroups and  $$\pi $$ π -orbifold Groups of Knots	2019-03-14	Paper
Revisiting MU puzzle: a case study in finite countermodels verification	2018-10-23	Paper
Dihedral semigroups, their defining relations and an application to describing knot semigroups of rational links	2018-09-14	Paper
The Andrews-Curtis conjecture, term rewriting and first-order proofs	2018-08-17	Paper
Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT	2016-09-28	Paper
Computer-aided proof of Erdős discrepancy properties	2015-11-18	Paper
Finite reasons for safety	2015-06-23	Paper
A combinatorial approach to knot recognition	2015-05-25	Paper
A SAT Attack on the Erdős Discrepancy Conjecture	2014-09-26	Paper
Detecting Unknots via Equational Reasoning, I: Exploration	2014-08-07	Paper
On one application of computations with oracle	2012-11-16	Paper
Planarity of Knots, Register Automata and LogSpace Computability	2011-06-03	Paper
Reachability as Derivability, Finite Countermodels and Verification	2010-10-04	Paper
On the Computational Power of Querying the History	2009-06-23	Paper
Automata on Gauss Words	2009-04-02	Paper
REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION	2008-09-25	Paper
Verification as a parameterized testing (experiments with the SCP4 supercompiler)	2007-07-05	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
Linear ordering on graphs, anti-founded sets and polynomial time computability	2000-01-12	Paper
\(\Delta\)-languages for sets and LOGSPACE computable graph transformers	1998-07-23	Paper
https://portal.mardi4nfdi.de/entity/Q4376058	1998-02-08	Paper
COMPLEXITY OF UNIVERSAL CIRCUMSCRIPTION	1994-04-27	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Alexej P. Lisitsa