| Publication | Date of Publication | Type |
|---|
Quadratic equations in graph products of groups and the exponent of periodicity
Journal of Groups, Complexity, Cryptology | 2026-08-05 | Paper |
Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
SIAM Journal on Computing | 2024-12-12 | Paper |
| Elements of Discrete Mathematics | 2023-11-07 | Paper |
Reachability games and parity games
Lecture Notes in Computer Science | 2023-07-28 | Paper |
Removing -transitions in timed automata
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Properties of graphs specified by a regular language
Acta Informatica | 2022-08-30 | Paper |
Word problems over traces which are solvable in linear time
STACS 89 | 2022-08-16 | Paper |
Properties of graphs specified by a regular language
Developments in Language Theory | 2022-03-25 | Paper |
Regular matching problems for infinite trees
(available as arXiv preprint) | 2022-02-09 | Paper |
| Regular matching problems for infinite trees | 2022-02-09 | Paper |
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
Solutions to twisted word equations and equations in virtually free groups
International Journal of Algebra and Computation | 2020-07-24 | Paper |
Context-Free Groups and Bass–Serre Theory
Advanced Courses in Mathematics - CRM Barcelona | 2020-07-13 | Paper |
| scientific article; zbMATH DE number 7204548 (Why is no real title available?) | 2020-05-27 | Paper |
A domain for concurrent termination a generalization of Mazurkiewicz traces (extended abstract)
Automata, Languages and Programming | 2019-01-10 | Paper |
Regular languages are Church-Rosser congruential
Journal of the ACM | 2018-08-02 | Paper |
Regular languages are Church-Rosser congruential
Journal of the ACM | 2018-08-02 | Paper |
Solving trace equations using lexicographical normal forms
Automata, Languages and Programming | 2018-07-04 | Paper |
Solutions of word equations over partially commutative structures
(available as arXiv preprint) | 2017-12-19 | Paper |
| Characterizing classes of regular languages using prefix codes of bounded synchronization delay | 2017-12-19 | Paper |
On codings of traces
STACS 95 | 2017-12-04 | Paper |
Trace rewriting: Computing normal forms in time O(n log n)
STACS 96 | 2017-11-16 | Paper |
Church-Rosser systems, codes with bounded synchronization delay and local Rees extensions
(available as arXiv preprint) | 2017-11-15 | Paper |
Characterizing classes of regular languages using prefix codes of bounded synchronization delay
International Journal of Algebra and Computation | 2017-11-03 | Paper |
Equations over free inverse monoids with idempotent variables
Theory of Computing Systems | 2017-10-20 | Paper |
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem
Journal of Symbolic Computation | 2017-06-01 | Paper |
QuickHeapsort: modifications and improved analysis
Theory of Computing Systems | 2017-01-18 | Paper |
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits
Algorithmica | 2016-12-21 | Paper |
Finding all solutions of equations in free groups and monoids with involution
Information and Computation | 2016-11-18 | Paper |
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem.
Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
Solution sets for equations over free groups are EDT0L languages
International Journal of Algebra and Computation | 2016-09-23 | Paper |
Asymptotic approximation for the quotient complexities of atoms
Acta Cybernetica | 2016-05-03 | Paper |
Discrete algebraic methods. Arithmetic, cryptography, automata and groups
De Gruyter Textbook | 2016-04-05 | Paper |
A note on monitors and Büchi automata
Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
Logspace computations in graph products
Journal of Symbolic Computation | 2016-02-11 | Paper |
A survey on the local divisor technique
Theoretical Computer Science | 2015-12-10 | Paper |
Logspace computations in graph products
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Solution sets for equations over free groups are EDT0L languages
Automata, Languages, and Programming | 2015-11-04 | Paper |
Equations over free inverse monoids with idempotent variables
Lecture Notes in Computer Science | 2015-10-20 | Paper |
More than 1700 years of word equations
Algebraic Informatics | 2015-09-22 | Paper |
Omega-rational expressions with bounded synchronization delay
Theory of Computing Systems | 2015-07-20 | Paper |
SLP compression for solutions of equations with constraints in free and hyperbolic groups.
International Journal of Algebra and Computation | 2015-04-21 | Paper |
| Solution sets for equations over free groups are EDT0L languages -- ICALP 2015 version | 2015-02-11 | Paper |
Finding All Solutions of Equations in Free Groups and Monoids with Involution
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Topology, monitorable properties and runtime verification
Theoretical Computer Science | 2014-06-10 | Paper |
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Cyclic rewriting and conjugacy problems.
Groups, Complexity, Cryptology | 2014-01-30 | Paper |
Logspace computations in Coxeter groups and graph groups.
Computational and Combinatorial Group Theory and Cryptography | 2014-01-03 | Paper |
Elements of discrete mathematics. Numbers and counting, graphs and lattices
De Gruyter Studium | 2013-07-23 | Paper |
Discrete algebraic methods. Arithmetic, cryptography, automata and groups
De Gruyter Studium | 2013-07-23 | Paper |
QuickHeapsort: modifications and improved analysis
Lecture Notes in Computer Science | 2013-06-14 | Paper |
Context-free groups and their structure trees.
International Journal of Algebra and Computation | 2013-06-05 | Paper |
Efficient algorithms for highly compressed data: the word problem in Higman's group is in P.
International Journal of Algebra and Computation | 2013-01-30 | Paper |
GROUP EXTENSIONS OVER INFINITE WORDS
International Journal of Foundations of Computer Science | 2013-01-18 | Paper |
Regular languages are Church-Rosser congruential
Automata, Languages, and Programming | 2012-11-01 | Paper |
Deciding regularity of hairpin completions of regular languages in polynomial time
Information and Computation | 2012-10-11 | Paper |
Star-free languages are Church-Rosser congruential
Theoretical Computer Science | 2012-10-11 | Paper |
On distributed monitoring of asynchronous systems
Logic, Language, Information and Computation | 2012-09-21 | Paper |
Bounded synchronization delay in omega-rational expressions
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Efficient algorithms for highly compressed data: the word problem in Higman's group is in P
(available as arXiv preprint) | 2012-08-23 | Paper |
Logspace computations in graph groups and Coxeter groups.
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
The Krohn-Rhodes theorem and local divisors
Fundamenta Informaticae | 2012-06-20 | Paper |
The Krohn-Rhodes theorem and local divisors
Fundamenta Informaticae | 2012-06-20 | Paper |
Language theoretical properties of hairpin formations
Theoretical Computer Science | 2012-05-30 | Paper |
| Fragments of first-order logic over infinite words | 2012-04-24 | Paper |
It is NL-complete to decide whether a hairpin completion of regular languages is regular
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
Solving word problems in group extensions over infinite words
Developments in Language Theory | 2011-07-29 | Paper |
Fragments of first-order logic over infinite words
Theory of Computing Systems | 2011-05-23 | Paper |
Local temporal logic is expressively complete for cograph dependence alphabets
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
On computing geodesics in Baumslag-Solitar groups.
International Journal of Algebra and Computation | 2011-05-03 | Paper |
| First-order definable languages | 2011-03-30 | Paper |
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
Implementation and Application of Automata | 2011-02-11 | Paper |
Geodesic rewriting systems and pregroups
(available as arXiv preprint) | 2010-09-14 | Paper |
Weinbaum factorizations of primitive words
Russian Mathematics | 2010-02-05 | Paper |
On the Hairpin Completion of Regular Languages
Theoretical Aspects of Computing - ICTAC 2009 | 2009-08-20 | Paper |
Some remarks about stabilizers
Theoretical Computer Science | 2009-08-07 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
| Local safety and local liveness for distributed systems | 2009-07-27 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Partially commutative inverse monoids.
Semigroup Forum | 2008-12-02 | Paper |
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
International Journal of Foundations of Computer Science | 2008-11-24 | Paper |
WORD EQUATIONS OVER GRAPH PRODUCTS
International Journal of Algebra and Computation | 2008-08-26 | Paper |
| scientific article; zbMATH DE number 5286857 (Why is no real title available?) | 2008-06-11 | Paper |
ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS
International Journal of Algebra and Computation | 2008-05-20 | Paper |
| scientific article; zbMATH DE number 5222362 (Why is no real title available?) | 2008-01-02 | Paper |
On First-Order Fragments for Words and Mazurkiewicz Traces
Developments in Language Theory | 2007-11-28 | Paper |
Partially Commutative Inverse Monoids
Lecture Notes in Computer Science | 2007-09-05 | Paper |
SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE
International Journal of Algebra and Computation | 2007-03-21 | Paper |
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation | 2007-01-22 | Paper |
| scientific article; zbMATH DE number 5051547 (Why is no real title available?) | 2006-09-06 | Paper |
From local to global temporal logics over Mazurkiewicz traces.
Theoretical Computer Science | 2006-05-18 | Paper |
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation | 2005-11-22 | Paper |
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation | 2005-02-22 | Paper |
Regular frequency computations
Theoretical Computer Science | 2005-02-22 | Paper |
Existential and positive theories of equations in graph products
Theory of Computing Systems | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2086411 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087486 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1948486 (Why is no real title available?) | 2003-07-13 | Paper |
A structural property of regular frequency computations.
Theoretical Computer Science | 2003-01-22 | Paper |
A NOTE ON THE EXISTENTIAL THEORY OF EQUATIONS IN PLAIN GROUPS
International Journal of Algebra and Computation | 2002-12-15 | Paper |
LTL is expressively complete for Mazurkiewicz traces
Journal of Computer and System Sciences | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1754619 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1688361 (Why is no real title available?) | 2002-01-09 | Paper |
