Faster deterministic sorting through better sampling.

DOI10.1016/S0304-3975(02)00321-3MaRDI QIDQ1401197zbMATH OpenFDO

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

Recommendations

• scientific article; zbMATH DE number 1760032
• Parallel sorting by regular sampling
• Improved deterministic parallel integer sorting
• Optimal sampling strategies for quicksort
• scientific article; zbMATH DE number 1857637

Cites work

• scientific article; zbMATH DE number 1003300 (Why is no real title available?)
• scientific article; zbMATH DE number 1760032 (Why is no real title available?)
• scientific article; zbMATH DE number 1760033 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A Scheme for Fast Parallel Communication
• A guided tour of Chernoff bounds
• A parallel median algorithm
• Probabilistic Parallel Algorithms for Sorting and Selection
• Randomized multipacket routing and sorting on meshes
• Row-Major Sorting on Meshes
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
• Sorting-based selection algorithms for hypercubic networks
• Tight Bounds on the Complexity of Parallel Sorting

Cited in

(2)

• scientific article; zbMATH DE number 1857637 (Why is no real title available?)
• scientific article; zbMATH DE number 1760032 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401197)