On partial sorting in restricted rounds (Q2013879): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Selecting the top three elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the maximum and minimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified implementation of the least squares solution for pairwise comparisons matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the Ford-Johnson algorithm that is more space efficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possible and Necessary Winners of Partial Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending partial tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pairwise comparison matrices that can be made consistent by the modification of a few elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal completion of incomplete pairwise comparison matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Significant improvements to the Ford-Johnson algorithm for sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking by pairwise comparisons for Swiss-system tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ranking of a Swiss system chess team tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lower Bounds for Selecting the Median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting the Median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Errata to ``Selecting the top three elements'' by M. Aigner: A result of a computer-assisted proof search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tournament Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4269428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Sorting with Constant Time for Comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3631212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of complete interval tournaments. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2935522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2898817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2834258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5167455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On qualitatively consistent, transitive and contradictory judgment matrices emerging from multiattribute decision procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-based graph construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Lower Bound for Selection and Set Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ford-Johnson Sorting Algorithm Is Not Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Significant Improvements to the Hwang-Lin Merging Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5693251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Matching in Chess Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ford-Johnson algorithm still unbeaten for less than 47 elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5167098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting and Selecting in Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4914904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sorting problem and its complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the median / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the systems of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Average-Case Complexity of Selecting the <i>k</i>th Best / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds for selection / rank
 
Normal rank

Latest revision as of 05:24, 14 July 2024

scientific article
Language Label Description Also known as
English
On partial sorting in restricted rounds
scientific article

    Statements

    On partial sorting in restricted rounds (English)
    0 references
    0 references
    0 references
    9 August 2017
    0 references
    partial sorting
    0 references
    parallel sorting
    0 references
    tournament
    0 references
    pairing algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers