On partial sorting in restricted rounds
From MaRDI portal
Publication:2013879
DOI10.1515/ausi-2017-0002zbMath1368.05145OpenAlexW2740888172MaRDI QIDQ2013879
Antal Iványi, Norbert Fogarasi
Publication date: 9 August 2017
Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/ausi-2017-0002
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ranking by pairwise comparisons for Swiss-system tournaments
- A simplified implementation of the least squares solution for pairwise comparisons matrices
- On pairwise comparison matrices that can be made consistent by the modification of a few elements
- On qualitatively consistent, transitive and contradictory judgment matrices emerging from multiattribute decision procedures
- On optimal completion of incomplete pairwise comparison matrices
- Finding the maximum and minimum
- The Ford-Johnson algorithm still unbeaten for less than 47 elements
- A variant of the Ford-Johnson algorithm that is more space efficient
- Extending partial tournaments
- Sorting in \(c \log n\) parallel steps
- Significant improvements to the Ford-Johnson algorithm for sorting
- Selecting the top three elements
- Errata to ``Selecting the top three elements by M. Aigner: A result of a computer-assisted proof search
- Finding the median
- The double selection problem
- Time bounds for selection
- Parallel sorting
- On the ranking of a Swiss system chess team tournament
- On Lower Bounds for Selecting the Median
- Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50
- Possible and Necessary Winners of Partial Tournaments
- Weighted Matching in Chess Tournaments
- Reconstruction of complete interval tournaments. II
- Degree-based graph construction
- Sorting and Selecting in Rounds
- Average case selection
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- A Unified Lower Bound for Selection and Set Partitioning Problems
- Parallel Sorting with Constant Time for Comparisons
- On the Average-Case Complexity of Selecting the kth Best
- New upper bounds for selection
- Significant Improvements to the Hwang-Lin Merging Algorithm
- The Ford-Johnson Sorting Algorithm Is Not Optimal
- Selecting the Median
- A sorting problem and its complexity
- On the systems of tournaments
- A Tournament Problem
This page was built for publication: On partial sorting in restricted rounds
