| Publication | Date of Publication | Type |
|---|
| A note on confluent Thue systems | 2023-08-14 | Paper |
| On complexity classes and algorithmically random languages | 2022-08-18 | Paper |
| Quasi-realtime languages (Extended Abstract) | 2014-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818850 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525683 | 2001-01-24 | Paper |
| On collapsing the polynomial-time hierarchy | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942646 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268447 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246746 | 1999-06-15 | Paper |
| Probabilistic type-2 operators and ``almost-classes | 1999-02-02 | Paper |
| On random hard sets for NP | 1997-01-02 | Paper |
| On the robustness of ALMOST-$\mathcal {R}$ | 1996-12-01 | Paper |
| The global power of additional queries to random oracles | 1995-09-17 | Paper |
| Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory | 1995-09-05 | Paper |
| An observation on probability versus randomness with applications to complexity classes | 1995-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4846257 | 1995-08-23 | Paper |
| On Languages Reducible to Algorithmically Random Languages | 1995-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281493 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038699 | 1993-05-18 | Paper |
| On Languages with Very High Space-Bounded Kolmogorov Complexity | 1993-05-17 | Paper |
| On ``inherently context-sensitive languages -- an application of complexity cores | 1992-06-28 | Paper |
| On random oracle separations | 1992-06-27 | Paper |
| Polynomial-time reducibilities and ``almost all oracle sets | 1991-01-01 | Paper |
| Some Observations on Separating Complexity Classes | 1991-01-01 | Paper |
| Reducibilities on tally and sparse sets | 1991-01-01 | Paper |
| Characterizing polynomial complexity classes by reducibilities | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4205075 | 1989-01-01 | Paper |
| A note on sparse sets and the polynomial-time hierarchy | 1989-01-01 | Paper |
| On inefficient special cases of NP-complete problems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3493228 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3830526 | 1989-01-01 | Paper |
| The structure of generalized complexity cores | 1988-01-01 | Paper |
| Lowness Properties of Sets in the Exponential-Time Hierarchy | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3807187 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809788 | 1988-01-01 | Paper |
| On Sets Truth-Table Reducible to Sparse Sets | 1988-01-01 | Paper |
| Dehn's Algorithm and the Complexity of Word Problems | 1988-01-01 | Paper |
| Thue systems as rewriting systems | 1987-01-01 | Paper |
| Rewriting systems and word problems in a free partially commutative monoid | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3030806 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3808082 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4723704 | 1986-01-01 | Paper |
| The Verifiability of Two-Party Protocols | 1986-01-01 | Paper |
| On unification: Equational theories are not bounded | 1986-01-01 | Paper |
| Sets with small generalized Kolmogorov complexity | 1986-01-01 | Paper |
| The polynomial-time hierarchy and sparse oracles | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3740234 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3747724 | 1986-01-01 | Paper |
| Sparse Sets, Lowness and Highness | 1986-01-01 | Paper |
| Qualitative relativizations of complexity classes | 1985-01-01 | Paper |
| The base of the intersection of two free submonoids | 1985-01-01 | Paper |
| On the security of name-stamp protocols | 1985-01-01 | Paper |
| Reductions in tree replacement systems | 1985-01-01 | Paper |
| On the verifiability of two-party algebraic protocols | 1985-01-01 | Paper |
| On bounded query machines | 1985-01-01 | Paper |
| Cancellation rules and extended word problems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3714064 | 1985-01-01 | Paper |
| Homogeneous Thue systems and the Church-Rosser property | 1984-01-01 | Paper |
| Almost all one-rule Thue systems have decidable word problems | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217605 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220570 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3329652 | 1984-01-01 | Paper |
| Immunity, Relativizations, and Nondeterminism | 1984-01-01 | Paper |
| Quantitative Relativizations of Complexity Classes | 1984-01-01 | Paper |
| Characterizations of reduction classes modulo oracle conditions | 1984-01-01 | Paper |
| A note on special thue systems with a single defining relation | 1983-01-01 | Paper |
| Decidable sentences of Church-Rosser congruences | 1983-01-01 | Paper |
| Refining Nondeterminism in Relativizations of Complexity Classes | 1983-01-01 | Paper |
| Positive Relativizations of Complexity Classes | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3670563 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3677188 | 1983-01-01 | Paper |
| Monadic Thue systems | 1982-01-01 | Paper |
| When is a monoid a group? The Church-Rosser case is tractable | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3036702 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3319766 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3339307 | 1982-01-01 | Paper |
| Confluent and Other Types of Thue Systems | 1982-01-01 | Paper |
| Relativizing Time, Space, and Time-Space | 1982-01-01 | Paper |
| A note on complete sets and transitive closure | 1982-01-01 | Paper |
| The undecidability of a word problem: On a conjecture of Strong, Maggiolo-Schettini and Rosen | 1981-01-01 | Paper |
| Bounded query machines: on NP and PSPACE | 1981-01-01 | Paper |
| Bounded query machines: on NP( ) and NPQUERY( ) | 1981-01-01 | Paper |
| NTS grammars and Church-Rosser systems | 1981-01-01 | Paper |
| Testing for the Church-Rosser property | 1981-01-01 | Paper |
| Thue congruences and the Church-Rosser property | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3939790 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3968469 | 1981-01-01 | Paper |
| On Uniquely Decipherable Codes with Two Codewords | 1980-01-01 | Paper |
| Equality Sets and Complexity Classes | 1980-01-01 | Paper |
| Reset machines | 1979-01-01 | Paper |
| On languages accepted by space-bounded oracle machines | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048249 | 1979-01-01 | Paper |
| Polynomial Space and Transitive Closure | 1979-01-01 | Paper |
| A remark on tally languages and complexity classes | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195938 | 1979-01-01 | Paper |
| On the complexity of formal grammars | 1978-01-01 | Paper |
| On languages specified by relative acceptance | 1978-01-01 | Paper |
| Simple Representations of Certain Classes of Languages | 1978-01-01 | Paper |
| Linear Languages and the Intersection Closures of Classes of Languages | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4168602 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4170259 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125814 | 1977-01-01 | Paper |
| On languages with a certain prefix property | 1977-01-01 | Paper |
| Inclusion complete tally languages and the Hartmanis-Berman conjecture | 1977-01-01 | Paper |
| Inherently nonplanar automata | 1976-01-01 | Paper |
| Translational lemmas, polynomial time, and \((\log n)^j\)-space | 1976-01-01 | Paper |
| Reversal-Bounded Acceptors and Intersections of Linear Languages | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4102757 | 1975-01-01 | Paper |
| Tally languages and complexity classes | 1974-01-01 | Paper |
| Reversal-bounded multipushdown machines | 1974-01-01 | Paper |
| Comparing complexity classes | 1974-01-01 | Paper |
| Mutually divisible semigroups | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4122799 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4135013 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5679724 | 1973-01-01 | Paper |
| On the structure of context-sensitive grammars | 1973-01-01 | Paper |
| Free and almost-free subsemigroups of a free semigroup | 1973-01-01 | Paper |
| Multi-stack-counter languages | 1972-01-01 | Paper |
| On Languages Accepted in Polynomial Time | 1972-01-01 | Paper |
| On Languages Accepted in Polynomial Time | 1972-01-01 | Paper |
| Terminal Context in Context-Sensitive Grammars | 1972-01-01 | Paper |
| Ambiguity in Graphs and Expressions | 1971-01-01 | Paper |
| A note on AFLs and bounded erasing | 1971-01-01 | Paper |
| Time-bounded grammars and their languages | 1971-01-01 | Paper |
| Quasi-realtime languages | 1970-01-01 | Paper |
| Time- and tape-bounded Turing acceptors and AFLs | 1970-01-01 | Paper |
| Tape-bounded Turing acceptors and principal AFLs | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4047460 | 1969-01-01 | Paper |
