• DocumentCode
    2179701
  • Title

    Improving the bounds on optimal merging

  • Author

    Christen, C.

  • fYear
    1978
  • fDate
    16-18 Oct. 1978
  • Firstpage
    259
  • Lastpage
    266
  • Abstract
    This paper presents a new merging algorithm and uses a counterstrategy argument to derive new upper and lower bounds on the complexity of the optimal merging problem. These improved bounds differ by at most ⌈ m/4 ⌉ comparisons, where m is the number of elements of the shorter sequence.
  • Keywords
    Councils; H infinity control; Information theory; Merging; Sorting; Testing; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1978., 19th Annual Symposium on
  • Conference_Location
    Ann Arbor, MI, USA
  • ISSN
    0272-5428
  • Type

    conf

  • DOI
    10.1109/SFCS.1978.20
  • Filename
    4567986
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2179701