When Can We Sort in o(n log n) Time?

Journal of Computer and System Sciences

Volumn 54, Issue 2, 1997, Pages 345-370

  Ben Amram, Amir M ^a   Galil, Zvi ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; THEOREM PROVING;

DOUBLE PRECISION MULTIPLICATION;

RANDOM ACCESS STORAGE;

EID: 0031118151     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1474     Document Type: Article

References (12)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
2. M. Ajtai, M. Fredman, and J. Komlos, Hash functions for priority queues, Inform. and Comput. 63 (1984), 217-225.
3. R. Bayer and E. McCreight, Organization and maintenance of large ordered indices, Acta Inform. 1 (1972), 173-189.
4. A. M. Ben-Amram, Some notions on notations, SIGACT News 22, No. 4 (1991), 60-62.
5. A. M. Ben-Amram and Z. Galil, On pointers versus addresses, J. Assoc. Comput. Mach. 39, No. 3 (1992), 617-648.
6. N. H. Bshouty, Lower bounds for the complexity of functions in a realistic RAM model, in "Proceedings, Israel Symposium on the Theory of Computing and Systems, Haifa, 1992."
7. N. H. Bshouty, Lower bounds for the complexity of functions in random access machines, J. Assoc. Comput. Mach. 40, No. 2 (1993), 211-223.
8. M. L. Fredman and D. E. Willard, Surpassing the information theoretic barrier with Fusion Trees, J. Comput. System Sci. 47, No. 3 (1993), 424-436.
9. D. Kirkpatrick and S. Reisch, Upper bounds for sorting integers on random access machines, Theoret. Comput. Sci. 28, No. 3 (1984), 263-276.
10. D. E. Knuth, "The Art of Computer Programming," Vol. 3. "Sorting and Searching," Addison-Wesley, Reading, MA, 1973.
11. Y. Matias and U. Vishkin, On parallel hashing and integer sorting, J. Algorithms 12, No. 4 (1991), 573-606.
12. W. Paul and J. Simon, Decision trees and random access machines, in "Logic and Algorithmic," monographie no 30 de l'enseignement mathématique, Université de Genève, 1982.