Jun 16, 2003 · Abstract: We show how to support efficient back traversal in a unidirectional list, using small memory and with essentially no slowdown in ...

We show how to support efficient back traversal in a unidirectional list, using small memory and with essentially no slowdown in forward steps.

The list pebbling algorithm supports full traversal in at most lg n amortized list-steps per back-step, one list-step per forward step, using 2 lg n pebbles.

We show how to support efficient back traversal in a unidirectional list, using small memory and with essentially no slowdown in forward steps.

The algorithm is based on a novel pebbling technique which moves pebbles on a "virtual binary tree" that can only be traversed in a pre-order fashion, ...

Efficient Pebbling for List Traversal Synopses with Application to Program Rollback. Yossi Matias. Ely Porat. Theoretical Computer Science, 379, issue 3 (2007) ...

We show how to support efficient back traversal in a unidirectional list, using small memory and with essentially no slowdown in forward steps.

We show how to support efficient back traversal in a unidirectional list, using small memory and with essentially no slowdown in forward steps.

Efficient Pebbling for List Traversal Synopses. Yossi Matias. Ely Porat. ICALP (2003), pp. 918-928. Download Google Scholar ...

The compact data structures used by the pebbling algorithms, called list traversal synopses, extend to general directed graphs, and have other interesting ...