| Publication | Date of Publication | Type |
|---|
| Advocating ownership | 2024-07-05 | Paper |
| StUSPACE(log n) ⊂-DSPACE(log2 n/log log n) | 2023-01-25 | Paper |
An unambiguous class possessing a complete set
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Parallel recognition and ranking of context-free languages
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
The emptiness problem for intersections of regular languages
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Parallel complexity of iterated morphisms and the arithmetic of small numbers
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Empty alternation
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
| Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy | 2018-06-26 | Paper |
| Visibly counter languages and constant depth circuits | 2017-01-24 | Paper |
A language-theoretical approach to descriptive complexity
Developments in Language Theory | 2016-08-30 | Paper |
On distinguishing \(\mathbf {NC^1}\) and \(\mathbf {NL}\)
Developments in Language Theory | 2015-11-10 | Paper |
Visibly counter languages and the structure of \(\mathrm {NC}^{1}\)
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
scientific article; zbMATH DE number 6351511 (Why is no real title available?)
Theory of Computing | 2014-10-06 | Paper |
Dense completeness
Developments in Language Theory | 2012-11-02 | Paper |
The Boolean formula value problem as formal language
Lecture Notes in Computer Science | 2012-11-01 | Paper |
The lower reaches of circuit uniformity
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
| scientific article; zbMATH DE number 5790353 (Why is no real title available?) | 2010-09-22 | Paper |
Characterizing \(\text{TC}^{0}\) in terms of infinite groups
Theory of Computing Systems | 2007-08-23 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
On the complexity of some problems on groups input as multiplication tables
Journal of Computer and System Sciences | 2002-07-22 | Paper |
Reversible space equals deterministic space
Journal of Computer and System Sciences | 2000-06-05 | Paper |
Data independence of read, write, and control structures in PRAM computations
Journal of Computer and System Sciences | 2000-05-08 | Paper |
| scientific article; zbMATH DE number 1303030 (Why is no real title available?) | 2000-02-09 | Paper |
| scientific article; zbMATH DE number 1346519 (Why is no real title available?) | 1999-10-03 | Paper |
| scientific article; zbMATH DE number 1346517 (Why is no real title available?) | 1999-10-03 | Paper |
| scientific article; zbMATH DE number 1222108 (Why is no real title available?) | 1999-06-21 | Paper |
RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\)
Theory of Computing Systems | 1999-02-18 | Paper |
| scientific article; zbMATH DE number 1101593 (Why is no real title available?) | 1998-01-07 | Paper |
| scientific article; zbMATH DE number 871245 (Why is no real title available?) | 1996-04-28 | Paper |
The complexity of reconfiguring network models
Information and Computation | 1996-02-20 | Paper |
| scientific article; zbMATH DE number 522856 (Why is no real title available?) | 1994-08-31 | Paper |
| scientific article; zbMATH DE number 176931 (Why is no real title available?) | 1993-05-18 | Paper |
Unambiguity of circuits
Theoretical Computer Science | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 4209587 (Why is no real title available?) | 1990-01-01 | Paper |
The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^Template:\mathcal L=A\Pi_ 2^Template:\mathcal L\)
Information and Computation | 1989-01-01 | Paper |
Decompositions of nondeterministic reductions
Theoretical Computer Science | 1988-01-01 | Paper |
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
Discrete Applied Mathematics | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4085027 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4047162 (Why is no real title available?) | 1987-01-01 | Paper |
Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\)
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4024792 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3999297 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4014037 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3960995 (Why is no real title available?) | 1986-01-01 | Paper |
Erratum to: ``A three-restricted normal form theorem for ETOL languages
Information Processing Letters | 1985-01-01 | Paper |
Recurrent words and simultaneous growth in T0L systems
Theoretical Computer Science | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3917735 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3976379 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3904572 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3880123 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3825213 (Why is no real title available?) | 1983-01-01 | Paper |
A three-restricted normal form theorem for ETOL languages
Information Processing Letters | 1982-01-01 | Paper |
L homomorphisms and reductions of OL systems
International Journal of Computer Mathematics | 1982-01-01 | Paper |
Equivalence of adult languages and extensions for DTOL systems
Information and Control | 1980-01-01 | Paper |
