| Publication | Date of Publication | Type |
|---|
On Jaffe's pumping lemma, revisited
Information and Computation | 2026-03-20 | Paper |
The pumping lemma for regular languages is hard
International Journal of Foundations of Computer Science | 2026-02-17 | Paper |
| More on language families with a decidable pumping-problem (extended abstract) | 2026-02-10 | Paper |
| On pumping constants and smallest grammars for context-free languages | 2026-01-08 | Paper |
On the complexity of rolling block, colour, and Alice mazes
Journal of Automata, Languages and Combinatorics | 2025-11-01 | Paper |
| On switching finite state automata | 2025-04-15 | Paper |
| The pumping lemma for context-free languages is undecidable | 2025-01-31 | Paper |
| On pumping preserving homomorphisms and the complexity of the pumping problem (extended abstract) | 2025-01-20 | Paper |
Development of a central-moment phase-field lattice Boltzmann model for thermocapillary flows: droplet capture and computational performance
Journal of Computational Physics | 2024-10-08 | Paper |
On Minimal Pumping Constants for Regular Languages
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
The pumping lemma for regular languages is hard
Implementation and Application of Automata | 2024-02-28 | Paper |
| On the accepting state complexity of operations on permutation automata | 2024-02-06 | Paper |
On the complexity of intersection non-emptiness for star-free language classes
(available as arXiv preprint) | 2024-02-05 | Paper |
On the accepting state complexity of operations on permutation automata
RAIRO - Theoretical Informatics and Applications | 2024-02-02 | Paper |
Computational complexity of reversible reaction systems
Reversible Computation | 2024-01-11 | Paper |
The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case
International Journal of Foundations of Computer Science | 2023-11-24 | Paper |
Advanced Automatic Code Generation for Multiple Relaxation-Time Lattice Boltzmann Methods
SIAM Journal on Scientific Computing | 2023-09-08 | Paper |
On Jaffe's pumping lemma, revisited
Descriptional Complexity of Formal Systems | 2023-08-17 | Paper |
Input-Driven Double-Head Pushdown Automata
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
| Optimal Regular Expressions for Palindromes of Given Length | 2023-08-08 | Paper |
| On the descriptional complexity of the direct product of finite automata | 2023-01-18 | Paper |
Comparison of free-surface and conservative Allen-Cahn phase-field lattice Boltzmann method
Journal of Computational Physics | 2022-11-29 | Paper |
| More on the descriptional complexity of products of finite automata | 2022-11-09 | Paper |
Parallel complexity of iterated morphisms and the arithmetic of small numbers
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Inductive counting below LOGSPACE
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
| On 25 years of CIAA through the lens of data science | 2022-08-16 | Paper |
| Semicomputable points in Euclidean spaces | 2022-07-21 | Paper |
| On minimizing regular expressions without Kleene star | 2022-05-20 | Paper |
| The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract) | 2022-03-25 | Paper |
| The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract) | 2022-03-22 | Paper |
| On the computational complexity of reaction systems, revisited | 2022-03-21 | Paper |
Nondeterministic right one-way jumping finite automata
Information and Computation | 2022-03-14 | Paper |
| Descriptional complexity of regular languages | 2022-02-04 | Paper |
| On the descriptional complexity of operations on semilinear sets | 2021-12-13 | Paper |
On the descriptional complexity of operations on semilinear sets
(available as arXiv preprint) | 2021-12-13 | Paper |
| Input-driven double-head pushdown automata | 2021-12-13 | Paper |
Input-driven double-head pushdown automata
(available as arXiv preprint) | 2021-12-13 | Paper |
Two-Sided Strictly Locally Testable Languages
Fundamenta Informaticae | 2021-11-15 | Paper |
On the number of active states in finite automata
Acta Informatica | 2021-07-23 | Paper |
| From finite automata to regular expressions and back -- a summary on descriptional complexity | 2021-06-22 | Paper |
| Cooperating distributed grammar systems of finite index working in hybrid modes | 2021-06-22 | Paper |
Cooperating distributed grammar systems of finite index working in hybrid modes
(available as arXiv preprint) | 2021-06-22 | Paper |
| More structural characterizations of some subregular language families by biautomata | 2021-06-22 | Paper |
More structural characterizations of some subregular language families by biautomata
(available as arXiv preprint) | 2021-06-22 | Paper |
| Automata that may change their mind | 2021-05-12 | Paper |
The ranges of accepting state complexities of languages resulting from some operations
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Decidability of right one-way jumping finite automata
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
| The magic number problem for subregular language families | 2021-02-24 | Paper |
| scientific article; zbMATH DE number 7301306 (Why is no real title available?) | 2021-01-26 | Paper |
| Multi-head finite automata: characterizations, concepts and open problems | 2021-01-20 | Paper |
Multi-head finite automata: characterizations, concepts and open problems
(available as arXiv preprint) | 2021-01-20 | Paper |
| Selection via the bogo-method -- more on the analysis of perversely awful randomized algorithms | 2020-08-11 | Paper |
| On the grammatical complexity of finite languages | 2020-06-30 | Paper |
Properties of right one-way jumping finite automata
Descriptional Complexity of Formal Systems | 2020-06-30 | Paper |
| Nondeterministic right one-way jumping finite automata (extended abstract) | 2020-05-12 | Paper |
| Non-recursive trade-offs are ``almost everywhere'' | 2020-05-12 | Paper |
| Semi-linear lattices and right one-way jumping finite automata (extended abstract) | 2020-05-06 | Paper |
One-time nondeterministic computations
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
| The range of state complexities of languages resulting from the cut operation | 2019-12-04 | Paper |
Properties of right one-way jumping finite automata
Theoretical Computer Science | 2019-11-07 | Paper |
A mesh of automata
Information and Computation | 2019-09-17 | Paper |
On bonded sequential and parallel insertion systems
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Operational state complexity and decidability of jumping finite automata
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
| Decidability of right one-way jumping finite automata | 2018-11-22 | Paper |
| On minimal grammar problems for finite languages | 2018-11-22 | Paper |
| Computational complexity of decision problems on self-verifying finite automata | 2018-11-22 | Paper |
| The ranges of accepting state complexities of languages resulting from some operations | 2018-11-07 | Paper |
Structure and Complexity of Some Subregular Language Families
The Role of Theory in Computer Science | 2018-09-20 | Paper |
Minimal reversible deterministic finite automata
International Journal of Foundations of Computer Science | 2018-05-15 | Paper |
On the computational complexity of problems related to distinguishability sets
Information and Computation | 2018-03-21 | Paper |
| Reversible nondeterministic finite automata | 2018-03-16 | Paper |
The degree of irreversibility in deterministic finite automata
International Journal of Foundations of Computer Science | 2018-02-22 | Paper |
Tight bounds for cut-operations on deterministic finite automata
Fundamenta Informaticae | 2018-01-19 | Paper |
On the Computational Complexity of Partial Word Automata Problems
Fundamenta Informaticae | 2017-11-09 | Paper |
| Operational state complexity and decidability of jumping finite automata | 2017-10-13 | Paper |
| On the mother of all automata: the position automaton | 2017-10-13 | Paper |
| On regular expression proof complexity | 2017-10-13 | Paper |
| One-time nondeterministic computations | 2017-08-31 | Paper |
| On the number of active states in deterministic and nondeterministic finite automata | 2017-08-22 | Paper |
More on Minimizing Finite Automata with Errors — Nondeterministic Machines
International Journal of Foundations of Computer Science | 2017-06-20 | Paper |
More on deterministic and nondeterministic finite cover automata
Theoretical Computer Science | 2017-06-19 | Paper |
The chop of languages
Theoretical Computer Science | 2017-06-15 | Paper |
| Self-assembling pushdown automata | 2016-12-16 | Paper |
The degree of irreversibility in deterministic finite automata
Implementation and Application of Automata | 2016-11-09 | Paper |
On measuring non-recursive trade-offs
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
Hairpin finite automata
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
| The chop of languages | 2016-07-26 | Paper |
Minimal and hyper-minimal biautomata
International Journal of Foundations of Computer Science | 2016-06-23 | Paper |
On a hierarchy of languages generated by cooperating distributed grammar systems
Information Processing Letters | 2016-06-16 | Paper |
Minimization and characterizations for biautomata
Fundamenta Informaticae | 2016-05-11 | Paper |
From finite automata to regular expressions and back -- a summary on descriptional complexity
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
The finite index restriction meets hybrid modes in cooperating distributed grammar systems
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
Reversible shrinking two-pushdown automata
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Boundary sets of regular and context-free languages
Theoretical Computer Science | 2015-12-10 | Paper |
Minimal reversible deterministic finite automata
Developments in Language Theory | 2015-11-10 | Paper |
More on deterministic and nondeterministic finite cover automata (extended abstract)
Implementation and Application of Automata | 2015-09-23 | Paper |
Tight bounds for cut-operations on deterministic finite automata
Lecture Notes in Computer Science | 2015-09-15 | Paper |
On the computational complexity of problems related to distinguishability sets
Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
| scientific article; zbMATH DE number 6415494 (Why is no real title available?) | 2015-03-16 | Paper |
| Descriptional complexity of chop operations on unary and finite languages | 2015-03-16 | Paper |
Nondeterministic biautomata and their descriptional complexity
International Journal of Foundations of Computer Science | 2015-02-09 | Paper |
Minimal and hyper-minimal biautomata (extended abstract)
Developments in Language Theory | 2014-10-14 | Paper |
Boundary sets of regular and context-free languages
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
Provably shorter regular expressions from finite automata
International Journal of Foundations of Computer Science | 2014-07-04 | Paper |
-rational languages: high complexity classes vs. Borel hierarchy
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Nondeterministic biautomata and their descriptional complexity
Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
Brzozowski's minimization algorithm -- more robust than expected (extended abstract)
Implementation and Application of Automata | 2013-08-07 | Paper |
From equivalence to almost-equivalence, and beyond-minimizing automata with errors (extended abstract)
Developments in Language Theory | 2012-11-02 | Paper |
Generalized derivations with synchronized context-free grammars
Developments in Language Theory | 2012-11-02 | Paper |
State complexity of chop operations on unary and finite languages
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
On inverse operations and their descriptional complexity
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
A note on combined derivation modes for cooperating distributed grammar systems
Lecture Notes in Computer Science | 2012-11-01 | Paper |
Input-driven stack automata
Lecture Notes in Computer Science | 2012-09-21 | Paper |
The magic number problem for subregular language families
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
The complexity of regular(-like) expressions
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
Nondeterministic state complexity of star-free languages
Theoretical Computer Science | 2012-08-09 | Paper |
| On iterated dominance, matrix elimination, and matched paths | 2012-01-23 | Paper |
| Descriptional complexity -- an introductory survey | 2011-12-01 | Paper |
Computational complexity of NURIKABE
Fundamenta Informaticae | 2011-11-22 | Paper |
Nondeterministic state complexity of star-free languages
Implementation and Application of Automata | 2011-07-29 | Paper |
Gaining Power by Input Operations: Finite Automata and Beyond
Implementation and Application of Automata | 2011-07-29 | Paper |
Chop operations and expressions: descriptional complexity considerations
Developments in Language Theory | 2011-07-29 | Paper |
Nodes connected by path languages
Developments in Language Theory | 2011-07-29 | Paper |
Descriptional and computational complexity of finite automata -- a survey
Information and Computation | 2011-07-27 | Paper |
Decidability of operation problems for T0L languages and subclasses
Information and Computation | 2011-07-27 | Paper |
Cooperating distributed grammar systems: components with nonincreasing competence
Computation, Cooperation, and Life | 2011-06-24 | Paper |
Equilibria of graphical games with symmetries
Theoretical Computer Science | 2011-02-21 | Paper |
On the size of inverse semigroups given by generators
Theoretical Computer Science | 2011-02-21 | Paper |
Cellular automata and the quest for nontrivial artificial self-reproduction
Membrane Computing | 2011-01-21 | Paper |
Complexity of multi-head finite automata: origins and directions
Theoretical Computer Science | 2011-01-10 | Paper |
An n n algorithm for hyper-minimizing a (minimized) deterministic automaton
Theoretical Computer Science | 2010-10-07 | Paper |
The complexity of regular(-like) expressions
Developments in Language Theory | 2010-08-31 | Paper |
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
Lecture Notes in Computer Science | 2010-08-31 | Paper |
Automata that take advice
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Extending regular expressions with homomorphic replacement
RAIRO - Theoretical Informatics and Applications | 2010-06-07 | Paper |
Extending regular expressions with homomorphic replacement
RAIRO - Theoretical Informatics and Applications | 2010-06-07 | Paper |
A note on cooperating distributed grammar systems working in combined modes
Information Processing Letters | 2010-04-19 | Paper |
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
Information Processing Letters | 2010-01-29 | Paper |
On competence in CD grammar systems with parallel rewriting
International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
On input-revolving deterministic and nondeterministic finite automata
Information and Computation | 2009-11-27 | Paper |
| scientific article; zbMATH DE number 5604119 (Why is no real title available?) | 2009-09-15 | Paper |
On the uniqueness of shuffle on words and finite languages
Theoretical Computer Science | 2009-09-10 | Paper |
NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
International Journal of Foundations of Computer Science | 2009-08-21 | Paper |
Determination of finite automata accepting subregular languages
Theoretical Computer Science | 2009-08-07 | Paper |
Language operations with regular expressions of polynomial size
Theoretical Computer Science | 2009-08-07 | Paper |
Short Regular Expressions from Finite Automata: Empirical Results
Implementation and Application of Automata | 2009-07-09 | Paper |
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
Implementation and Application of Automata | 2009-07-09 | Paper |
Tight Bounds on the Descriptional Complexity of Regular Expressions
Developments in Language Theory | 2009-07-07 | Paper |
More on the Size of Higman-Haines Sets: Effective Constructions
Fundamenta Informaticae | 2009-06-23 | Paper |
Descriptional and Computational Complexity of Finite Automata
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Undecidability of Operation Problems for T0L Languages and Subclasses
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
Developments in Language Theory | 2009-03-26 | Paper |
More on the Size of Higman-Haines Sets: Effective Constructions
Lecture Notes in Computer Science | 2009-03-05 | Paper |
Symmetries and the complexity of pure Nash equilibrium
Journal of Computer and System Sciences | 2009-03-02 | Paper |
Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
Implementation and Applications of Automata | 2009-02-12 | Paper |
Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Deterministic Input-Reversal and Input-Revolving Finite Automata
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Provably Shorter Regular Expressions from Deterministic Finite Automata
Developments in Language Theory | 2008-10-30 | Paper |
Finite Automata, Digraph Connectivity, and Regular Expression Size
Automata, Languages and Programming | 2008-08-19 | Paper |
| Non-recursive trade-offs for deterministic restarting automata | 2008-08-12 | Paper |
HYBRID EXTENDED FINITE AUTOMATA
International Journal of Foundations of Computer Science | 2008-05-20 | Paper |
The complexity of tensor circuit evaluation
Computational Complexity | 2008-02-22 | Paper |
The size of Higman-Haines sets
Theoretical Computer Science | 2007-12-19 | Paper |
On the average state and transition complexity of finite languages
Theoretical Computer Science | 2007-12-19 | Paper |
Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
Developments in Language Theory | 2007-11-28 | Paper |
Hairpin Finite Automata
Developments in Language Theory | 2007-11-28 | Paper |
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
Lecture Notes in Computer Science | 2007-11-15 | Paper |
The Troubles of Interior Design–A Complexity Analysis of the Game Heyawake
Lecture Notes in Computer Science | 2007-11-15 | Paper |
| scientific article; zbMATH DE number 5201364 (Why is no real title available?) | 2007-10-17 | Paper |
Hybrid Extended Finite Automata
Implementation and Application of Automata | 2007-09-06 | Paper |
Symmetries and the Complexity of Pure Nash Equilibrium
STACS 2007 | 2007-09-03 | Paper |
| Cooperating distributed grammar systems as models of distributed problem solving, revisited | 2007-04-10 | Paper |
| scientific article; zbMATH DE number 5117088 (Why is no real title available?) | 2007-01-19 | Paper |
Iterated sequential transducers as language generating devices
Theoretical Computer Science | 2007-01-09 | Paper |
Programmed grammars and their relation to the LBA problem
Acta Informatica | 2006-11-27 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
| On emptiness and counting for alternating finite automata | 2006-09-06 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
CD grammar systems with competence based entry conditions in their cooperation protocols
International Journal of Computer Mathematics | 2006-05-22 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Machines, Computations, and Universality
Lecture Notes in Computer Science | 2005-12-08 | Paper |
A common algebraic description for probabilistic and quantum computations
Theoretical Computer Science | 2005-12-06 | Paper |
NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
| scientific article; zbMATH DE number 2201358 (Why is no real title available?) | 2005-09-01 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
| scientific article; zbMATH DE number 2182426 (Why is no real title available?) | 2005-06-23 | Paper |
| scientific article; zbMATH DE number 2150283 (Why is no real title available?) | 2005-03-30 | Paper |
TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable
Discrete Applied Mathematics | 2005-02-23 | Paper |
On the descriptional complexity of finite automata with modified acceptance conditions
Theoretical Computer Science | 2005-02-22 | Paper |
On deterministic finite automata and syntactic monoid size
Theoretical Computer Science | 2005-01-11 | Paper |
Assembling molecules in ATOMIX is hard
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2087237 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2068874 (Why is no real title available?) | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 2060757 (Why is no real title available?) | 2004-03-18 | Paper |
| scientific article; zbMATH DE number 2050927 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2040919 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 2040920 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 2038733 (Why is no real title available?) | 2004-02-08 | Paper |
The complexity of tensor calculus
Computational Complexity | 2003-11-17 | Paper |
McNaughton families of languages.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1962776 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1949654 (Why is no real title available?) | 2003-07-15 | Paper |
| scientific article; zbMATH DE number 1948495 (Why is no real title available?) | 2003-07-13 | Paper |
| scientific article; zbMATH DE number 1948503 (Why is no real title available?) | 2003-07-13 | Paper |
Alternating and empty alternating auxiliary stack automata.
Theoretical Computer Science | 2003-05-25 | Paper |
Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\)
Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1870544 (Why is no real title available?) | 2003-02-18 | Paper |
| scientific article; zbMATH DE number 1834647 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1759428 (Why is no real title available?) | 2002-11-04 | Paper |
Multi-head finite automata: Data-independent versus data-dependent computations
Theoretical Computer Science | 2002-08-13 | Paper |
| scientific article; zbMATH DE number 1747441 (Why is no real title available?) | 2002-05-29 | Paper |
Bidirectional cooperating distributed grammar systems
Publicationes Mathematicae Debrecen | 2002-02-13 | Paper |
A generalization of the flip-flop lemma
Publicationes Mathematicae Debrecen | 2002-02-13 | Paper |
| Cooperating distributed grammar systems with non-terminating components | 2001-11-07 | Paper |
Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization
Theoretical Computer Science | 2001-08-20 | Paper |
Grammar systems with negated conditions in their cooperation protocols
Journal of Universal Computer Science | 2001-05-10 | Paper |
| On fixed and general membership for external and internal contextual languages | 2001-04-04 | Paper |
| scientific article; zbMATH DE number 1569111 (Why is no real title available?) | 2001-02-22 | Paper |
| scientific article; zbMATH DE number 1747444 (Why is no real title available?) | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1361488 (Why is no real title available?) | 2000-08-14 | Paper |
| scientific article; zbMATH DE number 1406163 (Why is no real title available?) | 2000-06-04 | Paper |
| scientific article; zbMATH DE number 1406170 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1244202 (Why is no real title available?) | 1999-01-24 | Paper |
Expressing uniformity via oracles
Theory of Computing Systems | 1997-07-28 | Paper |
| scientific article; zbMATH DE number 977923 (Why is no real title available?) | 1997-05-25 | Paper |
Inductive counting for width-restricted branching programs
Information and Computation | 1997-03-06 | Paper |
| scientific article; zbMATH DE number 907949 (Why is no real title available?) | 1996-10-15 | Paper |
| scientific article; zbMATH DE number 522856 (Why is no real title available?) | 1994-08-31 | Paper |
