| Publication | Date of Publication | Type |
|---|
Perspective on complexity measures targeting read-once branching programs
Information and Computation | 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
Journal of the ACM | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7577578 (Why is no real title available?)
| 2022-08-30 | Paper |
Testing membership: Beyond permutation groups
STACS 89 | 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
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Better complexity bounds for cost register automata
Theory of Computing Systems | 2019-06-27 | Paper |
The algebraic theory of Parikh automata
Theory of Computing Systems | 2018-07-23 | Paper |
Reachability in two-dimensional vector addition systems with states is PSPACE-complete
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Handling infinitely branching well-structured transition systems
Information and Computation | 2017-12-20 | Paper |
scientific article; zbMATH DE number 6790161 (Why is no real title available?)
| 2017-10-12 | Paper |
The complexity of intersecting finite automata having few final states
Computational Complexity | 2016-11-30 | Paper |
Bounded Parikh automata
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Pebbles and branching programs for tree evaluation
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Unambiguous constrained automata
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
Handling infinitely branching WSTS
Automata, Languages, and Programming | 2014-07-01 | Paper |
scientific article; zbMATH DE number 6292740 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2014-05-07 | Paper |
On generalized addition chains
| 2014-04-09 | Paper |
The algebraic theory of Parikh automata
Algebraic Informatics | 2013-09-20 | Paper |
Bounded Parikh automata
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
Affine Parikh automata
RAIRO - Theoretical Informatics and Applications | 2012-11-22 | Paper |
Unambiguous constrained automata
Developments in Language Theory | 2012-11-02 | Paper |
Fractional pebbling and thrifty branching programs
| 2012-10-24 | Paper |
The lower reaches of circuit uniformity
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
The complexity of intersecting finite automata having few final states
Computer Science – Theory and Applications | 2012-09-10 | Paper |
The complexity of solitaire
Theoretical Computer Science | 2009-11-06 | Paper |
Branching Programs for Tree Evaluation
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Few Product Gates But Many Zeros
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Worst Case Nonzero-Error Interactive Communication
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
The Complexity of Solitaire
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Incremental branching programs
Theory of Computing Systems | 2008-06-17 | Paper |
The complexity of membership problems for circuits over sets of natural numbers
Computational Complexity | 2008-03-05 | Paper |
Incremental Branching Programs
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Corrigendum to ``Completeness results for graph isomorphism
Journal of Computer and System Sciences | 2006-06-30 | Paper |
The many faces of a translation
Journal of Computer and System Sciences | 2006-01-10 | Paper |
A well-structured framework for analysing Petri net extensions
Information and Computation | 2005-02-22 | Paper |
Arithmetic Circuits and Polynomial Replacement Systems
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2080200 (Why is no real title available?)
| 2004-08-04 | Paper |
The complexity of tensor calculus
Computational Complexity | 2003-11-17 | Paper |
Completeness results for graph isomorphism.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
scientific article; zbMATH DE number 1962845 (Why is no real title available?)
| 2003-08-11 | Paper |
Alternating and empty alternating auxiliary stack automata.
Theoretical Computer Science | 2003-05-25 | Paper |
scientific article; zbMATH DE number 1759404 (Why is no real title available?)
| 2002-11-04 | Paper |
scientific article; zbMATH DE number 1759428 (Why is no real title available?)
| 2002-11-04 | Paper |
On the complexity of some problems on groups input as multiplication tables
Journal of Computer and System Sciences | 2002-07-22 | Paper |
scientific article; zbMATH DE number 1670879 (Why is no real title available?)
| 2001-11-11 | Paper |
The descriptive complexity approach to LOGCFL
Journal of Computer and System Sciences | 2001-10-14 | Paper |
scientific article; zbMATH DE number 1633145 (Why is no real title available?)
| 2001-08-12 | Paper |
Reversible space equals deterministic space
Journal of Computer and System Sciences | 2000-06-05 | Paper |
Separation of the monotone NC hierarchy
Combinatorica | 2000-05-14 | Paper |
scientific article; zbMATH DE number 1335884 (Why is no real title available?)
| 2000-05-04 | Paper |
scientific article; zbMATH DE number 1303030 (Why is no real title available?)
| 2000-02-09 | Paper |
scientific article; zbMATH DE number 1304331 (Why is no real title available?)
| 1999-11-15 | Paper |
Verifying identical communicating processes is undecidable
Theoretical Computer Science | 1998-10-22 | Paper |
Nondeterministic \(NC^1\) computation
Journal of Computer and System Sciences | 1998-01-01 | Paper |
Finite Monoids: From Word to Circuit Evaluation
SIAM Journal on Computing | 1997-08-03 | Paper |
Logspace and logtime leaf languages
Information and Computation | 1997-02-23 | Paper |
Circuits, matrices, and nonassociative computation
Journal of Computer and System Sciences | 1996-04-29 | Paper |
The membership problem in aperiodic transformation monoids
Journal of the ACM | 1995-01-05 | Paper |
scientific article; zbMATH DE number 512861 (Why is no real title available?)
| 1994-04-07 | Paper |
\(NC^ 1\): The automata-theoretic viewpoint
Computational Complexity | 1993-10-10 | Paper |
Extensions to Barrington's M-program model
Theoretical Computer Science | 1993-05-16 | Paper |
Oracle branching programs and Logspace versus \(P^*\)
Information and Computation | 1992-06-28 | Paper |
scientific article; zbMATH DE number 17817 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 4117877 (Why is no real title available?)
| 1989-01-01 | Paper |
Parallel algorithms for solvable permutation groups
Journal of Computer and System Sciences | 1988-01-01 | Paper |
Problems complete for deterministic logarithmic space
Journal of Algorithms | 1987-01-01 | Paper |
The Parallel Complexity of Abelian Permutation Group Problems
SIAM Journal on Computing | 1987-01-01 | Paper |
Permutations of bounded degree generate groups of polynomial diameter
Information Processing Letters | 1984-01-01 | Paper |
