Skip to main content
SpringerLink
Log in

Searching, sorting and information theory

  • Invited Lectures
  • 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.

Bibliography

  • Adel'son-Velskii, Landis: An algorithm for the organization of information, Soviet Math. Dokl, 3, 1259–1262.

    Google Scholar 

  • Allan, B., Munro, I.: Self-Organizing Binary Search Trees, JACM, Vol. 25 (1978), pp. 526–535.

    Article  Google Scholar 

  • Altenkamp, D., Mehlhorn, K.: Codes: Unequal Letter Costs, Unequal Probabilities, Technical Report A 78/18, FB 10, Universität des Saarlandes (preliminary version: 5th Colloquium on Automata, Languages and Programming, Udine, 1978, Lecture Notes in Computer Science 62, pp. 15–25.

    Google Scholar 

  • Baer, J. L.: Weight-balanced trees, Proc. AFIPS, Vol. 44, 1975, pp. 467–472.

    Google Scholar 

  • Bayer, P. J.: Improved Lower Bounds on the Cost of Optimal and Balanced Binary Search Trees, Technical Report, Dept. of Computer Science, MIT.

    Google Scholar 

  • Brown, M.R., Tarjan, R.E.: A Representation for Linear Lists with Movable Fingers, 10th ACM Symposium on Theory of Comouting, pp. 19–29, 1978.

    Google Scholar 

  • Bruno, J., Coffman, E.G.: Nearly Optimal Binary Search Trees (IFIP 1971, North Holland 1972, pp. 99–103).

    Google Scholar 

  • Cot, H.: Characterization and Design of Optimal Prefix Codes, Ph. D. Thesis, Stanford University, June 1977.

    Google Scholar 

  • Csiszar: Simple Proofs of some theorems on noiseless channels, Inf. and Control 14, pp. 285–298, 1969.

    Google Scholar 

  • Fredman, M.L. (a): Two Applications of a Probabilistic Search Technique: Sorting X+Y and Building Balanced Search Trees, 7th ACM Symposium on Theory of Computing, 1975, pp. 240–244.

    Google Scholar 

  • Fredman, M.L. (b): How good is the information theory bound in sorting, TCS 1, (4), pp. 355–362, 1976.

    Google Scholar 

  • Garsia, A.M., Wachs, M.L.: A new algorithm for minimum cost binary trees, SICOMP, No 4, 1977, pp. 622–642.

    Google Scholar 

  • Gotlieb, Walker: A Top-Down Algorithm for Constructing Nearly Optimal Lexicographical Trees, Graph Theory and Computing, Academic Press, 1972.

    Google Scholar 

  • Guibas, L.J., McCreight, E.M., Plass, M.F., Roberts, J.R.: A new representation for linear lists, 9th ACM Symposium on Theory of Computing, 1977, pp. 49–60.

    Google Scholar 

  • Güttler, R., Mehlhorn, K., Schneider, W.: Binary Search Trees: Average and Worst Case Behavior, GI-Jahrestagung 1976, Informatik Fachberichte 5, pp. 301–317.

    Google Scholar 

  • Harper, Pague, Savage, Straus: Sorting X+Y, CACM 18, 6 (1975), pp. 347–350.

    Google Scholar 

  • Horibe, Y.: An improved bound for weight balanced trees, Inf. and Control 34, 1977.

    Google Scholar 

  • Horibe, Y., Nemetz, T.: On the Max-Entropy Rule for a Binary Search Tree, Technical Report, Mathematical Institute, Hungarian Academy of Sciences.

    Google Scholar 

  • Hu, Tucker: Optimum Computer Search Trees, SIAM J. of Applied Math. 21, 1971, pp. 514–532.

    Article  Google Scholar 

  • Huffman: A method for the Construction of Minimum-Redundancy Codes, Proc. IRE 40, 1098–1101, 1952.

    Google Scholar 

  • Itai, A.: Optimal Alphabetic Trees, SIAM J. on Computing, Vol. 5, No. 1, March 1976, pp. 9–18.

    Article  Google Scholar 

  • Katona, G., Nemetz, T.: Huffman Codes and Self Information, IEEE Transactions on Information Theory, May 1976, pp. 337–340.

    Google Scholar 

  • Knuth, D.E. (a): Optimum Binary Search Trees, Acta Informatica 1, 1971, pp. 14–25.

    Google Scholar 

  • Knuth, D.E.: The Art of Computer Programming, Vol 3: Sorting and Searching, Addison Wesley, 1973.

    Google Scholar 

  • Krause: Channels which transmit letters of unequal duration, Inf. and Control 5, pp. 13–24, 1962.

    Google Scholar 

  • Mehlhorn, K. (a): Dynamic Binary Search, 4th Colloquium on Automata, Languages and Programming, Turku, 1977, Springer Lecture Notes 52, pp. 323–336 (to appear SIAM J. on Computing).

    Google Scholar 

  • Mehlhorn, K. (b): Sorting Presorted Files, 4th GI-Conference on Theoretical Computer Science, Aachen, 1979.

    Google Scholar 

  • Mehlhorn, K. (c): Effiziente Algorithmen, Teubner Verlag, Studienbücher Informatik, 1977.

    Google Scholar 

  • Mehlhorn, K. (d): An Efficient Algorithm for the Construction of Nearly Optimal Prefix Codes, Technical Report A 78/13, FB 10, Universität des Saarlandes, submitted for publication.

    Google Scholar 

  • Mehlhorn, K., Tsagarakis, M.: On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs, 4ième Colloque de Lille "Les Ärbes en Algebre et en Programmation", Lille 1979.

    Google Scholar 

  • van Leeuwen, J. (a): The complexity of data organization, 1976, Mathematical Centre Tract 81, pp. 37–147.

    Google Scholar 

  • van Leeuwen, J. (b): On the construction of Huffmann Trees, 3rd ICALP (1976), pp. 382–410, Ed. S. Michaelson and R. Milner, Edinburgh University Press.

    Google Scholar 

  • Unterauer, K.: Optimierung gewichteter Binärbäume zur Organisation geordneter dynamischer Dateien, Doktorarbeit, TU München, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 10 – Angewandte Mathematik und Informatik, Universität des Saarlandes, 6600, Saarbrücken, BRD

    Kurt Mehlhorn

Authors
  1. Kurt Mehlhorn
    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

Mehlhorn, K. (1979). Searching, sorting and information theory. 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_10

Download citation

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

  • 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