Asymptotically tight bounds on time-space trade-offs in a pebble game
Journal of the ACM (JACM)
Bandwidth constrained NP-Complete problems
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The pebbling problem is complete in polynomial space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Upper and lower bounds on time-space tradeoffs
STOC '79 Proceedings of the eleventh 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 dynamic programming algorithms for which interpreted pebbling helps
Information and Computation
The PSPACE-Completeness of Black-White Pebbling
SIAM Journal on Computing
Game characterizations and the PSPACE-completeness of tree resolution space
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.01 |