Sorting and searching revisted
- 1 January 1996
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A new efficient radix sortPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sublogarithmic searching without multiplicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sorting in linear time?Published by Association for Computing Machinery (ACM) ,1995
- Lower bounds for union-split-find related problems on random access machinesPublished by Association for Computing Machinery (ACM) ,1994
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- Optimal bounds for decision problems on the CRCW PRAMJournal of the ACM, 1989
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Upper bounds for sorting integers on random access machinesTheoretical Computer Science, 1983
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Preserving order in a forest in less than logarithmic timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975