Efficient pebbling for list traversal synopses with application to program rollback

Theoretical Computer Science

Volumn 379, Issue 3, 2007, Pages 418-436

  Matias, Yossi ^a   Porat, Ely ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COMPUTATIONAL EFFICIENCY; COMPUTER PROGRAMMING; GRAPH THEORY;

FORWARD STEP; LIST TRAVERSAL SYNOPSES; PEBBLING TECHNIQUE; UNIDIRECTIONAL LISTS;

DATA MINING;

EID: 34248571259     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.048     Document Type: Article

References (25)

1. A.M. Ben-Amram, H. Petersen, Backing up in singly linked lists, in: ACM Symposium on Theory of Computing, 1999, pp. 780-786
2. M.A. Bender, A. Fernandez, D. Ron, A. Sahai, S.P. Vadhan, The power of a pebble: Exploring and mapping directed graphs, in: ACM Symposium on Theory of Computing, 1998, pp. 269-278
3. A.K. Chandra, Efficient compilation of linear recursive programs, in: 14th Annual IEEE Symposium on Foundations of Computer Science, 1973, pp. 16-25
4. Chung Y.C., Moon S.-M., Ebcioglu K., and Sahlin D. Reducing sweep time for a nearly empty heap. 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2000), ACM Press
5. D. Coppersmith, M. Jakobsson, Almost optimal hash sequence traversal, in: Fifth Conference on Financial Cryptography, 2002, pp. 102-119
6. M. Datar, A. Gionis, P. Indyk, R. Motwani, Maintaining stream statistics over sliding windows, in: Proc. of the 13th annual ACM-SIAM symposium on Discrete algorithms, 2002, pp. 635-644
7. M. Furman, Y. Matias, E. Porat, LTS: The List-Traversal Synopses System, in: NGITS, 2006, pp. 353-354
8. P. Gibbons, Y. Matias, Synopsis data structures for massive data sets, in: Proc. of the tenth annual ACM-SIAM symposium on Discrete algorithms, 1999, pp. 909-910
9. Hirschberg D.S., and Seiden S.S. A bounded-space tree traversal algorithm. Information Processing Letters 47 4 (1993) 215-219
10. Itkis G., and Reyzin L. Gene itkis and leonid reyzin and verifying. CRYPTO (2001) 332-354
11. M. Jakobsson, Fractal hash sequence representation and traversal, in: IEEE International Symposium on Information Theory, 2002, p. 437
12. Jakobsson M., Leighton T., Micali S., and Szydlo M. Fractal merkle tree representation and traversal. CT-RSA (2003) 314-326
13. A. Kozlov, L. Reyzin, Forward-secure signatures with fast key update, in: Third Conference on Security in Communication Networks, 2002, pp. 241-256
14. Lamport L. Password authentification with insecure communication. Communications of the ACM 24 11 (1981) 770-772
15. Y. Matias, E. Porat, Efficient pebbling for list traversal synopses, Technical Report, Tel Aviv University, 2001 (revised 2002)
16. Y. Matias, E. Porat, Efficient pebbling for list traversal synopses, in: International Colloquium on Automata, Languages and Programming, 2003, pp. 918-928
17. A. Perrig, The biba one-time signature and broadcast authentication protocol, in: ACM Conference on Computer and Communications Security, 2001, pp. 28-37
18. N. Pippenger, Advances in pebbling, in: International Colloquium on Automata, Languages and Programming, 1982, pp. 407-417
19. R.L. Rivest, A. Shamir, Payword and micromint: Two simple micropayment schemes, in: Security Protocols Workshop, 1996, pp. 69-87
20. Schorr H., and Waite W.M. An efficient machineindependent procedure for garbage collection in various list structures. Communications of the ACM 10 8 (1967) 501-506
21. Sella Y. On the computation-storage trade-offs of hash chain traversal. Financial Cryptography (2003) 270-285
22. Siklossy L. Fast and read-only algorithms for traversing trees without an auxiliary stack. Information Processing Letters 1 (1972) 149-152
23. J. Sobel, D.P. Friedman, Recycling continuations, ACM SIGPLAN International Conference on Functional Programming 34 (1) (1999) 251-260
24. Szydlo M. Merkle tree traversal in log space and time. Eurocrypt (2004) 541-554
25. Walker D., and Morrisett J.G. Alias types for recursive data structures. Types in Compilation (2000) 177-206