Implementing partition on vector computers
ICS '91 Proceedings of the 5th international conference on Supercomputing
An application of the method of Buckets to the selection problem
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Implementation of a portable nested data-parallel language
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Algorithm 616: fast computation of the Hodges-Lehmann location estimator
ACM Transactions on Mathematical Software (TOMS)
Algorithm 346: F-Test Probabilities
Communications of the ACM
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)
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
Communications of the ACM
Syntactic source to source transforms and program manipulation
Communications of the ACM
Expected time bounds for selection
Communications of the ACM
Algorithm 489: the algorithm SELECT—for finding the ith smallest of n elements [M1]
Communications of the ACM
Optimizing binary trees grown with a sorting algorithm
Communications of the ACM
Algorithm 410: Partial sorting
Communications of the ACM
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]
Communications of the ACM
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Genetic Programming and Evolvable Machines
Parallel Implementations of the Selection Problem: A Case Study
International Journal of Parallel Programming
Nordic Journal of Computing
An Efficient Algorithm for the Approximate Median Selection Problem
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Results of Parallel Implementations of the Selection Problem Using Sisal
PACT '93 Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism
Binary search trees and file organization
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks
Computers and Operations Research
A simple expected running time analysis for randomized "divide and conquer" algorithms
Discrete Applied Mathematics
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Tardiness bounds under global EDF scheduling on a multiprocessor
Real-Time Systems
On the adaptiveness of Quicksort
Journal of Experimental Algorithmics (JEA)
Generic discrimination: sorting and paritioning unshared data in linear time
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Average case analysis of java 7's dual pivot quicksort
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 48.34 |