Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Communications of the ACM
An empirical study of minimal storage sorting
Communications of the ACM
A high-speed sorting procedure
Communications of the ACM
A high-speed sorting procedure
Communications of the ACM
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Implementations of randomized sorting on large parallel machines
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Parallel Scheme Using the Divide-and-Conquer Method
Distributed and Parallel Databases
Load balanced parallel radix sort
ICS '98 Proceedings of the 12th international conference on Supercomputing
Randomized Routing, Selection, and Sorting on the OTIS-Mesh
IEEE Transactions on Parallel and Distributed Systems
Survey on Algorithms 347, 426, and Quicksort
ACM Transactions on Mathematical Software (TOMS)
Remark on “Algorithm 489: The Algorithm SELECT—for Finding the ith Smallest of n Elements [M1]”
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
Implementing Quicksort programs
Communications of the ACM
Some performance tests of “quicksort” and descendants
Communications of the ACM
On the probability distribution of the values of binary trees
Communications of the ACM
Computing in Science and Engineering
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Randomized Sorting Algorithm on the BSP model
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Faster deterministic sorting through better sampling
Theoretical Computer Science
Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design
Journal of Parallel and Distributed Computing
Efficient sample sort and the average case analysis or PEsort
Theoretical Computer Science
Parallel Generation of Binary Search Trees
IEEE Transactions on Computers
Parallel Balancing of Binary Search Trees
IEEE Transactions on Computers
The Analysis and Design of Some New Sorting Machines
IEEE Transactions on Computers
Analysis of combinatory algorithms: a sample of current methodology
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Brief announcement: low depth cache-oblivious sorting
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A guided bibliography to sorting
IBM Systems Journal
Fringe analysis for Extquick: Anin situ distributive external sorting algorithm
Information and Computation
Low depth cache-oblivious algorithms
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Parallel sorting with minimal data
EuroMPI'11 Proceedings of the 18th European MPI Users' Group conference on Recent advances in the message passing interface
Communication and energy efficient routing protocols for single-hop radio networks
Journal of Parallel and Distributed Computing
Average case analysis of java 7's dual pivot quicksort
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Hi-index | 0.06 |
The methods currently in use and previously proposed for the choice of a root in minimal storage tree sorting are in reality methods for making inefficient statistical estimates of the median of the sequence to be sorted. By making efficient use of the information in a random sample chosen during input of the sequence to be sorted, significant improvements over ordinary minimal storage tree sorting can be made.A procedure is proposed which is a generalization of minimal storage tree sorting and which has the following three properties: (a) There is a significant improvement (over ordinary minimal storage tree sorting) in the expected number of comparisons required to sort the input sequence. (b) The procedure is statistically insensitive to bias in the input sequence. (c) The expected number of comparisons required by the procedure approaches (slowly) the information-theoretic lower bound on the number of comparisons required. The procedure is, therefore, “asymptotically optimal.”