| Publication | Date of Publication | Type |
|---|
| Perspective on complexity measures targeting read-once branching programs | 2024-12-03 | Paper |
| Perspective on complexity measures targetting read-once branching programs | 2023-05-18 | Paper |
| The Reachability Problem for Two-Dimensional Vector Addition Systems with States | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5101347 | 2022-08-30 | Paper |
| Testing membership: Beyond permutation groups | 2022-08-16 | Paper |
| Better complexity bounds for cost register automata | 2020-05-26 | Paper |
| Does Looking Inside a Circuit Help | 2020-05-26 | Paper |
| The Power of Programs over Monoids in DA | 2020-05-26 | Paper |
| Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method | 2019-12-06 | Paper |
| Better complexity bounds for cost register automata | 2019-06-27 | Paper |
| The algebraic theory of Parikh automata | 2018-07-23 | Paper |
| Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete | 2018-04-23 | Paper |
| Handling infinitely branching well-structured transition systems | 2017-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5367063 | 2017-10-12 | Paper |
| The complexity of intersecting finite automata having few final states | 2016-11-30 | Paper |
| Bounded Parikh automata | 2016-03-01 | Paper |
| Pebbles and Branching Programs for Tree Evaluation | 2015-09-24 | Paper |
| UNAMBIGUOUS CONSTRAINED AUTOMATA | 2014-08-04 | Paper |
| Handling Infinitely Branching WSTS | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414621 | 2014-05-07 | Paper |
| On Generalized Addition Chains | 2014-04-09 | Paper |
| The Algebraic Theory of Parikh Automata | 2013-09-20 | Paper |
| Bounded Parikh automata | 2013-07-30 | Paper |
| Affine Parikh automata | 2012-11-22 | Paper |
| Unambiguous Constrained Automata | 2012-11-02 | Paper |
| Fractional pebbling and thrifty branching programs | 2012-10-24 | Paper |
| The Lower Reaches of Circuit Uniformity | 2012-09-25 | Paper |
| The Complexity of Intersecting Finite Automata Having Few Final States | 2012-09-10 | Paper |
| The complexity of solitaire | 2009-11-06 | Paper |
| Branching Programs for Tree Evaluation | 2009-10-16 | Paper |
| Few Product Gates But Many Zeros | 2009-10-16 | Paper |
| Worst Case Nonzero-Error Interactive Communication | 2009-02-24 | Paper |
| The Complexity of Solitaire | 2008-09-17 | Paper |
| Incremental branching programs | 2008-06-17 | Paper |
| The complexity of membership problems for circuits over sets of natural numbers | 2008-03-05 | Paper |
| Incremental Branching Programs | 2007-05-02 | Paper |
| Corrigendum to ``Completeness results for graph isomorphism | 2006-06-30 | Paper |
| The many faces of a translation | 2006-01-10 | Paper |
| A well-structured framework for analysing Petri net extensions | 2005-02-22 | Paper |
| Arithmetic Circuits and Polynomial Replacement Systems | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472442 | 2004-08-04 | Paper |
| The complexity of tensor calculus | 2003-11-17 | Paper |
| Completeness results for graph isomorphism. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418682 | 2003-08-11 | Paper |
| Alternating and empty alternating auxiliary stack automata. | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536353 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536377 | 2002-11-04 | Paper |
| On the complexity of some problems on groups input as multiplication tables | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754205 | 2001-11-11 | Paper |
| The descriptive complexity approach to LOGCFL | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2733893 | 2001-08-12 | Paper |
| Reversible space equals deterministic space | 2000-06-05 | Paper |
| Separation of the monotone NC hierarchy | 2000-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258575 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249530 | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251062 | 1999-11-15 | Paper |
| Verifying identical communicating processes is undecidable | 1998-10-22 | Paper |
| Nondeterministic \(NC^1\) computation | 1998-01-01 | Paper |
| Finite Monoids: From Word to Circuit Evaluation | 1997-08-03 | Paper |
| Logspace and logtime leaf languages | 1997-02-23 | Paper |
| Circuits, matrices, and nonassociative computation | 1996-04-29 | Paper |
| The membership problem in aperiodic transformation monoids | 1995-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281558 | 1994-04-07 | Paper |
| \(NC^ 1\): The automata-theoretic viewpoint | 1993-10-10 | Paper |
| Extensions to Barrington's M-program model | 1993-05-16 | Paper |
| Oracle branching programs and Logspace versus \(P^*\) | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975161 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732127 | 1989-01-01 | Paper |
| Parallel algorithms for solvable permutation groups | 1988-01-01 | Paper |
| Problems complete for deterministic logarithmic space | 1987-01-01 | Paper |
| The Parallel Complexity of Abelian Permutation Group Problems | 1987-01-01 | Paper |
| Permutations of bounded degree generate groups of polynomial diameter | 1984-01-01 | Paper |
