zbMATH — the first resource for mathematics

The complexity of lexicographic sorting and searching. (English) Zbl 0467.68057

68P10 Searching and sorting
PDF BibTeX Cite
Full Text: EuDML
[1] M. L. Fredman: How good is the information theory bound in sorting?. Theoretical Computer Science 1, 1976, pp. 355 - 361. · Zbl 0327.68056
[2] R. L. Rivest: Partial-match retrieval algorithms. SIAM J. Computing 5, 1976, pp. 115-174. · Zbl 0331.68064
[3] J. van Leeuwen: The complexity of data organisation. Foundations of computer science II. Part 1. Mathematical centre tracts 81, Mathematisch centrum, Amsterdam 1976.
[4] J. Wiedermann: Search trees for associative retrieval. (in Slovak). Informačné systémy 1, 1979, pp. 27-41.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.