ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Significant Improvements to the Hwang-Lin Merging Algorithm
Full text PdfPdf (398 KB)
Source Journal of the ACM (JACM) archive
Volume 26 ,  Issue 3  (July 1979) table of contents
Pages: 434 - 440  
Year of Publication: 1979
ISSN:0004-5411
Author
Glenn K. Manacher  Department of Information Engineering, University of Illinois at Chicago Circle, Computer Center, Box 4348, Chicago, IL
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 29,   Citation Count: 4
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322139.322144
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
GRAHAM, R L On sorting by comparisons Proc Second Atlas Conf, 1971
2
F. K. Hwang , D. N. Deutsch, A Class of Merging Algorithms, Journal of the ACM (JACM), v.20 n.1, p.148-159, Jan. 1973  [doi>10.1145/321738.321749]
 
3
HWANG, F K, AND LIN, S Optimal merging of two elements with n elements Acta lnformauca 1 (1971), 145-158
 
4
HWANG, F K, AND LIN, S A simple algorithm for merging two disjoint hnearly-ordered sets SIAM J Comping 1, 1 (1972), 31-39
 
5
HWANG, F K, AND LIN, S Some optimality results in merging two disjoint hnearly-ordered sets Internal Memo, Bell Laboratories, Murray Hdl, N J, 1972
 
6
KNLrrH, D The Art of Computer Programmmg, Vol 3 Sorting and Searching Addison-Wesley, Reading, Mass, 1973, pp 181-207
7
Glenn K. Manacher, The Ford-Johnson Sorting Algorithm Is Not Optimal, Journal of the ACM (JACM), v.26 n.3, p.441-456, july 1979  [doi>10.1145/322139.322145]
 
8
HWANG, F K, Private Communication

CITED BY  4
Glenn K. Manacher, The Ford-Johnson Sorting Algorithm Is Not Optimal, Journal of the ACM (JACM), v.26 n.3, p.441-456, july 1979
G. K. Manacher , T. D. Bui , T. Mai, Optimum combinations of sorting and merging, Journal of the ACM (JACM), v.36 n.2, p.290-334, April 1989
Jérémy Barbay , Claire Kenyon, Alternation and redundancy analysis of the intersection problem, ACM Transactions on Algorithms (TALG), v.4 n.1, p.1-18, March 2008
Bruno T. Ávila , Eduardo S. Laber, Merge source coding, Proceedings of the 2009 IEEE international conference on Symposium on Information Theory, p.214-218, June 28-July 03, 2009, Coex, Seoul, Korea

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS


General Terms:
Algorithms, Performance, Theory, Verification

Collaborative Colleagues:
Glenn K. Manacher: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player