A sorting problem and its complexity

Authors:
Ira Pohl
Affiliations:
Univ. of California, Santa Cruz, Santa Cruz
Venue:
Communications of the ACM
Year:
1972

Citing 0
Cited 10

Average case selection

Journal of the ACM (JACM)
Selecting the median

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A Counting Approach to Lower Bounds for Selection Problems

Journal of the ACM (JACM)
Min-max sort: a simple sorting method (abstract only)

CSC '87 Proceedings of the 15th annual conference on Computer Science
An asymptotic theory for recurrence relations based on minimization and maximization

Theoretical Computer Science
Space-time tradeoffs and first order problems in a model of programs

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Average case selection

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Finding the maximum and minimum elements with one lie

Discrete Applied Mathematics
Towards optimal multiple selection

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Minimum and maximum against k lies

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	48.22

Visualization

Abstract

A technique for proving min-max norms of sorting algorithms is given. One new algorithm for finding the minimum and maximum elements of a set with fewest comparisons is proved optimal with this technique.