The Information-Theoretic Bound is Good for Merging
From MaRDI portal
Publication:3340174
Cited in
(30)- The \(1/3-2/3\) Conjecture for Coxeter groups
- Greedy balanced pairs in \(N\)-free ordered sets
- Hard Enumeration Problems in Geometry and Combinatorics
- A strange pigeon-hole principle
- The cross-product conjecture for width two posets
- Balancing poset extensions
- Computing the number of mergings with constraints
- Balanced pairs in partial orders
- A family of partially ordered sets with small balance constant
- Some Completeness Results on Decision Trees and Group Testing
- The gold partition conjecture
- Sorting and Selection with Random Costs
- Balance constants for Coxeter groups
- Extensions of the Kahn-Saks inequality for posets of width two
- The worst balanced partially ordered sets-ladders with broken rungs
- Improving the \(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture for width two posets
- Sorting probability for large Young diagrams
- Every poset has a central element
- Sorting probability of Catalan posets
- The 1/3-2/3 conjecture for ordered sets whose cover graph is a forest
- Antimatroids and balanced pairs
- Balancing extensions via Brunn-Minkowski
- On linear extensions of ordered sets with a symmetry
- On generalized comparison-based sorting problems
- On the optimality of tape merge of two lists with similar size
- Linear extensions of infinite posets
- On the \(1/3-2/3\) conjecture
- Balance theorems for height-2 posets
- Balancing pairs and the cross product conjecture
- Semiorders and the 1/3-2/3 conjecture
This page was built for publication: The Information-Theoretic Bound is Good for Merging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340174)
