Two simplified algorithms for maintaining order in a list (2002)
Cached
Download Links
- [db.uwaterloo.ca]
- [db.uwaterloo.ca]
- [www.cs.sunysb.edu]
- [erikdemaine.org]
- DBLP
Other Repositories/Bibliography
| Venue: | PROCEEDINGS OF THE 10TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA |
| Citations: | 52 - 7 self |
BibTeX
@INPROCEEDINGS{Bender02twosimplified,
author = {Michael A. Bender and Richard Cole and Erik D. Demaine and Martin Farach-Colton and Jack Zito},
title = {Two simplified algorithms for maintaining order in a list},
booktitle = { PROCEEDINGS OF THE 10TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA},
year = {2002},
pages = {152--164},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
