Pebbling dynamic graphs in minimal space
Ružička, Peter ; Waczulík, Juraj
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994), p. 557-565 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1994__28_6_557_0,
     author = {Ru\v zi\v cka, Peter and Waczul\'\i k, Juraj},
     title = {Pebbling dynamic graphs in minimal space},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {28},
     year = {1994},
     pages = {557-565},
     mrnumber = {1305116},
     zbl = {0884.68096},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1994__28_6_557_0}
}

Ružička, Peter; Waczulík, Juraj. Pebbling dynamic graphs in minimal space. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) pp. 557-565. http://gdmltest.u-ga.fr/item/ITA_1994__28_6_557_0/

1. S. A. Cook, An Observation on Time-Storage Trade Off, Journal of Computers and System Sciences, 1974, 9, 308-316. | MR 398160 | Zbl 0306.68026

2. N. Pippenger, Pebbling, 5th IBM Symposium on Mathematical Foundations of Computer Science, Tokyo, 1980.

3. H. Venkateswaran and M. Tompa, A New Pebble Game that Characterizes Parallel Complexity Classes, S.I.A.M. J. Computing, 1989, 18, 533-549. | MR 996834 | Zbl 0678.68047

4. R. Wilber, White Pebbles Help, Journal of Computers and System Sciences, 1988, 36, 108-124. | MR 950428 | Zbl 0657.68049