Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast deterministic construction of static dictionaries
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Faster deterministic sorting and priority queues in linear space
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Tight(er) worst-case bounds on dynamic searching and priority queues
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Faster deterministic dictionaries
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Improved fast integer sorting in linear space
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Dynamic and hierarchical spatial access method using integer searching
Proceedings of the tenth international conference on Information and knowledge management
Deterministic sorting in O(nlog log n) time and linear space
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved fast interger sorting in linear space
Information and Computation
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
A trade-off for worst-case efficient dictionaries
Nordic Journal of Computing
On AC0 implementations of fusion trees and atomic heaps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Paging on a RAM with Limited Resources
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Exponential Structures for Efficient Cache-Oblivious Algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Fast Integer Sorting in Linear Space
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Optimised Predecessor Data Structures for Internal Memory
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Space efficient dynamic stabbing with fast queries
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Deterministic sorting in O(nlog logn) time and linear space
Journal of Algorithms
Journal of Computer and System Sciences - Special issue: STOC 2003
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms
Concurrent cache-oblivious b-trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fast string sorting using order-preserving compression
Journal of Experimental Algorithmics (JEA)
Adjacency queries in dynamic sparse graphs
Information Processing Letters
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
A data structure for multi-dimensional range reporting
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Voronoi diagrams in n · 2o(√lg lg n) time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Efficient IP table lookup via adaptive stratified trees with selective reconstructions
Journal of Experimental Algorithmics (JEA)
Making deterministic signatures quickly
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Uniform deterministic dictionaries
ACM Transactions on Algorithms (TALG)
Lower bounds for predecessor searching in the cell probe model
Journal of Computer and System Sciences
Making deterministic signatures quickly
ACM Transactions on Algorithms (TALG)
Data Structures for Approximate Orthogonal Range Counting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
External memory range reporting on a grid
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
One-Dimensional finger searching in RAM model revisited
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Predecessor queries in constant time?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
LSEQ: an adaptive structure for sequences in distributed collaborative editing
Proceedings of the 2013 ACM symposium on Document engineering
| Hi-index | 0.00 |
We present a significant improvement on linear space deterministic sorting and searching. On a unit-cost RAM with word size w, an ordered set of n w-bit keys (viewed as binary strings or integers) can be maintained in O(min{[/spl radic/(logn)][logn/logw+loglogn][logwloglogn]}) time per operation, including insert, delete, member search, and neighbour search. The cost for searching is worst-case while the cost for updates is amortized. As an application, n keys can be sorted in linear at O(n/spl radic/(logn)) worst-case cost. The best previous method for deterministic sorting and searching in linear space has been the fusion trees which supports updates and queries in O(logn/loglogn) amortized time and sorting in O(nlogn/loglogn) worst-case time. We also make two minor observations on adapting our data structure to the input distribution and on the complexity of perfect hashing.