Maintaining order in a generalized linked list
Acta Informatica
Good worst-case algorithms for inserting and deleting records in dense sequential files
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Journal of Algorithms - Special issue on SODA '95 papers
Lower Bounds for Monotonic List Labeling
SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
A Tight Lower Bound for On-line Monotonic List Labeling
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Skip Lists: A Probabilistic Alternative to Balanced Trees
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
A Sparse Table Implementation of Priority Queues
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Maintaining dense sequential files in a dynamic environment (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Efficient ordering for XML data
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Making data structures confluently persistent
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Querying and maintaining ordered XML data using relational databases
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
An experimental analysis of self-adjusting computation
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Cache-oblivious string B-trees
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dynamic labeling schemes for ordered XML based on type information
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
ACM Transactions on Algorithms (TALG)
A dynamic topological sort algorithm for directed acyclic graphs
Journal of Experimental Algorithmics (JEA)
A data structure for multi-dimensional range reporting
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Tight bounds for dynamic convex hull queries (again)
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
DITTO: automatic incrementalization of data structure invariant checks (in Java)
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Information Processing Letters
Information Processing Letters
A tight analysis of the Katriel–Bodlaender algorithm for online topological ordering
Theoretical Computer Science
Nested parallelism in transactional memory
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Improved compact routing schemes for dynamic trees
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Orthogonal range searching in linear and almost-linear space
Computational Geometry: Theory and Applications
A new approach to incremental topological ordering
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Brief announcement: new bounds for the controller problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
An experimental analysis of self-adjusting computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Succinct Index for Dynamic Dictionary Matching
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
New bounds for the controller problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
A batch algorithm for maintaining a topological order
ACSC '10 Proceedings of the Thirty-Third Australasian Conferenc on Computer Science - Volume 102
Counting inversions, offline orthogonal range counting, and related problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A fast algorithm for three-dimensional layers of maxima problem
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On suffix extensions in suffix trees
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Towards real-time suffix tree construction
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Short transitive signatures for directed trees
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Tight lower bounds for the online labeling problem
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On suffix extensions in suffix trees
Theoretical Computer Science
Cross-Document pattern matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Orthogonal range searching in linear and almost-linear space
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On online labeling with polynomially many labels
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Time-Dependent simple temporal networks
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Practical Gröbner basis computation
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
On randomized online labeling with polynomially many labels
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
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.