| Publication | Date of Publication | Type |
|---|
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
Equireplicate balanced binary codes for oligo arrays
SIAM Journal on Discrete Mathematics | 2001-11-11 | Paper |
A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata
SIAM Journal on Computing | 1999-02-22 | Paper |
Time-space tradeoffs for undirected graph traversal by graph automata
Information and Computation | 1997-10-13 | Paper |
Lower bounds on universal traversal sequences based on chains of length five
Information and Computation | 1995-09-17 | Paper |
Communication-Space Tradeoffs for Unrestricted Protocols
SIAM Journal on Computing | 1994-08-14 | Paper |
A direct version of Shamir and Snir's lower bounds on monotone circuit depth
Information Processing Letters | 1994-04-05 | Paper |
Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs
SIAM Journal on Computing | 1993-03-09 | Paper |
Lower bounds on the length of universal traversal sequences
Journal of Computer and System Sciences | 1993-01-17 | Paper |
Trade-offs between communication and space
Journal of Computer and System Sciences | 1993-01-17 | Paper |
The complexity of short two-person games
Discrete Applied Mathematics | 1992-06-25 | Paper |
Two Applications of Inductive Counting for Complementation Problems
SIAM Journal on Computing | 1989-01-01 | Paper |
A New Pebble Game that Characterizes Parallel Complexity Classes
SIAM Journal on Computing | 1989-01-01 | Paper |
Parallel graph algorithms that are efficients on average
Information and Computation | 1989-01-01 | Paper |
How to share a secret with cheaters
Journal of Cryptology | 1988-01-01 | Paper |
The parallel complexity of exponentiating polynomials over finite fields
Journal of the ACM | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4197461 (Why is no real title available?) | 1988-01-01 | Paper |
Speedups of deterministic machines by synchronous parallel machines
Journal of Computer and System Sciences | 1985-01-01 | Paper |
The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
Journal of the ACM | 1985-01-01 | Paper |
Decreasing the nesting depth of expressions involving square roots
Journal of Symbolic Computation | 1985-01-01 | Paper |
Space-bounded hierarchies and probabilistic computations
Journal of Computer and System Sciences | 1984-01-01 | Paper |
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
SIAM Journal on Computing | 1984-01-01 | Paper |
Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations
SIAM Journal on Computing | 1982-01-01 | Paper |
An extension of Savitch's theorem to small space bounds
Information Processing Letters | 1981-01-01 | Paper |
An optimal solution to a wire-routing problem
Journal of Computer and System Sciences | 1981-01-01 | Paper |
A time-space tradeoff for sorting on non-oblivious machines
Journal of Computer and System Sciences | 1981-01-01 | Paper |
Corrigendum to ``Time-space tradeoffs for computing functions, using connectivity properties of their circuits
Journal of Computer and System Sciences | 1981-01-01 | Paper |
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
Journal of Computer and System Sciences | 1980-01-01 | Paper |
