LTS: The list-traversal synopses system

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

Volumn 4032 LNCS, Issue , 2006, Pages 353-354

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

^a TEL AVIV UNIVERSITY   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Hash chain; List traversal; Pebbling; Program rollback; Synopsis

Indexed keywords

ALGORITHMS; ANIMATION; COMPUTATION THEORY; DATA STORAGE EQUIPMENT; DATA STRUCTURES; SUPERVISORY AND EXECUTIVE PROGRAMS;

HASH CHAIN; LIST TRAVERSAL; PEBBLING; PROGRAM ROLLBACK; SYNOPSIS;

INFORMATION RETRIEVAL SYSTEMS;

EID: 33746994112     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780991_35     Document Type: Conference Paper

References (3)

1. Matias, Y., Porat, E.: Efficient pebbling for list traversal synopses, In Thirtieth International Colloquium on Automata, Languages and Programming (ICALP), (2003) 918-928.
2. Matias, Y., Porat, E.: Efficient pebbling for list traversal synopses with applications to program rollback. Theory of Computing Systems (TOCS), to appear.
3. Furman, M., Matias, Y., Porat, E.: The List Traversal Synopses (LTS) System. Technical Report, Tel Aviv University (2006).