On Generalized Comparison-Based Sorting Problems
From MaRDI portal
Publication:2848974
DOI10.1007/978-3-642-40273-9_12zbMath1394.68105OpenAlexW428405241MaRDI QIDQ2848974
Publication date: 13 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_12
Related Items (1)
Cites Work
- Entropy splitting for antiblocking corners and perfect graphs
- Entropy and sorting.
- Every poset has a central element
- Producing posets
- Balancing extensions via Brunn-Minkowski
- Counting linear extensions
- How good is the information theory bound in sorting?
- Balanced pairs in partial orders
- Balancing pairs and the cross product conjecture
- Sorting under partial information (without the ellipsoid algorithm).
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Sorting and Selection in Posets
- The Information-Theoretic Bound is Good for Merging
- Searching in Trees, Series-Parallel and Interval Orders
- Sorting and Recognition Problems for Ordered Sets
- Searching in 2-dimensional partial orders
- On the Complexity of Partial Order Productions
- Matching Nuts and Bolts in O(n log n) Time
- An Efficient Algorithm for Partial Order Production
- Algorithms for the Generalized Sorting Problem
- Bounds on Optimal Merge Performance, and a Strategy for Optimality
- Automata, Languages and Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Generalized Comparison-Based Sorting Problems
