Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

DOI10.1145/321592.321600zbMath0205.19202DBLPjournals/jacm/FrazerM70OpenAlexW2041097097WikidataQ56679548 ScholiaQ56679548MaRDI QIDQ5604915

Archie C. McKellar, W. Donald Frazer

Publication date: 1970

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321592.321600

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Related Items (22)

DUAL PIVOT QUICKSORT ⋮ Direct bulk-synchronous parallel algorithms ⋮ Fringe analysis for extquick: An in situ distributive external sorting algorithm ⋮ Efficient sample sort and the average case analysis of PEsort ⋮ A randomized sorting algorithm on the BSP model ⋮ Faster deterministic sorting through better sampling. ⋮ Optimal sampling strategies for quicksort ⋮ Communication and energy efficient routing protocols for single-hop radio networks ⋮ Implementation of samplesort: A minimal storage tree sort ⋮ An adaptive generic sorting algorithm that uses variable partitioning^∗ ⋮ Range partitioning within sublinear time: algorithms and lower bounds ⋮ Massively Parallel Simulations of Binary Black Hole Intermediate-Mass-Ratio Inspirals ⋮ Engineering parallel string sorting ⋮ RANDOMIZED SORTING ON THE POPS NETWORK ⋮ A limit theorem for “quicksort” ⋮ The analysis of Quicksort programs ⋮ Recursive samplesort ⋮ Range partitioning within sublinear time in the external memory model ⋮ Recognizing the tractability in big data computing ⋮ Bounds on algorithms for string generation ⋮ In-Place Parallel Super Scalar Samplesort (IPSSSSo) ⋮ Sublinear-time reductions for big data computing

This page was built for publication: Samplesort: A Sampling Approach to Minimal Storage Tree Sorting