Title :
Improving the bounds on optimal merging
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;
Conference_Titel :
Foundations of Computer Science, 1978., 19th Annual Symposium on
Conference_Location :
Ann Arbor, MI, USA
DOI :
10.1109/SFCS.1978.20
