@inproceedings{dddd66e619f54f829ce4fcfa58ee2663,
title = "LTS: The list-traversal synopses system",
abstract = "The List-Traversal Synopses (LTS) system enables the efficient execution, utilization, and integration of memory-efficient algorithms that can support efficient forward and backward traversal of unidirectional lists. It has applications ranging from traversal of linked structures, garbage collection, hash-chain computations and program rollback. The system provides animation and performance testing platform for traversal algorithms. We will demonstrate the algorithms animation, and will demonstrate how computer programs can be made reversible, and actually run backwards, using the LTS system.",
keywords = "Hash chain, List traversal, Pebbling, Program rollback, Synopsis",
author = "Michael Furman and Yossi Matias and Ely Porat",
year = "2006",
doi = "10.1007/11780991_35",
language = "אנגלית",
isbn = "3540354727",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "353--354",
booktitle = "Next Generation Information Technologies and Systems - 6th International Conference, NGITS 2006, Proceedings",
address = "גרמניה",
note = "6th International Conference on Next Generation Information Technologies and Systems, NGITS 2006 ; Conference date: 04-07-2006 Through 06-07-2006",
}