When Can We Sort ino(nlogn) Time?
Authors:
Open Access
- 1 April 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 54 (2) , 345-370
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- On the complexity of functions for random access machinesJournal of the ACM, 1993
- On pointers versus addressesJournal of the ACM, 1992
- Lower bounds for the complexity of functions in a realistic RAM model1992
- On parallel hashing and integer sortingJournal of Algorithms, 1991
- Some notions on notationsACM SIGACT News, 1991
- Upper bounds for sorting integers on random access machinesTheoretical Computer Science, 1983
- Organization and maintenance of large ordered indexesActa Informatica, 1972