The complexity of lexicographic sorting and searching

  • Juraj Wiedermann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


Lower Order Term Retrieval Algorithm Sorting Algorithm Component Comparison Associative Retrieval 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Fredman, M.L.: How good is the information theory bound in sorting?, Theoretical Computer Science 1, 1976, pp. 355–361.CrossRefGoogle Scholar
  2. 2.
    Rivest, R.L.: Partial-match retrieval algorithms, SIAM J. Computing 5, 1976, pp. 115–174.CrossRefGoogle Scholar
  3. 3.
    van Leeuwen, J.: The complexity of data organisation. In: Foundations of computer science II, Part 1. Mathematical centre tracts 81, Mathematisch centrum, Amsterdam 1976.Google Scholar
  4. 4.
    Wiedermann, J.: Search trees for associative retrieval (in Slovak), Informačné systémy 1, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Juraj Wiedermann
    • 1
  1. 1.Computing Research CentreBratislavaCzechoslovakia

Personalised recommendations