| Publication | Date of Publication | Type |
|---|
Exponent equations in HNN-extensions
| 2025-01-17 | Paper |
On the complexity of diameter and related problems in permutation groups
| 2024-11-14 | Paper |
Compressed decision problems in hyperbolic groups
Groups, Geometry, and Dynamics | 2024-10-15 | Paper |
Subgroup membership in \(\mathrm{GL}(2, \mathrm{Z})\)
Theory of Computing Systems | 2024-10-07 | Paper |
Low-latency sliding window algorithms for formal languages
| 2024-09-12 | Paper |
Exponent equations in HNN-extensions
Journal of Groups, Complexity, Cryptology | 2024-09-10 | Paper |
Membership problems in finite groups
| 2024-08-06 | Paper |
Streaming word problems
| 2024-08-06 | Paper |
The power word problem in graph products
Theory of Computing Systems | 2024-07-29 | Paper |
Knapsack and the power word problem in solvable Baumslag–Solitar groups
International Journal of Algebra and Computation | 2023-06-01 | Paper |
Complexity of word problems for HNN-extensions
Journal of Computer and System Sciences | 2023-04-21 | Paper |
scientific article; zbMATH DE number 7650239 (Why is no real title available?)
| 2023-02-03 | Paper |
Balancing straight-line programs for strings and trees
| 2022-12-16 | Paper |
Balancing Straight-line Programs
Journal of the ACM | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7561687 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561757 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559438 (Why is no real title available?)
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559146 (Why is no real title available?)
| 2022-07-18 | Paper |
Membership Problems in Finite Groups
| 2022-06-23 | Paper |
Complexity of word problems for HNN-extensions
Fundamentals of Computation Theory | 2022-05-20 | Paper |
Compression techniques in group theory
| 2022-03-22 | Paper |
Entropy Bounds for Grammar-Based Tree Compressors
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Exponent equations in HNN-extensions
| 2022-02-08 | Paper |
Streaming word problems
| 2022-02-08 | Paper |
Closure properties of knapsack semilinear groups
Journal of Algebra | 2021-10-22 | Paper |
Average case analysis of leaf-centric binary tree sources
| 2021-08-04 | Paper |
Sliding windows over context-free languages
| 2021-08-04 | Paper |
Derandomization for sliding window algorithms with strict correctness
Theory of Computing Systems | 2021-08-03 | Paper |
Randomized sliding window algorithms for regular languages
| 2021-07-28 | Paper |
The Smallest Grammar Problem Revisited
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
scientific article; zbMATH DE number 7297838 (Why is no real title available?)
| 2021-01-19 | Paper |
Largest common prefix of a regular tree language
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Knapsack problems for wreath products
| 2020-08-05 | Paper |
Automata theory on sliding windows
| 2020-08-05 | Paper |
A Comparison of Empirical Tree Entropies
| 2020-06-01 | Paper |
Counting problems for Parikh images
| 2020-05-26 | Paper |
Grammar-based compression of unranked trees
Theory of Computing Systems | 2020-02-27 | Paper |
The complexity of knapsack problems in wreath products
| 2020-02-19 | Paper |
Knapsack and the power word problem in solvable Baumslag-Solitar groups
| 2020-02-07 | Paper |
Largest common prefix of a regular tree language
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Universal Tree Source Coding Using Grammar-Based Compression
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Knapsack in hyperbolic groups
Journal of Algebra | 2019-12-27 | Paper |
Circuits and Expressions over Finite Semirings
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
A universal tree balancing theorem
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Closure properties of knapsack semilinear groups
| 2019-11-28 | Paper |
Derandomization for sliding window algorithms with strict correctness
Computer Science – Theory and Applications | 2019-10-22 | Paper |
Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems
| 2019-09-30 | Paper |
Size-optimal top dag compression
Information Processing Letters | 2019-05-10 | Paper |
The power word problem
| 2019-04-17 | Paper |
Grammar-based compression of unranked trees
Lecture Notes in Computer Science | 2018-11-28 | Paper |
scientific article; zbMATH DE number 6970796 (Why is no real title available?)
| 2018-11-02 | Paper |
Knapsack in hyperbolic groups
Lecture Notes in Computer Science | 2018-10-23 | Paper |
The smallest grammar problem revisited
| 2018-10-17 | Paper |
Parallel identity testing for skew circuits with big powers and applications
International Journal of Algebra and Computation | 2018-10-12 | Paper |
Constant-time tree traversal and subtree equality check for grammar-compressed trees
Algorithmica | 2018-07-25 | Paper |
Compression of unordered XML trees
| 2018-07-18 | Paper |
Sliding window algorithms for regular languages
| 2018-06-26 | Paper |
Evaluation of circuits over nilpotent and polycyclic groups
Algorithmica | 2018-05-18 | Paper |
Average Case Analysis of Leaf-Centric Binary Tree Sources
| 2018-04-27 | Paper |
Querying regular languages over sliding windows
| 2018-04-19 | Paper |
Circuit evaluation for finite semirings
| 2018-04-19 | Paper |
The Complexity of Knapsack in Graph Groups
| 2018-04-19 | Paper |
Tree compression using string grammars
Algorithmica | 2018-04-11 | Paper |
Knapsack in graph groups
Theory of Computing Systems | 2018-03-01 | Paper |
Knapsack in graph groups, HNN-extensions and amalgamated products
| 2018-01-24 | Paper |
Processing succinct matrices and vectors
Theory of Computing Systems | 2017-10-20 | Paper |
Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
Theory of Computing Systems | 2017-10-20 | Paper |
Path checking for MTL and TPTL over data words
Logical Methods in Computer Science | 2017-10-12 | Paper |
Temporal logics with local constraints (invited talk)
| 2017-08-31 | Paper |
On the parallel complexity of bisimulation on finite systems
| 2017-07-19 | Paper |
On Boolean closed full trios and rational Kripke frames
Theory of Computing Systems | 2017-07-17 | Paper |
Constructing small tree grammars and small circuits for formulas
Journal of Computer and System Sciences | 2017-05-26 | Paper |
The complexity of decomposing modal and first-order theories
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Constructing small tree grammars and small circuits for formulas
| 2017-04-25 | Paper |
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
Algebra and Computer Science | 2017-04-11 | Paper |
On Boolean closed full trios and rational Kripke frames
| 2017-03-03 | Paper |
Approximation of smallest linear tree grammar
| 2017-03-03 | Paper |
Random presentations and random subgroups: a survey
| 2017-02-07 | Paper |
Compression of rewriting systems for termination analysis
| 2017-02-01 | Paper |
Approximation of smallest linear tree grammar
Information and Computation | 2016-11-18 | Paper |
The rational subset membership problem for groups: a survey
Groups St Andrews 2013 | 2016-07-29 | Paper |
Tree compression using string grammars
Lecture Notes in Computer Science | 2016-05-03 | Paper |
XML compression via directed acyclic graphs
Theory of Computing Systems | 2016-04-18 | Paper |
Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Path checking for MTL and TPTL over data words
Lecture Notes in Computer Science | 2015-11-10 | Paper |
Grammar-Based Tree Compression
Developments in Language Theory | 2015-11-10 | Paper |
Equality Testing of Compressed Strings
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Compressed tree canonization
Automata, Languages, and Programming | 2015-11-04 | Paper |
Evaluating matrix circuits
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
Lecture Notes in Computer Science | 2015-10-20 | Paper |
The Complexity of Decomposing Modal and First-Order Theories
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Parallel identity testing for skew circuits with big powers and applications
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Rational subsets and submonoids of wreath products.
Information and Computation | 2015-06-09 | Paper |
Rational subsets of unitriangular groups.
International Journal of Algebra and Computation | 2015-04-21 | Paper |
Processing succinct matrices and vectors
Lecture Notes in Computer Science | 2014-06-24 | Paper |
The Compressed Word Problem for Groups
SpringerBriefs in Mathematics | 2014-03-31 | Paper |
The first-order theory of ground tree rewrite graphs
Logical Methods in Computer Science | 2014-03-24 | Paper |
Algorithmics on SLP-compressed strings: a survey
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 |
Branching-time model checking of one-counter processes and timed automata
SIAM Journal on Computing | 2013-09-25 | Paper |
The isomorphism problem on classes of automatic structures with transitive relations
Transactions of the American Mathematical Society | 2013-09-04 | Paper |
Satisfiability of \(\mathrm{CTL}^{*}\) with constraints
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Rational subsets and submonoids of wreath products.
Lecture Notes in Computer Science | 2013-08-07 | Paper |
Tree-automatic well-founded trees
Logical Methods in Computer Science | 2013-07-09 | Paper |
Isomorphism of regular trees and words
Information and Computation | 2013-06-06 | Paper |
Compressed decision problems for graph products and applications to (outer) automorphism groups.
International Journal of Algebra and Computation | 2013-01-30 | Paper |
The isomorphism problem for \(\omega \)-automatic trees
Annals of Pure and Applied Logic | 2012-11-20 | Paper |
Leaf languages and string compression
| 2012-10-19 | Paper |
The first-order theory of ground tree rewrite graphs
| 2012-08-31 | Paper |
Parameter reduction and automata evaluation for grammar-compressed trees
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Tree-automatic well-founded trees
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Logspace computations in graph groups and Coxeter groups.
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Model-checking hierarchical structures
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Branching-time model checking of one-counter processes
| 2012-01-23 | Paper |
Automatic structures of bounded degree revisited
Journal of Symbolic Logic | 2011-12-23 | Paper |
Compressed word problems in HNN-extensions and amalgamated products
Theory of Computing Systems | 2011-10-11 | Paper |
Compressed word problems for inverse monoids
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Leaf languages and string compression
Information and Computation | 2011-07-08 | Paper |
Isomorphism of regular trees and words
Automata, Languages and Programming | 2011-07-07 | Paper |
Compressed membership in automata with compressed labels
Computer Science – Theory and Applications | 2011-06-17 | Paper |
Fixpoint logics over hierarchical structures
Theory of Computing Systems | 2011-04-01 | Paper |
Tilings and submonoids of metabelian groups.
Theory of Computing Systems | 2011-03-30 | Paper |
Submonoids and rational subsets of groups with infinitely many ends.
Journal of Algebra | 2010-11-18 | Paper |
Compressed membership problems for regular expressions and hierarchical automata
International Journal of Foundations of Computer Science | 2010-11-11 | Paper |
The isomorphism problem for \(\omega \)-automatic trees
Computer Science Logic | 2010-09-03 | Paper |
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
Developments in Language Theory | 2010-08-31 | Paper |
Some natural decision problems in automatic graphs
Journal of Symbolic Logic | 2010-06-24 | Paper |
An automata theoretic approach to the generalized word problem in graphs of groups.
Proceedings of the American Mathematical Society | 2010-03-08 | Paper |
Automatic structures of bounded degree
| 2010-02-24 | Paper |
Automatic Structures of Bounded Degree Revisited
Computer Science Logic | 2009-11-12 | Paper |
Compressed Word Problems in HNN-Extensions and Amalgamated Products
Computer Science - Theory and Applications | 2009-08-18 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Parameter Reduction in Grammar-Compressed Trees
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
PDL with intersection and converse: satisfiability and infinite-state model checking
Journal of Symbolic Logic | 2009-03-25 | Paper |
Infinite State Model-Checking of Propositional Dynamic Logics
Computer Science Logic | 2009-03-12 | Paper |
Partially commutative inverse monoids.
Semigroup Forum | 2008-12-02 | Paper |
The submonoid and rational subset membership problems for graph groups.
Journal of Algebra | 2008-10-06 | Paper |
WORD EQUATIONS OVER GRAPH PRODUCTS
International Journal of Algebra and Computation | 2008-08-26 | Paper |
Efficient Computation in Groups Via Compression
Computer Science – Theory and Applications | 2008-06-03 | Paper |
RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
International Journal of Algebra and Computation | 2008-05-20 | Paper |
ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS
International Journal of Algebra and Computation | 2008-05-20 | Paper |
First-order and counting theories ofω-automatic structures
Journal of Symbolic Logic | 2008-05-08 | Paper |
Theories of HNN-Extensions and Amalgamated Products
Automata, Languages and Programming | 2007-09-11 | Paper |
PDL with Intersection and Converse Is 2EXP-Complete
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Querying and Embedding Compressed Texts
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Partially Commutative Inverse Monoids
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Inverse monoids: decidability and complexity of algebraic questions.
Information and Computation | 2007-08-23 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
When Is a Graph Product of Groups Virtually-Free?
Communications in Algebra | 2007-03-30 | Paper |
The complexity of tree automata and XPath on grammar-compressed trees
Theoretical Computer Science | 2007-01-09 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Database Programming Languages
Lecture Notes in Computer Science | 2006-10-20 | Paper |
LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
International Journal of Algebra and Computation | 2006-08-14 | Paper |
Word Problems and Membership Problems on Compressed Words
SIAM Journal on Computing | 2006-06-01 | Paper |
Axiomatising divergence
Information and Computation | 2006-01-10 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
Complexity results for prefix grammars
RAIRO - Theoretical Informatics and Applications | 2005-07-13 | Paper |
Decidable first-order theories of one-step rewriting in trace monoids
Theory of Computing Systems | 2005-02-24 | Paper |
Logical aspects of Cayley-graphs: the group case
Annals of Pure and Applied Logic | 2005-01-31 | Paper |
Existential and positive theories of equations in graph products
Theory of Computing Systems | 2005-01-25 | Paper |
Realizability of high-level message sequence charts: closing the gaps
Theoretical Computer Science | 2004-10-27 | Paper |
Bounded MSC communication
Information and Computation | 2004-10-04 | Paper |
scientific article; zbMATH DE number 2086668 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086411 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086654 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2087438 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 1962836 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1927562 (Why is no real title available?)
| 2003-06-12 | Paper |
Confluence problems for trace rewriting systems
Information and Computation | 2003-01-14 | Paper |
A NOTE ON THE EXISTENTIAL THEORY OF EQUATIONS IN PLAIN GROUPS
International Journal of Algebra and Computation | 2002-12-15 | Paper |
scientific article; zbMATH DE number 1834672 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1722707 (Why is no real title available?)
| 2002-03-21 | Paper |
scientific article; zbMATH DE number 1615237 (Why is no real title available?)
| 2001-07-08 | Paper |
scientific article; zbMATH DE number 1418332 (Why is no real title available?)
| 2000-03-19 | Paper |
scientific article; zbMATH DE number 1354904 (Why is no real title available?)
| 1999-10-31 | Paper |
scientific article; zbMATH DE number 1304995 (Why is no real title available?)
| 1999-06-17 | Paper |
Parameterized Complexity of Factorization Problems
| N/A | Paper |
