The complexity of lexicographic sorting and searching
- 1 January 1979
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 517-522
- https://doi.org/10.1007/3-540-09526-8_52
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- How good is the information theory bound in sorting?Theoretical Computer Science, 1976
- Partial-Match Retrieval AlgorithmsSIAM Journal on Computing, 1976