| Publication | Date of Publication | Type |
|---|
Topological network-control games
Theoretical Computer Science | 2026-03-05 | Paper |
| Topological network-control games played on graphs | 2025-07-23 | Paper |
| Defining algorithmically presented structures in first order logic | 2025-06-18 | Paper |
Finding small feedback arc sets on large graphs
Computers & Operations Research | 2025-05-26 | Paper |
Network control games played on graphs
Theoretical Computer Science | 2025-03-11 | Paper |
Automatic presentations of structures
Lecture Notes in Computer Science | 2023-12-12 | Paper |
| Automatic Equivalence Structures of Polynomial Growth. | 2023-02-07 | Paper |
String compression in FA-presentable structures
Theoretical Computer Science | 2023-02-01 | Paper |
Random Subgroups of Rationals
(available as arXiv preprint) | 2022-07-21 | Paper |
Deciding Parity Games in Quasi-polynomial Time
SIAM Journal on Computing | 2022-05-03 | Paper |
The isomorphism problem for tree-automatic ordinals with addition
Information Processing Letters | 2019-09-20 | Paper |
| Degree spectra of unary relations on $\langle \omega, \leq \rangle$ | 2019-04-23 | Paper |
| A brief excursion to parity games | 2018-11-22 | Paper |
Finitely generated semiautomatic groups
Computability | 2018-09-20 | Paper |
A quest for algorithmically random infinite structures
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Semiautomatic structures
Theory of Computing Systems | 2018-02-01 | Paper |
Deciding parity games in quasipolynomial time
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
A quest for algorithmically random infinite structures. II
Logical Foundations of Computer Science | 2017-07-21 | Paper |
Automatic linear orders and trees
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Algorithmically random universal algebras
Information and Complexity | 2017-03-31 | Paper |
Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
Algorithmica | 2016-12-21 | Paper |
Decision Problems for Finite Automata over Infinite Algebraic Structures
Implementation and Application of Automata | 2016-11-09 | Paper |
Linear orders realized by c.e. equivalence relations
Journal of Symbolic Logic | 2016-08-19 | Paper |
Finitely generated semiautomatic groups
Pursuit of the Universal | 2016-08-17 | Paper |
Cayley automatic representations of wreath products
International Journal of Foundations of Computer Science | 2016-06-23 | Paper |
Tree-automatic scattered linear orders
Theoretical Computer Science | 2016-03-31 | Paper |
Reducibilities among equivalence relations induced by recursively enumerable structures
Theoretical Computer Science | 2015-12-15 | Paper |
Dynamic interval scheduling for multiple machines
Algorithms and Computation | 2015-09-11 | Paper |
Graphs realised by r.e. equivalence relations
Annals of Pure and Applied Logic | 2015-06-17 | Paper |
Dynamic algorithms for monotonic interval scheduling problem
Theoretical Computer Science | 2014-12-02 | Paper |
On automatic transitive graphs
Developments in Language Theory | 2014-10-14 | Paper |
Semiautomatic structures
Computer Science - Theory and Applications | 2014-06-24 | Paper |
From automatic structures to automatic groups.
Groups, Geometry, and Dynamics | 2014-06-19 | Paper |
Finitely presented expansions of groups, semigroups, and algebras
Transactions of the American Mathematical Society | 2014-03-12 | Paper |
Dynamising Interval Scheduling: The Monotonic Case
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Limitwise monotonic sequences and degree spectra of structures
Proceedings of the American Mathematical Society | 2013-08-30 | Paper |
On decidable and computable models of theories
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Finitely presented expansions of computably enumerable semigroups
Algebra and Logic | 2013-02-21 | Paper |
Computable isomorphisms of Boolean algebras with operators
Studia Logica | 2012-12-12 | Paper |
On state complexity of finite word and tree languages
Developments in Language Theory | 2012-11-02 | Paper |
Finite automata over structures (extended abstract)
Lecture Notes in Computer Science | 2012-07-16 | Paper |
| Efficient algorithms for games played on trees with back-edges | 2012-03-22 | Paper |
Extracting winning strategies in update games
Models of Computation in Context | 2011-09-09 | Paper |
Model-theoretic complexity of automatic structures
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Model-theoretic complexity of automatic structures
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
On complexity of Ehrenfeucht-Fraïssé games
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
| Lectures on discrete mathematics for computer science | 2011-06-10 | Paper |
Automatic structures and groups
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Three lectures on automatic structures
(available as arXiv preprint) | 2011-03-02 | Paper |
On Index Sets of Some Properties of Computable Algebras
Programs, Proofs, Processes | 2010-07-29 | Paper |
A computable ℵ<sub>0</sub>-categorical structure whose theory computes true arithmetic
Journal of Symbolic Logic | 2010-06-24 | Paper |
A Dynamic Algorithm for Reachability Games Played on Trees
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
| scientific article; zbMATH DE number 5605134 (Why is no real title available?) | 2009-09-19 | Paper |
Unary automatic graphs: an algorithmic perspective
Mathematical Structures in Computer Science | 2009-03-24 | Paper |
Linear orders with distinguished function symbol
Archive for Mathematical Logic | 2009-03-17 | Paper |
Computable categoricity and the Ershov hierarchy
Annals of Pure and Applied Logic | 2008-12-05 | Paper |
When Is Reachability Intrinsically Decidable?
Developments in Language Theory | 2008-10-30 | Paper |
Computable Categoricity of Graphs with Finite Components
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Model Theoretic Complexity of Automatic Structures (Extended Abstract)
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Unary Automatic Graphs: An Algorithmic Perspective
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Unary Automatic Graphs: An Algorithmic Perspective
Lecture Notes in Computer Science | 2008-05-27 | Paper |
On Complexity of Ehrenfeucht-Fraïssé Games
Logical Foundations of Computer Science | 2008-01-04 | Paper |
Applications of Kolmogorov complexity to computable model theory
Journal of Symbolic Logic | 2007-10-17 | Paper |
Applications of Kolmogorov complexity to computable model theory
Journal of Symbolic Logic | 2007-10-17 | Paper |
Automatic Structures: Richness and Limitations
Logical Methods in Computer Science | 2007-10-11 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
On the computability-theoretic complexity of trivial, strongly minimal models
Proceedings of the American Mathematical Society | 2007-09-27 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Update games and update networks
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
An uncountably categorical theory whose only computably presentable model is saturated
Notre Dame Journal of Formal Logic | 2006-10-04 | Paper |
^0_1-presentations of algebras
Archive for Mathematical Logic | 2006-09-26 | Paper |
Complexity of Categorical Theories with Computable Models
Algebra and Logic | 2006-07-18 | Paper |
COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
International Journal of Algebra and Computation | 2005-09-12 | Paper |
| scientific article; zbMATH DE number 2167522 (Why is no real title available?) | 2005-05-12 | Paper |
A computably categorical structure whose expansion by a constant has infinite computable dimension
Journal of Symbolic Logic | 2005-02-09 | Paper |
| scientific article; zbMATH DE number 2081020 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2063223 (Why is no real title available?) | 2004-03-29 | Paper |
| scientific article; zbMATH DE number 2040323 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 2040951 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 1953100 (Why is no real title available?) | 2003-07-25 | Paper |
On algebraic and logical specifications of classes of regular languages.
Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1735822 (Why is no real title available?) | 2003-01-30 | Paper |
Degree spectra and computable dimensions in algebraic structures
Annals of Pure and Applied Logic | 2002-08-22 | Paper |
| scientific article; zbMATH DE number 1696528 (Why is no real title available?) | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1747445 (Why is no real title available?) | 2002-05-29 | Paper |
| scientific article; zbMATH DE number 2024632 (Why is no real title available?) | 2002-01-01 | Paper |
Recursively enumerable reals and Chaitin \(\Omega\) numbers
Theoretical Computer Science | 2001-08-20 | Paper |
| On Computability Theoretic Properties of Structures and Their Cartesian Products | 2001-07-16 | Paper |
Automata theory and its applications
Progress in Computer Science and Applied Logic | 2001-07-09 | Paper |
| scientific article; zbMATH DE number 1531926 (Why is no real title available?) | 2001-05-28 | Paper |
| scientific article; zbMATH DE number 1568930 (Why is no real title available?) | 2001-03-28 | Paper |
| scientific article; zbMATH DE number 1497854 (Why is no real title available?) | 2001-03-05 | Paper |
| scientific article; zbMATH DE number 1543067 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1553567 (Why is no real title available?) | 2001-01-16 | Paper |
| scientific article; zbMATH DE number 1405572 (Why is no real title available?) | 2000-09-15 | Paper |
| scientific article; zbMATH DE number 1499098 (Why is no real title available?) | 2000-09-03 | Paper |
Finite nondeterministic automata: simulation and minimality
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1405578 (Why is no real title available?) | 2000-07-24 | Paper |
Computably categorical structures and expansions by constants
Journal of Symbolic Logic | 2000-01-09 | Paper |
Decidable Kripke models of intuitionistic theories
Annals of Pure and Applied Logic | 1999-11-16 | Paper |
| scientific article; zbMATH DE number 1222106 (Why is no real title available?) | 1999-10-28 | Paper |
Computable isomorphisms, degree spectra of relations, and Scott families
Annals of Pure and Applied Logic | 1999-08-16 | Paper |
On initial segments of computable linear orders
Order | 1999-06-27 | Paper |
Randnomness, computability, and algebraic specifications
Annals of Pure and Applied Logic | 1999-06-27 | Paper |
Computable Kripke models and intermediate logics
Information and Computation | 1999-01-18 | Paper |
Deterministic automata. Simulation, universality and minimality
Annals of Pure and Applied Logic | 1998-06-11 | Paper |
Games with Unknown Past
Mathematical Logic Quarterly | 1998-06-08 | Paper |
Computable models of theories with few models
Notre Dame Journal of Formal Logic | 1998-05-04 | Paper |
| scientific article; zbMATH DE number 1136091 (Why is no real title available?) | 1998-04-01 | Paper |
| scientific article; zbMATH DE number 1064118 (Why is no real title available?) | 1997-11-20 | Paper |
| scientific article; zbMATH DE number 806750 (Why is no real title available?) | 1995-10-17 | Paper |
