Efficient pebbling for list traversal synopses

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 918-928

  Matias, Yossi ^a   Porat, Ely ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; DIRECTED GRAPHS; ECONOMIC AND SOCIAL EFFECTS; SEQUENTIAL SWITCHING; TREES (MATHEMATICS);

AMORTIZED TIME; BACK STEP; HASH CHAINS; MEMORY EFFICIENT; MEMORY USAGE; PRE ORDERINGS; TRADE OFF;

APPLICATION PROGRAMS;

EID: 35248885103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_71     Document Type: Article

References (11)

1. A. M. Ben-Amram and H. Petersen. Backing up in singly linked lists. In Proceedings of the ACM STOC, pages 780-786, 1999.
2. M. A. Bender, A. Fernandez, D. Ron, A. Sahai, and S. P. Vadhan. The power of a pebble: Exploring and mapping directed graphs. In ACM Symposium on Theory of Computing, pages 269-278, 1998.
3. Y. C. Chung, S.-M. Moon, K. Ebcioglu, and D. Sahlin. Reducing sweep time for a nearly empty heap. In 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '00), Boston, MA, 2000. ACM Press.
4. D. Coppersmith and M. Jakobsson. Almost optimal hash sequence traversal. In Proceedings of the Fifth Conference on Financial Cryptography (FC '02), 2002.
5. D. S. Hirschberg and S. S. Seiden. A bounded-space tree traversal algorithm. Information Processing Letters, 47(4):215-219, 1993.
6. M. Jakobsson. Fractal hash sequence representation and traversal. In ISIT, 2002.
7. Y. Matias and E. Porat. Efficient pebbling for list traversal synopses. Technical report, Tel Aviv University, 2002.
8. N. Pippenger. Advances in pebbling. In In Proceedings of the International Colloquium on Automata, Languages and Programming, pages 407-417, 1982.
9. H. Schorr and W. M. Waite. An efficient machineindependent procedure for garbage collection in various list structures. Communications of the ACM, 10(8):501-506, Aug. 1967.
10. J. Sobel and D. P. Friedman. Recycling continuations. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '98), volume 34(1), pages 251-260, 1999.
11. D. Walker and J. G. Morrisett. Alias types for recursive data structures. In Types in Compilation, pages 177-206, 2000.