Parallel matching for ranking all teams in a tournament
From MaRDI portal
Publication:5395362
DOI10.1239/aap/1158685003zbMath1104.68135OpenAlexW2051124513MaRDI QIDQ5395362
Kei Kobayashi, Hideki Kawasaki, Akimichi Takemura
Publication date: 2 November 2006
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1158685003
Analysis of algorithms (68W40) Searching and sorting (68P10) Combinatorial probability (60C05) Parallel algorithms in computer science (68W10) Directed graphs (digraphs), tournaments (05C20) Paired and multiple comparisons; multiple testing (62J15)
Related Items (1)
Cites Work
- Extremes and related properties of random sequences and processes
- Sorting in \(c \log n\) parallel steps
- Parallel matching for ranking all teams in a tournament
- On the Kolmogorov-Smirnov Limit Theorems for Empirical Distributions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Parallel matching for ranking all teams in a tournament
