Upper and lower bounds on time-space tradeoffs

Authors:
Thomas Lengauer;Robert Endre Tarjan
Affiliations:
-;-
Venue:
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Year:
1979

Citing 11
Cited 7

Shifting Graphs and Their Applications

Journal of the ACM (JACM)
On Time Versus Space

Journal of the ACM (JACM)
A Time-Space Trade-Off

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A PSPACE Complete Problem Related to a Pebble Game

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
An observation on time-storage trade off

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Time-space tradeoffs for computing functions, using connectivity properties of their circuits

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On sparse graphs with dense long paths.

On sparse graphs with dense long paths.
Time-space trade-offs in a pebble game

Time-space trade-offs in a pebble game
Variations of a pebble game on graphs

Variations of a pebble game on graphs
Upper and lower bounds on time-space tradeoffs in a pebble game

Upper and lower bounds on time-space tradeoffs in a pebble game

Asymptotically tight bounds on time-space trade-offs in a pebble game

Journal of the ACM (JACM)
Size space tradeoffs for resolution

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Graph pebbling with many free pebbles can be difficult

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Time-space tradeoffs for some algebraic problems

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Comparative schematology and pebbling with auxiliary pushdowns (Preliminary Version)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Narrow proofs may be spacious: separating space and width in resolution

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper derives asymptotically tight bounds on the time-space tradeoffs for pebbling three different classes of directed acyclic graphs. Let N be the size of the graph, S the number of available pebbles, and T the time necessary for pebbling the graph. (a) A time space tradeoff of the form ST &equil; &thgr;(N2) is proved for a special class of permutation graphs which implement the bit reversal permutation. (b) A time-space tradeoff of the form T &equil; S &thgr;(N/S)&thgr;(N/S) is proved for a class of graphs constructed by stacking superconcentrators in series. (c) A time-space tradeoff of the form T &equil; S.22&thgr;(N/S)is proved for pebbling general directed acyclic graphs.