| Publication | Date of Publication | Type |
|---|
Nondeterminism and the size of two way finite automata
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
| scientific article; zbMATH DE number 5783630 (Why is no real title available?) | 2010-09-10 | Paper |
| scientific article; zbMATH DE number 5595162 (Why is no real title available?) | 2009-08-13 | Paper |
| scientific article; zbMATH DE number 5595151 (Why is no real title available?) | 2009-08-13 | Paper |
| scientific article; zbMATH DE number 1559596 (Why is no real title available?) | 2001-01-31 | Paper |
Expander codes
IEEE Transactions on Information Theory | 2000-08-28 | Paper |
On the power of multi-prover interactive protocols
Theoretical Computer Science | 2000-06-15 | Paper |
Optimal Constructions of Hybrid Algorithms
Journal of Algorithms | 1999-08-23 | Paper |
| scientific article; zbMATH DE number 1142303 (Why is no real title available?) | 1998-05-04 | Paper |
| scientific article; zbMATH DE number 1003269 (Why is no real title available?) | 1997-11-18 | Paper |
Monotone separation of logarithmic space from logarithmic depth
Journal of Computer and System Sciences | 1995-07-24 | Paper |
| scientific article; zbMATH DE number 176869 (Why is no real title available?) | 1993-05-18 | Paper |
Compression and Ranking
SIAM Journal on Computing | 1992-06-25 | Paper |
Are there interactive protocols for co-NP languages?
Information Processing Letters | 1988-01-01 | Paper |
Expanders, randomness, or time versus space
Journal of Computer and System Sciences | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4002078 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3980487 (Why is no real title available?) | 1986-01-01 | Paper |
Parity, circuits, and the polynomial-time hierarchy
Mathematical Systems Theory | 1984-01-01 | Paper |
Communication complexity
Journal of Computer and System Sciences | 1984-01-01 | Paper |
On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
Operations Research | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3938569 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3814972 (Why is no real title available?) | 1982-01-01 | Paper |
Several results in program size complexity
Theoretical Computer Science | 1981-01-01 | Paper |
Halting space-bounded computations
Theoretical Computer Science | 1980-01-01 | Paper |
GO Is Polynomial-Space Hard
Journal of the ACM | 1980-01-01 | Paper |
Lower bounds on the size of sweeping automata
Journal of Computer and System Sciences | 1980-01-01 | Paper |
