Pages that link to "Item:Q1226391"
From MaRDI portal
The following pages link to How good is the information theory bound in sorting? (Q1226391):
Displayed 43 items.
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- Tight bounds for online stable sorting (Q553955) (← links)
- A pseudo-algorithmic separation of lines from pseudo-lines (Q674001) (← links)
- An algorithm for computing exact least-trimmed squares estimate of simple linear regression with constraints (Q957150) (← links)
- Every poset has a central element (Q1068859) (← links)
- Linear extensions of infinite posets (Q1110544) (← links)
- Topologically sweeping an arrangement (Q1122981) (← links)
- Balancing extensions via Brunn-Minkowski (Q1181013) (← links)
- On the conductance of order Markov chains (Q1182035) (← links)
- Sorting the sums \((x_ i+y_ j)\) in \(O(n^ 2)\) comparisons (Q1199530) (← links)
- Balance theorems for height-2 posets (Q1205154) (← links)
- Lower bounds for sorting of sums (Q1262763) (← links)
- Balanced pairs in partial orders (Q1301727) (← links)
- Better lower bounds on detecting affine and spherical degeneracies (Q1346125) (← links)
- Space-time trade-offs for some ranking and searching queries (Q1603491) (← links)
- A family of partially ordered sets with small balance constant (Q1630895) (← links)
- Linear extensions and comparable pairs in partial orders (Q1789051) (← links)
- On the \(1/3-2/3\) conjecture (Q1789064) (← links)
- A strange pigeon-hole principle (Q1814183) (← links)
- Semiorders and the 1/3-2/3 conjecture (Q1823267) (← links)
- A framework for adaptive sorting (Q1891925) (← links)
- Balancing pairs and the cross product conjecture (Q1908931) (← links)
- Improving the \(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture for width two posets (Q2036599) (← links)
- Balancing poset extensions (Q2266032) (← links)
- Sublinear merging and natural mergesort (Q2366243) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Sorting under partial information (without the ellipsoid algorithm). (Q2439837) (← links)
- Adaptive sorting: an information theoretic perspective (Q2480779) (← links)
- On Generalized Comparison-Based Sorting Problems (Q2848974) (← links)
- Connected Rectilinear Graphs on Point Sets (Q3611865) (← links)
- The complexity of lexicographic sorting and searching (Q3920657) (← links)
- Selection and sorting in totally monotone arrays (Q3979609) (← links)
- Computing and ranking measures of presortedness (Q4323402) (← links)
- (Q5002761) (← links)
- Sorting probability for large Young diagrams (Q5028494) (← links)
- A framework for adaptive sorting (Q5056160) (← links)
- Preprocessing Ambiguous Imprecise Points (Q5088972) (← links)
- The cross-product conjecture for width two posets (Q5100036) (← links)
- Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
- Sorting and Selection with Random Costs (Q5458516) (← links)
- A note on average-case sorting (Q5965138) (← links)