| Publication | Date of Publication | Type |
|---|
A tight lower bound for on-line monotonic list labeling
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
IEEE Transactions on Computers | 2017-11-10 | Paper |
Two heads are better than two tapes
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Optimizing data popularity conscious Bloom filters
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Object replication degree customization for high availability
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Sorting networks of logarithmic depth, further simplified
Algorithmica | 2009-06-17 | Paper |
Networks for sorting multitonic sequences
Journal of Parallel and Distributed Computing | 2006-11-15 | Paper |
A Tight Lower Bound for Online Monotonic List Labeling
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Amplification of slight probabilistic advantage at absolutely no cost in space
Information Processing Letters | 2002-07-25 | Paper |
scientific article; zbMATH DE number 1142310 (Why is no real title available?)
| 1998-05-04 | Paper |
Two heads are better than two tapes
Journal of the ACM | 1998-02-17 | Paper |
Characterization of realizable space complexities
Annals of Pure and Applied Logic | 1995-07-03 | Paper |
Bits and relative order from residues, space efficiently
Information Processing Letters | 1994-07-18 | Paper |
A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
Information and Computation | 1991-01-01 | Paper |
Milking the Aanderaa argument
Information and Computation | 1990-01-01 | Paper |
A variant of Ben-Or's lower bound for algebraic decision trees
Information Processing Letters | 1988-01-01 | Paper |
Counting is easy
Journal of the ACM | 1988-01-01 | Paper |
A simplified lower bound for context-free-language recognition
Information and Control | 1986-01-01 | Paper |
Time-space-optimal string matching
Journal of Computer and System Sciences | 1983-01-01 | Paper |
Linear-time string-matching using only a fixed number of local storage locations
Theoretical Computer Science | 1981-01-01 | Paper |
An information-theoretic approach to time bounds for on-line computation
Journal of Computer and System Sciences | 1981-01-01 | Paper |
New Real-Time Simulations of Multihead Tape Units
Journal of the ACM | 1981-01-01 | Paper |
Limitations on Separating Nondeterministic Complexity Classes
SIAM Journal on Computing | 1981-01-01 | Paper |
Saving Space in Fast String-Matching
SIAM Journal on Computing | 1980-01-01 | Paper |
Separating Nondeterministic Time Complexity Classes
Journal of the ACM | 1978-01-01 | Paper |
A Linear-Time On-Line Recognition Algorithm for ``Palstar
Journal of the ACM | 1978-01-01 | Paper |
Correcting Counter-Automaton-Recognizable Languages
SIAM Journal on Computing | 1978-01-01 | Paper |
Real-time recognition of substring repetition and reversal
Mathematical Systems Theory | 1977-01-01 | Paper |
Techniques for separating space complexity classes
Journal of Computer and System Sciences | 1977-01-01 | Paper |
Relating refined space complexity classes
Journal of Computer and System Sciences | 1977-01-01 | Paper |
Iterative arrays with direct central control
Acta Informatica | 1977-01-01 | Paper |
Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays
SIAM Journal on Computing | 1977-01-01 | Paper |
Regularity-preserving relations
Theoretical Computer Science | 1976-01-01 | Paper |
scientific article; zbMATH DE number 3558991 (Why is no real title available?)
| 1974-01-01 | Paper |
Infinite exponent partition relations and well-ordered choice
Journal of Symbolic Logic | 1973-01-01 | Paper |
