On partial sorting in restricted rounds

DOI10.1515/AUSI-2017-0002zbMATH Open1368.05145OpenAlexW2740888172MaRDI QIDQ2013879FDOQ2013879

Authors: 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

Recommendations

• A new algorithm for ranking players of a round-robin tournament
• Hypercubic Sorting Networks
• A tournament problem
• An improved MST algorithm for ranking players of a round-robin tournament
• scientific article; zbMATH DE number 867665

zbMATH Keywords

tournamentparallel sortingpartial sortingpairing algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Introduction to algorithms.
• On optimal completion of incomplete pairwise comparison matrices
• Title not available (Why is that?)
• The structure and dynamics of networks
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Degree sequences of multigraphs
• Sorting in \(c \log n\) parallel steps
• Time bounds for selection
• 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
• Title not available (Why is that?)
• On lower bounds for selecting the median
• On Erdös-Gallai and Havel-Hakimi algorithms
• Average case selection
• Degree-based graph construction
• Deciding football sequences
• Reconstruction of complete interval tournaments. II
• Reconstruction of complete interval tournaments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding the median
• Sorting and Selecting in Rounds
• Parallel sorting
• Parallel Sorting with Constant Time for Comparisons
• A Unified Lower Bound for Selection and Set Partitioning Problems
• Finding the maximum and minimum
• A sorting problem and its complexity
• The Ford-Johnson Sorting Algorithm Is Not Optimal
• Title not available (Why is that?)
• A Tournament Problem
• 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
• Title not available (Why is that?)
• Selecting the Median
• Selecting the top three elements
• Significant improvements to the Ford-Johnson algorithm for sorting
• Significant Improvements to the Hwang-Lin Merging Algorithm
• New upper bounds for selection
• Title not available (Why is that?)
• Errata to ``Selecting the top three elements by M. Aigner: A result of a computer-assisted proof search
• The double selection problem
• Title not available (Why is that?)
• Parallel enumeration of degree sequences
• Weighted Matching in Chess Tournaments
• Possible and Necessary Winners of Partial Tournaments
• On the ranking of a Swiss system chess team tournament
• Closing a long-standing complexity gap for selection: \(V _{3}(42) = 50\)
• On the Average-Case Complexity of Selecting the kth Best
• Minimal digraphs with given imbalance sequence
• Towards optimal sorting of 16 elements
• On the systems of tournaments

Cited In (3)

• Title not available (Why is that?)
• Sorting under partial information (without the ellipsoid algorithm)
• Sorting with forbidden intermediates

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)