The Information-Theoretic Bound is Good for Merging
- 1 November 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (4) , 795-801
- https://doi.org/10.1137/0213049
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Searching ordered structuresJournal of Algorithms, 1985
- Linear Extensions of Partial Orders and the FKG InequalityPublished by Springer Nature ,1982
- Counting antichains in finite partially ordered setsDiscrete Mathematics, 1981
- A Monotonicity Property of Partial OrdersStudies in Applied Mathematics, 1981
- The FKG Inequality and Some Monotonicity Properties of Partial OrdersSIAM Journal on Algebraic Discrete Methods, 1980
- Some Monotonicity Properties of Partial OrdersSIAM Journal on Algebraic Discrete Methods, 1980
- Information Bounds Are Weak in the Shortest Distance ProblemJournal of the ACM, 1980
- How good is the information theory bound in sorting?Theoretical Computer Science, 1976