The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
On non-linear lower bounds in computational complexity
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
An observation on time-storage trade off
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Complete register allocation problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On sparse graphs with dense long paths.
On sparse graphs with dense long paths.
Journal of the ACM (JACM)
Space-time tradeoffs for linear recursion
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
STOC '77 Proceedings of the ninth 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
Pebblings, edgings, and equational logic
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Tradeoffs in depth-two superconcentrators
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |
We study a one-person game played by placing pebbles, according to certain rules, on the vertices of a directed graph. In [3] it was shown that for each graph with n vertices and maximum in-degree d , there is a pebbling strategy which requires at most c(d) n/log n pebbles. Here we show that this bound is tight to within a constant factor. We also analyze a variety of pebbling algorithms, including one which achieves the 0(n/log n) bound.