Matching Nuts and Bolts in O(n log n) Time

DOI10.1137/S0895480196304982zbMath0911.68069OpenAlexW1981627202MaRDI QIDQ4210209

János Komlós, Yuan Ma

Publication date: 21 September 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480196304982

zbMATH Keywords

sortingmatchingparallel computationselectionrandom graphsAKS sorting algorithmbl 871.68100

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Total orders (06A05) Distributed algorithms (68W15)

Related Items (3)

Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime ⋮ Sorting and Selection with Random Costs ⋮ On Generalized Comparison-Based Sorting Problems

This page was built for publication: Matching Nuts and Bolts in O(n log n) Time