Self-organizing heuristics for implicit data structures
SIAM Journal on Computing
An implicit data structure supporting insertion, deletion, and search in O(log:OS2:OEn) time
Journal of Computer and System Sciences
Implicit B-Trees: New Results for the Dictionary Problem
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Implicit B-trees: a new data structure for the dictionary problem
Journal of Computer and System Sciences - Special issue on FOCS 2002
Implicit dictionaries with O(1) modifications per update and fast search
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
In-place 2-d nearest neighbor search
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Distribution-Sensitive Dictionary with Low Space Overhead
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Optimal cache-oblivious implicit dictionaries
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A distribution-sensitive dictionary with low space overhead
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We describe a new implicit data structure for maintaining n data values in the first n locations of an array. No information other than n and the data is to be retained, and the only operations which we may perform on the data values (other than reads and writes) are comparisons. Our structure supports searches in O(log n log log n) time in the worst case, and insertions and deletions in O(log n log log n) amortized time. The best known bound for these operations in main memory is O(log 2 n/log log n) in the worst case.