Backing up in singly linked lists

Authors:
Amir M. Ben-Amram;Holger Petersen
Affiliations:
The Academic College of Tel-Aviv, 4 Antokolski Street, 64044 Tel-Aviv, Israel;University of Stuttgart, Breitwiesenstraβe 20-22, D-70565 Stuttgart, Germany
Venue:
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Year:
1999

On genuinely time bounded computations

Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
On pointers versus addresses

Journal of the ACM (JACM)
An introduction to Kolmogorov complexity and its applications

An introduction to Kolmogorov complexity and its applications
Pure versus impure Lisp

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computability and complexity: from a programming perspective

Computability and complexity: from a programming perspective

Efficient pebbling for list traversal synopses with application to program rollback

Theoretical Computer Science
Efficient pebbling for list traversal synopses

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Hi-index	0.00