skip to main content
article
Free Access

Bounds on Optimal Merge Performance, and a Strategy for Optimality

Authors Info & Claims
Published:01 October 1972Publication History
First page image

References

  1. 1 AsH, R.B. Information Theory. Interscience, New York, 1965.Google ScholarGoogle Scholar
  2. 2 BECKENBACH, E. F., AND BELLMAN, R. Inequalities. SpringerWerlag, Berlin, 1961.Google ScholarGoogle Scholar
  3. 3 BENNETT, B. T., AND FRAZER, W. D. Approximating optimal direct-access merge performance. Proc. IFIP Cong. 1971, North-Holland Pub. Co., Amsterdam (in press).Google ScholarGoogle Scholar
  4. 4 BURGE, W.H. Sorting, trees, and measures of order. Information and Control I (1958), 181-197.Google ScholarGoogle Scholar
  5. 5 GALLAGHER, R. G. Information Theory and Reliable Communication. Wiley, New York, 1968. Google ScholarGoogle Scholar
  6. 6 HVFFMAN, D. A. A method for the construction of minimum redundancy codes. Proc. IRE (Sept. 1952). 1098-1101.Google ScholarGoogle Scholar
  7. 7 KNUTH, D .E . Length of strings for a merge sort. Comm. ACM 6, 11 (Nov. 1963), 685--688. Google ScholarGoogle Scholar

Index Terms

  1. Bounds on Optimal Merge Performance, and a Strategy for Optimality

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image Journal of the ACM
        Journal of the ACM  Volume 19, Issue 4
        Oct. 1972
        188 pages
        ISSN:0004-5411
        EISSN:1557-735X
        DOI:10.1145/321724
        Issue’s Table of Contents

        Copyright © 1972 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 October 1972
        Published in jacm Volume 19, Issue 4

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!