The Information-Theoretic Bound is Good for Merging
暂无分享,去创建一个
[1] Andrew Chi-Chih Yao,et al. Some Monotonicity Properties of Partial Orders , 1979, SIAM J. Algebraic Discret. Methods.
[2] R. Graham. Linear Extensions of Partial Orders and the FKG Inequality , 1982 .
[3] Donald E. Knuth,et al. The art of computer programming: sorting and searching (volume 3) , 1973 .
[4] Michael E. Saks,et al. Searching Ordered Structures , 1985, J. Algorithms.
[5] Bill Sands. Counting antichains in finite partially ordered sets , 1981, Discret. Math..
[6] Andrew Chi-Chih Yao,et al. Information Bounds Are Weak in the Shortest Distance Problem , 1980, JACM.
[7] D. Kleitman,et al. A Monotonicity Property of Partial Orders , 1981 .
[8] Lawrence A. Shepp,et al. The FKG Inequality and Some Monotonicity Properties of Partial Orders , 1980, SIAM J. Algebraic Discret. Methods.
[9] Michael L. Fredman,et al. How Good is the Information Theory Bound in Sorting? , 1976, Theor. Comput. Sci..
[10] S. G. Mohanty,et al. Lattice Path Counting and Applications. , 1980 .