论文信息 - Two Probabilistic Results on Merging

Two Probabilistic Results on Merging

This paper contains two probabilistic results about merging two sorted lists of sizes n and m with n 1.618 it is significantly faster than binary merge. We also prove an average case lower bound for a wide class of merging algorithms, when 1

Sampath Kannan | Miklos Santha | Wenceslas Fernandez de la Vega

[1] C. Christen. Improving the Bounds on Optimal Merging , 1978, FOCS.

[2] Paul K. Stockmeyer,et al. On the Optimality of Linear Merge , 1980, SIAM J. Comput..

[3] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4] Frank K. Hwang,et al. A Class of Merging Algorithms , 1973, JACM.

[5] Vasek Chvátal. Probabilistic methods in graph theory , 1984, Ann. Oper. Res..

[6] Frank K. Hwang,et al. A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets , 1972, SIAM J. Comput..

[7] Glenn K. Manacher,et al. Significant Improvements to the Hwang-Lin Merging Algorithm , 1979, JACM.