On Generalized Comparison-Based Sorting Problems (Q2848974): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W428405241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Producing posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced pairs in partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing pairs and the cross product conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting linear extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Partial Order Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting under partial information (without the ellipsoid algorithm). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy splitting for antiblocking corners and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting and Selection in Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in Trees, Series-Parallel and Interval Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting and Recognition Problems for Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Optimal Merge Performance, and a Strategy for Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good is the information theory bound in sorting? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Generalized Sorting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and sorting. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing extensions via Brunn-Minkowski / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Nuts and Bolts in O(n log n) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Information-Theoretic Bound is Good for Merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every poset has a central element / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in 2-dimensional partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Partial Order Productions / rank
 
Normal rank

Latest revision as of 20:33, 6 July 2024

scientific article
Language Label Description Also known as
English
On Generalized Comparison-Based Sorting Problems
scientific article

    Statements

    On Generalized Comparison-Based Sorting Problems (English)
    0 references
    0 references
    0 references
    13 September 2013
    0 references

    Identifiers