Faster deterministic sorting through better sampling.

DOI10.1016/S0304-3975(02)00321-3zbMath1044.68035MaRDI QIDQ1401197

Jop F. Sibeyn

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

external memorysample-sort algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized multipacket routing and sorting on meshes
• A guided tour of Chernoff bounds
• A parallel median algorithm
• Sorting-based selection algorithms for hypercubic networks
• Tight Bounds on the Complexity of Parallel Sorting
• Probabilistic Parallel Algorithms for Sorting and Selection
• A Scheme for Fast Parallel Communication
• Row-Major Sorting on Meshes
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Faster deterministic sorting through better sampling.