Two simplified algorithms for maintaining order in a list

Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In the Order-Maintenance Problem, the objective is to maintain a total order subject to insertions, deletions, and precedence queries. Known optimal solutions, due to Dietz and Sleator, are complicated. We present new algorithms that match the bounds of Dietz and Sleator. Our solutions are simple, and we present experimental evidence that suggests that they are superior in practice.

Original languageEnglish (US)
Title of host publicationAlgorithms - ESA 2002 - 10th Annual European Symposium, Proceedings
PublisherSpringer Verlag
Pages152-164
Number of pages13
Volume2461
ISBN (Print)3540441808, 9783540441809
StatePublished - 2002
Event10th Annual European Symposium on Algorithms, ESA 2002 - Rome, Italy
Duration: Sep 17 2002Sep 21 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2461
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other10th Annual European Symposium on Algorithms, ESA 2002
CountryItaly
CityRome
Period9/17/029/21/02

Fingerprint

Deletion
Insertion
Maintenance
Optimal Solution
Query
Evidence

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Bender, M. A., Cole, R., Demaine, E. D., Farach-Colton, M., & Zito, J. (2002). Two simplified algorithms for maintaining order in a list. In Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings (Vol. 2461, pp. 152-164). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2461). Springer Verlag.

Two simplified algorithms for maintaining order in a list. / Bender, Michael A.; Cole, Richard; Demaine, Erik D.; Farach-Colton, Martin; Zito, Jack.

Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. Vol. 2461 Springer Verlag, 2002. p. 152-164 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2461).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bender, MA, Cole, R, Demaine, ED, Farach-Colton, M & Zito, J 2002, Two simplified algorithms for maintaining order in a list. in Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. vol. 2461, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461, Springer Verlag, pp. 152-164, 10th Annual European Symposium on Algorithms, ESA 2002, Rome, Italy, 9/17/02.
Bender MA, Cole R, Demaine ED, Farach-Colton M, Zito J. Two simplified algorithms for maintaining order in a list. In Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. Vol. 2461. Springer Verlag. 2002. p. 152-164. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bender, Michael A. ; Cole, Richard ; Demaine, Erik D. ; Farach-Colton, Martin ; Zito, Jack. / Two simplified algorithms for maintaining order in a list. Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. Vol. 2461 Springer Verlag, 2002. pp. 152-164 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3a8c0ac740774fb982dfd01a611905a5,
title = "Two simplified algorithms for maintaining order in a list",
abstract = "In the Order-Maintenance Problem, the objective is to maintain a total order subject to insertions, deletions, and precedence queries. Known optimal solutions, due to Dietz and Sleator, are complicated. We present new algorithms that match the bounds of Dietz and Sleator. Our solutions are simple, and we present experimental evidence that suggests that they are superior in practice.",
author = "Bender, {Michael A.} and Richard Cole and Demaine, {Erik D.} and Martin Farach-Colton and Jack Zito",
year = "2002",
language = "English (US)",
isbn = "3540441808",
volume = "2461",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "152--164",
booktitle = "Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings",

}

TY - GEN

T1 - Two simplified algorithms for maintaining order in a list

AU - Bender, Michael A.

AU - Cole, Richard

AU - Demaine, Erik D.

AU - Farach-Colton, Martin

AU - Zito, Jack

PY - 2002

Y1 - 2002

N2 - In the Order-Maintenance Problem, the objective is to maintain a total order subject to insertions, deletions, and precedence queries. Known optimal solutions, due to Dietz and Sleator, are complicated. We present new algorithms that match the bounds of Dietz and Sleator. Our solutions are simple, and we present experimental evidence that suggests that they are superior in practice.

AB - In the Order-Maintenance Problem, the objective is to maintain a total order subject to insertions, deletions, and precedence queries. Known optimal solutions, due to Dietz and Sleator, are complicated. We present new algorithms that match the bounds of Dietz and Sleator. Our solutions are simple, and we present experimental evidence that suggests that they are superior in practice.

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

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

M3 - Conference contribution

SN - 3540441808

SN - 9783540441809

VL - 2461

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 152

EP - 164

BT - Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings

PB - Springer Verlag

ER -