A time-space tradeoff for undirected graph traversal by walking automata
- Paul Beame
- Allan Borodin
- et al.
- 1999
- SIAM Journal on Computing
Paper
Publications
8 results for Martin Tompa
Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata
- Paul Beame
- Allan Borodin
- et al.
- 1996
- Information and Computation
PaperTrade-offs between communication and space
- Tak Lam
- Prasoon Tiwari
- et al.
- 1992
- Journal of Computer and System Sciences
PaperThe complexity of short two-person games
- Ashok K. Chandra
- Martin Tompa
- 1990
- Discrete Applied Mathematics
PaperHow to share a secret with cheaters
- Martin Tompa
- Heather Woll
- 1989
- Journal of Cryptology
PaperParallei graph algorithms that are efficient on average
- Don Coppersmith
- Prabhakar Raghavan
- et al.
- 1989
- Information and Computation
PaperThe parallel complexity of exponentiating polynomials over finite fields
- Faith E. Fich
- Martin Tompa
- 1988
- Journal of the ACM
PaperDecreasing the nesting depth of expressions involving square roots
- Allan Borodin
- Ronald Fagin
- et al.
- 1985
- Journal of Symbolic Computation
Paper