Efficient uses of the past

David P. Dobkin, J. Ian Munro

Research output: Contribution to journalConference articlepeer-review

20 Scopus citations


A failing of existing data structures for maintaining balanced trees is their inability to remember the situation they held at previous times. We propose a structure from which it is possible to efficiently reconstruct the state of the data it represented at any time. Applications of this data structure to a number of important problems in geometric computation are also given.

Original languageEnglish (US)
Article number4567820
Pages (from-to)200-206
Number of pages7
JournalProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
StatePublished - 1980
Externally publishedYes
Event21st Annual Symposium on Foundations of Computer Science, FOCS 1980 - Syracuse, United States
Duration: Oct 13 1980Oct 15 1980

All Science Journal Classification (ASJC) codes

  • General Computer Science


Dive into the research topics of 'Efficient uses of the past'. Together they form a unique fingerprint.

Cite this