On partial sorting in restricted rounds
From MaRDI portal
Publication:2013879
Recommendations
Cites work
- scientific article; zbMATH DE number 3861164 (Why is no real title available?)
- scientific article; zbMATH DE number 3928360 (Why is no real title available?)
- scientific article; zbMATH DE number 1228439 (Why is no real title available?)
- scientific article; zbMATH DE number 1355273 (Why is no real title available?)
- scientific article; zbMATH DE number 1033192 (Why is no real title available?)
- scientific article; zbMATH DE number 1156582 (Why is no real title available?)
- scientific article; zbMATH DE number 3342853 (Why is no real title available?)
- scientific article; zbMATH DE number 2207482 (Why is no real title available?)
- A Tournament Problem
- A Unified Lower Bound for Selection and Set Partitioning Problems
- A simplified implementation of the least squares solution for pairwise comparisons matrices
- A sorting problem and its complexity
- A variant of the Ford-Johnson algorithm that is more space efficient
- Average case selection
- Closing a long-standing complexity gap for selection: \(V _{3}(42) = 50\)
- Deciding football sequences
- Degree sequences of multigraphs
- Degree-based graph construction
- Errata to ``Selecting the top three elements by M. Aigner: A result of a computer-assisted proof search
- Extending partial tournaments
- Finding the maximum and minimum
- Finding the median
- Introduction to algorithms.
- Minimal digraphs with given imbalance sequence
- New upper bounds for selection
- On Erdös-Gallai and Havel-Hakimi algorithms
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On lower bounds for selecting the median
- On optimal completion of incomplete pairwise comparison 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 the Average-Case Complexity of Selecting the kth Best
- On the ranking of a Swiss system chess team tournament
- On the systems of tournaments
- Parallel Sorting with Constant Time for Comparisons
- Parallel enumeration of degree sequences
- Parallel sorting
- Possible and necessary winners of partial tournaments
- Ranking by pairwise comparisons for Swiss-system tournaments
- Reconstruction of complete interval tournaments
- Reconstruction of complete interval tournaments. II
- Selecting the Median
- Selecting the top three elements
- Significant Improvements to the Hwang-Lin Merging Algorithm
- Significant improvements to the Ford-Johnson algorithm for sorting
- Sorting and Selecting in Rounds
- Sorting in \(c \log n\) parallel steps
- The Ford-Johnson Sorting Algorithm Is Not Optimal
- The Ford-Johnson algorithm still unbeaten for less than 47 elements
- The double selection problem
- The structure and dynamics of networks
- Time bounds for selection
- Towards optimal sorting of 16 elements
- Weighted Matching in Chess Tournaments
This page was built for publication: On partial sorting in restricted rounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013879)
