|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
19th Annual Symposium on Foundations of Computer Science (FOCS 1978)
Improving the bounds on optimal merging
October 16-October 18
| ASCII Text | x | ||
| C. Christen, "Improving the bounds on optimal merging," Foundations of Computer Science, IEEE Annual Symposium on, pp. 259-266, 19th Annual Symposium on Foundations of Computer Science (FOCS 1978), 1978. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1978.20, author = {C. Christen}, title = {Improving the bounds on optimal merging}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1978}, issn = {0272-5428}, pages = {259-266}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1978.20}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Improving the bounds on optimal merging SN - 0272-5428 SP259 EP266 A1 - C. Christen, PY - 1978 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1978.20
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.
Citation:
C. Christen, "Improving the bounds on optimal merging," focs, pp.259-266, 19th Annual Symposium on Foundations of Computer Science (FOCS 1978), 1978
Usage of this product signifies your acceptance of the Terms of Use.