Two Simplified Algorithms for Maintaining Order in a List

Download PDF
Open Webpage

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

Published: 2002, Last Modified: 12 May 2025ESA 2002EveryoneRevisionsBibTeXCC BY-SA 4.0
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.