Markus Lohrey

Theory Comput. Syst., August, 2024

The Power Word Problem in Graph Products.

[BibT_eX]

[DOI]

Florian Stober

Armin Weiß

Theory Comput. Syst., June, 2024

Enumeration for MSO-Queries on Compressed Trees.

[BibT_eX]

[DOI]

Markus L. Schmid

Proc. ACM Manag. Data, 2024

Regular Languages in the Sliding Window Model.

[BibT_eX]

[DOI]

Konstantinos Mamouras

Tatiana Starikovskaya

CoRR, 2024

Streaming in Graph Products.

[BibT_eX]

[DOI]

Julio Xochitemol

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Membership Problems in Infinite Groups.

[BibT_eX]

[DOI]

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023

Complexity of word problems for HNN-extensions.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., August, 2023

Knapsack and the power word problem in solvable Baumslag-Solitar groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2023

On the Complexity of Diameter and Related Problems in Permutation Groups.

[BibT_eX]

[DOI]

Andreas Rosowski

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, December, 2022

Membership Problems in Finite Groups.

[BibT_eX]

[DOI]

Andreas Rosowski

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Streaming Word Problems.

[BibT_eX]

[DOI]

Lukas Lück

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Exponent Equations in HNN-extensions.

[BibT_eX]

[DOI]

Michael Figelius

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

Low-Latency Sliding Window Algorithms for Formal Languages.

[BibT_eX]

[DOI]

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Entropy Bounds for Grammar-Based Tree Compressors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

The Smallest Grammar Problem Revisited.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Derandomization for Sliding Window Algorithms with Strict Correctness∗.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

Largest common prefix of a regular tree language.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

Balancing Straight-line Programs.

[BibT_eX]

[DOI]

J. ACM, 2021

Compression Techniques in Group Theory.

[BibT_eX]

[DOI]

Proceedings of the Connecting with Computability, 2021

2020

Grammar-Based Compression of Unranked Trees.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Combined compression of multiple correlated data streams for online-diagnosis systems.

[BibT_eX]

[DOI]

Microprocess. Microsystems, 2020

A Comparison of Empirical Tree Entropies.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2020

Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

The Complexity of Knapsack Problems in Wreath Products.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems.

[BibT_eX]

[DOI]

Proceedings of the 35th Computational Complexity Conference, 2020

Balancing Straight-Line Programs for Strings and Trees.

[BibT_eX]

[DOI]

Proceedings of the Beyond the Horizon of Computability, 2020

2019

A Universal Tree Balancing Theorem.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2019

Universal Tree Source Coding Using Grammar-Based Compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Size-optimal top dag compression.

[BibT_eX]

[DOI]

Kurt Sieber

Inf. Process. Lett., 2019

Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Compressed Decision Problems in Hyperbolic Groups.

[BibT_eX]

[DOI]

Derek F. Holt

Saul Schleimer

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

The Power Word Problem.

[BibT_eX]

[DOI]

Armin Weiß

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Sliding Window Property Testing for Regular Languages.

[BibT_eX]

[DOI]

Tatiana Starikovskaya

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Derandomization for Sliding Window Algorithms with Strict Correctness.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2019

2018

Circuits and Expressions over Finite Semirings.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2018

Knapsack in Graph Groups.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

An architecture for online-diagnosis systems supporting compressed communication.

[BibT_eX]

[DOI]

Microprocess. Microsystems, 2018

The Complexity of Bisimulation and Simulation on Finite Systems.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

Parallel identity testing for skew circuits with big powers and applications.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2018

Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees.

[BibT_eX]

[DOI]

Algorithmica, 2018

Evaluation of Circuits Over Nilpotent and Polycyclic Groups.

[BibT_eX]

[DOI]

Algorithmica, 2018

Tree Compression Using String Grammars.

[BibT_eX]

[DOI]

Algorithmica, 2018

Knapsack Problems for Wreath Products.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Automata Theory on Sliding Windows.

[BibT_eX]

[DOI]

Konstantinos Mamouras

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Knapsack in Hyperbolic Groups.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 12th International Conference, 2018

Sliding Windows over Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Average Case Analysis of Leaf-Centric Binary Tree Sources.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Sliding Window Algorithms for Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2018

Randomized Sliding Window Algorithms for Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

On Boolean Closed Full Trios and Rational Kripke Frames.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Processing Succinct Matrices and Vectors.

[BibT_eX]

[DOI]

Manfred Schmidt-Schauß

Theory Comput. Syst., 2017

Satisfiability of ECTL∗ with Local Tree Constraints.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Path Checking for MTL and TPTL over Data Words.

[BibT_eX]

[DOI]

Shiguang Feng

Karin Quaas

Log. Methods Comput. Sci., 2017

Constructing small tree grammars and small circuits for formulas.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Optimal top dag compression.

[BibT_eX]

[DOI]

Kurt Sieber

CoRR, 2017

Approximation ratio of RePair.

[BibT_eX]

[DOI]

CoRR, 2017

Querying languages over sliding windows.

[BibT_eX]

[DOI]

CoRR, 2017

The Complexity of Knapsack in Graph Groups.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Circuit Evaluation for Finite Semirings.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Counting Problems for Parikh Images.

[BibT_eX]

[DOI]

Christoph Haase

Stefan Kiefer

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Computing quantiles in Markov chains with multi-dimensional costs.

[BibT_eX]

[DOI]

Christoph Haase

Stefan Kiefer

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Universal tree source coding using grammar-based compression.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Compression of Unordered XML Trees.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Database Theory, 2017

2016

Satisfiability of ECTL⁎ with constraints.

[BibT_eX]

[DOI]

Claudia Carapelle

Alexander Kartzow

J. Comput. Syst. Sci., 2016

Approximation of smallest linear tree grammar.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Computation over Compressed Structured Data (Dagstuhl Seminar 16431).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2016

Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images.

[BibT_eX]

[DOI]

Christoph Haase

Stefan Kiefer

CoRR, 2016

Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products.

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

The Smallest Grammar Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

Querying Regular Languages over Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Traversing Grammar-Compressed Trees with Constant Delay.

[BibT_eX]

[DOI]

Proceedings of the 2016 Data Compression Conference, 2016

On the Parallel Complexity of Bisimulation on Finite Systems.

[BibT_eX]

[DOI]

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Computer Science, 2016

2015

The Complexity of Decomposing Modal and First-Order Theories.

[BibT_eX]

[DOI]

Jean Christoph Jung

ACM Trans. Comput. Log., 2015

XML Compression via Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Eric Nöth

Theory Comput. Syst., 2015

Rational subsets of unitriangular groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2015

Rational subsets and submonoids of wreath products.

[BibT_eX]

[DOI]

Benjamin Steinberg

Inf. Comput., 2015

Compressed Tree Canonization.

[BibT_eX]

[DOI]

Fabian Peternek

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Grammar-Based Tree Compression.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Equality Testing of Compressed Strings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

Satisfiability of ECTL* with Tree Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2015

Temporal Logics with Local Constraints (Invited Talk).

[BibT_eX]

[DOI]

Claudia Carapelle

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Evaluating Matrix Circuits.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

The First-Order Theory of Ground Tree Rewrite Graphs

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

On Boolean closed full trios and rational Kripke frames.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Constructing Small Tree Grammars and Small Circuits for Formulas.

[BibT_eX]

[DOI]

Eric Noeth

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

The Compressed Word Problem for Groups.

[BibT_eX]

[DOI]

Springer Briefs in Mathematics, Springer, ISBN: 978-1-4939-0747-2, 2014

2013

Branching-Time Model Checking of One-Counter Processes and Timed Automata.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

XML tree structure compression using RePair.

[BibT_eX]

[DOI]

Roy Mennicke

Inf. Syst., 2013

Isomorphism of regular trees and words.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Tree-Automatic Well-Founded Trees

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

XML Compression via DAGs.

[BibT_eX]

[DOI]

Mireille Bousquet-Mélou

Eric Noeth

CoRR, 2013

The isomorphism problem for ω-automatic trees.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2013

Compression of Rewriting Systems for Termination Analysis.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

XML compression via DAGs.

[BibT_eX]

[DOI]

Eric Noeth

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Satisfiability of CTL* with Constraints.

[BibT_eX]

[DOI]

Claudia Carapelle

Alexander Kartzow

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012

Parameter reduction and automata evaluation for grammar-compressed trees.

[BibT_eX]

[DOI]

Manfred Schmidt-Schauß

J. Comput. Syst. Sci., 2012

Model-checking hierarchical structures.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Compressed Decision Problems for Graph Products and Applications to (outer) Automorphism Groups.

[BibT_eX]

[DOI]

Niko Haubold

Int. J. Algebra Comput., 2012

Algorithmics on SLP-compressed strings: A survey.

[BibT_eX]

[DOI]

Groups Complex. Cryptol., 2012

Logspace Computations in Graph Groups and Coxeter Groups.

[BibT_eX]

[DOI]

Jonathan Kausch

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Tree-Automatic Well-Founded Trees.

[BibT_eX]

[DOI]

Alexander Kartzow

Proceedings of the How the World Computes, 2012

2011

Tilings and Submonoids of Metabelian Groups.

[BibT_eX]

[DOI]

Benjamin Steinberg

Theory Comput. Syst., 2011

Compressed Word Problems in HNN-extensions and Amalgamated Products.

[BibT_eX]

[DOI]

Niko Haubold

Theory Comput. Syst., 2011

Fixpoint Logics over Hierarchical Structures.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Automatic structures of bounded degree revisited.

[BibT_eX]

[DOI]

J. Symb. Log., 2011

Leaf languages and string compression.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Compressed Word Problems for Inverse Monoids.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Tree Structure Compression with RePair.

[BibT_eX]

[DOI]

Roy Mennicke

Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

Compressed Membership in Automata with Compressed Labels.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2011

2010

Some natural decision problems in automatic graphs.

[BibT_eX]

[DOI]

J. Symb. Log., 2010

Compressed Membership Problems for Regular Expressions and Hierarchical Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

The Isomorphism Problem for omega-Automatic Trees

[BibT_eX]

[DOI]

CoRR, 2010

Branching-time Model Checking of One-counter Processes.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

The Isomorphism Problem on Classes of Automatic Structures.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups.

[BibT_eX]

[DOI]

Niko Haubold

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

The Isomorphism Problem for omega-Automatic Trees.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009

PDL with intersection and converse: satisfiability and infinite-state model checking.

[BibT_eX]

[DOI]

Carsten Lutz

J. Symb. Log., 2009

Parameter Reduction in Grammar-Compressed Trees.

[BibT_eX]

[DOI]

Manfred Schmidt-Schauß

Proceedings of the Foundations of Software Science and Computational Structures, 2009

2008

First-order and counting theories of omega-automatic structures.

[BibT_eX]

[DOI]

J. Symb. Log., 2008

Efficient memory representation of XML document trees.

[BibT_eX]

[DOI]

Giorgio Busatto

Inf. Syst., 2008

Rational Subsets in HNN-Extensions and Amalgamated Products.

[BibT_eX]

[DOI]

Géraud Sénizergues

Int. J. Algebra Comput., 2008

Algorithmic Problems on Inverse Monoids over Virtually Free Groups.

[BibT_eX]

[DOI]

Nicole Ondrusch

Int. J. Algebra Comput., 2008

Word Equations over Graph Products.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2008

Hamiltonicity of automatic graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

08261 Executive Summary - Structure-Based Compression of Complex Massive Data.

[BibT_eX]

[DOI]

Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

08261 Abstracts Collection - Structure-Based Compression of Complex Massive Data.

[BibT_eX]

[DOI]

Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

Compressed membership problems revisited.

[BibT_eX]

Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

Euler paths and ends in automatic and recursive graphs.

[BibT_eX]

Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007

Inverse monoids: Decidability and complexity of algebraic questions.

[BibT_eX]

[DOI]

Nicole Ondrusch

Inf. Comput., 2007

The submonoid and rational subset membership problems for graph groups.

[BibT_eX]

Benjamin Steinberg

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

PDL with Intersection and Converse Is 2 EXP-Complete.

[BibT_eX]

[DOI]

Carsten Lutz

Proceedings of the Foundations of Software Science and Computational Structures, 2007

Application of verification techniques to inverse monoids.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

PDL with Intersection and Converse is 2EXP-complete.

[BibT_eX]

[DOI]

Carsten Lutz

Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

07441 Summary -- Algorithmic-Logical Theory of Infinite Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

Efficient Computation in Groups Via Compression.

[BibT_eX]

[DOI]

Saul Schleimer

Proceedings of the Computer Science, 2007

2006

The complexity of tree automata and XPath on grammar-compressed trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Word Problems and Membership Problems on Compressed Words.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Logical Aspects of Cayley-graphs: the Monoid Case.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2006

Querying and Embedding Compressed Texts.

[BibT_eX]

[DOI]

Yury Lifshits

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Partially Commutative Inverse Monoids.

[BibT_eX]

[DOI]

Alexander Miller

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Monadic Chain Logic Over Iterations and Applications to Pushdown Systems.

[BibT_eX]

[DOI]

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Theories of HNN-Extensions and Amalgamated Products.

[BibT_eX]

[DOI]

Géraud Sénizergues

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

First-Order and Counting Theories of omega-Automatic Structures.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2006

Infinite State Model-Checking of Propositional Dynamic Logics.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

Decidable First-Order Theories of One-Step Rewriting in Trace Monoids.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

Complexity results for prefix grammars.

[BibT_eX]

[DOI]

Holger Petersen

RAIRO Theor. Informatics Appl., 2005

Decidability and complexity in automatic monoids.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Axiomatising divergence.

[BibT_eX]

[DOI]

Pedro R. D'Argenio

Holger Hermanns

Inf. Comput., 2005

Logical aspects of Cayley-graphs: the group case.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2005

Tree Automata and XPath on Compressed Trees.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2005

Fixpoint Logics on Hierarchical Structures.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Efficient Memory Representation of XML Documents.

[BibT_eX]

[DOI]

Giorgio Busatto

Proceedings of the Database Programming Languages, 10th International Symposium, 2005

2004

Existential and Positive Theories of Equations in Graph Products.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2004

Bounded MSC communication.

[BibT_eX]

[DOI]

Anca Muscholl

Inf. Comput., 2004

Word Problems on Compressed Words.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Computational and logical aspects of infinite monoids.

[BibT_eX]

[DOI]

, 2003

Realizability of high-level message sequence charts: closing the gaps.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Decidable Theories of Cayley-Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Automatic Structures of Bounded Degree.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2003

2002

A Note on The Existential Theory of Equations in Plain Groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2002

On the Theory of One-Step Rewriting in Trace Monoids.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Safe Realizability of High-Level Message Sequence Charts.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2002, 2002

2001

Confluence Problems for Trace Rewriting Systems.

[BibT_eX]

[DOI]

Inf. Comput., 2001

On the Parallel Complexity of Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Word Problems for 2-Homogeneous Monoids and Symmetric Logspace.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

Word Problems and Confluence Problems for Restricted Semi-Thue Systems.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

1999

Complexity Results for Confluence Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Das Konfluenzproblem für Spurersetzungssysteme.

[BibT_eX]

[DOI]

PhD thesis, 1999

1998

NP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars.

[BibT_eX]

[DOI]

Acta Cybern., 1998

On the Confluence of Trace Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract).

[BibT_eX]

[DOI]

Holger Hermanns