Efficient uses of the past

David Paul Dobkin, J. Ian Munro

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Existing data structures for maintaining sets do not remember the situation they represented 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 several important problems in geometric computation are also given.

Original languageEnglish (US)
Pages (from-to)455-465
Number of pages11
JournalJournal of Algorithms
Volume6
Issue number4
DOIs
StatePublished - Jan 1 1985

Fingerprint

Data structures
Data Structures

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Control and Optimization
  • Computational Theory and Mathematics

Cite this

Dobkin, David Paul ; Munro, J. Ian. / Efficient uses of the past. In: Journal of Algorithms. 1985 ; Vol. 6, No. 4. pp. 455-465.
@article{274649e6805c4d66b6a139880dd063db,
title = "Efficient uses of the past",
abstract = "Existing data structures for maintaining sets do not remember the situation they represented 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 several important problems in geometric computation are also given.",
author = "Dobkin, {David Paul} and Munro, {J. Ian}",
year = "1985",
month = "1",
day = "1",
doi = "https://doi.org/10.1016/0196-6774(85)90027-6",
language = "English (US)",
volume = "6",
pages = "455--465",
journal = "Journal of Algorithms",
issn = "0196-6774",
publisher = "Academic Press Inc.",
number = "4",

}

Efficient uses of the past. / Dobkin, David Paul; Munro, J. Ian.

In: Journal of Algorithms, Vol. 6, No. 4, 01.01.1985, p. 455-465.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient uses of the past

AU - Dobkin, David Paul

AU - Munro, J. Ian

PY - 1985/1/1

Y1 - 1985/1/1

N2 - Existing data structures for maintaining sets do not remember the situation they represented 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 several important problems in geometric computation are also given.

AB - Existing data structures for maintaining sets do not remember the situation they represented 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 several important problems in geometric computation are also given.

UR - http://www.scopus.com/inward/record.url?scp=0042710372&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042710372&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/0196-6774(85)90027-6

DO - https://doi.org/10.1016/0196-6774(85)90027-6

M3 - Article

VL - 6

SP - 455

EP - 465

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 4

ER -