Book ChapterDOI
Two Simplified Algorithms for Maintaining Order in a List
Michael A. Bender,Richard Cole,Erik D. Demaine,Martin Farach-Colton,Martin Farach-Colton,Jack Zito +5 more
- pp 152-164
Reads0
Chats0
TLDR
In this paper, the authors present new algorithms that match the bounds of Dietz and Sleator, and present experimental evidence that suggests that their algorithms are superior in practice in practice.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.read more
Citations
More filters
BookDOI
Principles and Practice of Constraint Programming
TL;DR: This work proposes a global ranking constraint and shows that GAC can be achieved in polynomial time and proposes an Oðn3 log nÞ algorithm for achieving RC as well as an efficient quadratic algorithm offering a better tradeoff.
Proceedings ArticleDOI
Self-adjusting computation
TL;DR: Self-adjusting computation is a method for deriving a dynamic algorithm for a problem by "dynamizing" a static algorithm for it.
Proceedings ArticleDOI
Counting inversions, offline orthogonal range counting, and related problems
Timothy M. Chan,Mihai Patrascu +1 more
TL;DR: The new technique is quite simple: it performs a "vertical partitioning" of a trie (akin to van Emde Boas trees), and uses ideas from external memory to improve a long-standing previous bound of O(n, lg) that followed from Dietz's data structure.
Proceedings ArticleDOI
Load balancing and locality in range-queriable data structures
TL;DR: Though this mechanism is specifically designed to improve the performance of skip graphs, it can be adapted to provide deterministic, locality-preserving load-balancing to any distributed data structure that orders machines in a ring or line.
Journal ArticleDOI
A dynamic topological sort algorithm for directed acyclic graphs
David J. Pearce,Paul H. J. Kelly +1 more
TL;DR: A new algorithm is presented that, although it has inferior time complexity compared with the best previously known result, its simplicity leads to better performance in practice and an empirical comparison against the three main alternatives over a large number of random DAGs is provided.
References
More filters
Book ChapterDOI
Skip Lists: A Probabilistic Alternative to Balanced Trees
TL;DR: This paper describes and analyzes skip lists and presents new techniques for analyzing probabilistic algorithms.
Proceedings ArticleDOI
Two algorithms for maintaining order in a list
Paul F. Dietz,Daniel D. Sleator +1 more
TL;DR: The order maintenance problem is that of maintaining a list under a sequence of Insert and Delete operations, while answering Order queries (determine which of two elements comes first in the list).
Proceedings ArticleDOI
Maintaining order in a linked list
TL;DR: The paper concludes with two applications: determining ancestor relationships in a growing tree and maintaining a tree structured environment (context tree) for linked lists.
Journal ArticleDOI
Binary Search Trees of Bounded Balance
TL;DR: A new class of binary search trees, called trees of bounded balance, is introduced which are easy to maintain in their form despite insertions and deletions of nodes, and the search time is only moderately longer than in completely balanced trees.
Proceedings ArticleDOI
Optimal dynamic interval management in external memory
Lars Arge,Jeffrey Scott Vitter +1 more
TL;DR: The data structure is the first optimal external-memory solution to the dynamic interval management problem, which is a special case of 2-dimensional range searching and a central problem for object-oriented and temporal databases and for constraint logic programming.