The Information-Theoretic Bound is Good for Merging
From MaRDI portal
Cited in
(34)- Every poset has a central element
- On linear extensions of ordered sets with a symmetry
- Computing the number of mergings with constraints
- Linear extensions of infinite posets
- Balancing extensions via Brunn-Minkowski
- Balance theorems for height-2 posets
- Balanced pairs in partial orders
- A family of partially ordered sets with small balance constant
- On the \(1/3-2/3\) conjecture
- A strange pigeon-hole principle
- Semiorders and the 1/3-2/3 conjecture
- Balancing pairs and the cross product conjecture
- Improving the \(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture for width two posets
- Sorting probability of Catalan posets
- On the optimality of tape merge of two lists with similar size
- Greedy balanced pairs in \(N\)-free ordered sets
- Balancing poset extensions
- The 1/3-2/3 conjecture for ordered sets whose cover graph is a forest
- Antimatroids and balanced pairs
- The gold partition conjecture
- The \(1/3-2/3\) Conjecture for Coxeter groups
- On generalized comparison-based sorting problems
- Hard Enumeration Problems in Geometry and Combinatorics
- Some Completeness Results on Decision Trees and Group Testing
- Sorting probability for large Young diagrams
- The cross-product conjecture for width two posets
- The worst balanced partially ordered sets-ladders with broken rungs
- Sorting and Selection with Random Costs
- Extensions of the Kahn-Saks inequality for posets of width two
- Balance constants for Coxeter groups
- Fast and simple sorting using partial information
- Combinatorics. Abstracts from the workshop held January 4--9, 2026
- Skew shapes, Ehrhart positivity, and beyond
- Optimal antimatroid sorting
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)
