Abstract
The Pebble game is a model for successive execution of a computation with the use of an auxiliary storage devise. The game can be used to study trade-off effects between the memory use and running time for a particular computation. We will show a lower bound originally proved by Paul, Tarjan, and Celoni (1977) which says that certain graphs, based on superconcentrators, require many pebbles.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Hopcroft, W.J. Paul, L. Valiant: On time versus space, Journal of the ACM 24 (1977), 332–337.
K. Wagner, G. Wechsung: Computational Complexity, VEB Deutscher Verlag der Wissenschaften, 1986.
W.J. Paul, R.E. Tarjan, J.R. Celoni: Space bounds for a game on graphs, Mathematical Systems Theory 10 (1977), 239–251
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schöning, U., Pruim, R. (1998). The Pebble Game. In: Gems of Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60322-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-60322-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64352-1
Online ISBN: 978-3-642-60322-8
eBook Packages: Springer Book Archive