An implicit data structure supporting insertion, deletion, and search in O(log:OS2:OEn) time
Journal of Computer and System Sciences
Simplified stable merging tasks
Journal of Algorithms
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Cache oblivious search trees via binary trees of small height
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
Tight Bounds for Searching a Sorted Array of Strings
SIAM Journal on Computing
A Sparse Table Implementation of Priority Queues
Proceedings of the 8th Colloquium on Automata, Languages and Programming
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Maintaining dense sequential files in a dynamic environment (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On a multidimensional search problem (Preliminary Version)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves
FOCS '03 Proceedings of the 44th Annual IEEE 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
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Sorting stably, in-place, with O(n log n) comparisons and O(n) moves
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm for lexicographically sorting n keys in O(nk + n log n) time using O(1) auxiliary data locations, which is simultaneously optimal in time and space.