[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

The complexity of lexicographic sorting and searching

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1979 (MFCS 1979)

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fredman, M.L.: How good is the information theory bound in sorting?, Theoretical Computer Science 1, 1976, pp. 355–361.

    Article  Google Scholar 

  2. Rivest, R.L.: Partial-match retrieval algorithms, SIAM J. Computing 5, 1976, pp. 115–174.

    Article  Google Scholar 

  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. Wiedermann, J.: Search trees for associative retrieval (in Slovak), Informačné systémy 1, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Research Centre, Dúbravská 3, 885 31, Bratislava, Czechoslovakia

    Juraj Wiedermann

Authors
  1. Juraj Wiedermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wiedermann, J. (1979). The complexity of lexicographic sorting and searching. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation