Journal of the ACM (JACM)
Implementing partition on vector computers
ICS '91 Proceedings of the 5th international conference on Supercomputing
A simpler analysis of algorithm 65 (find)
ACM SIGACT News
Critical slicing for software fault localization
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Communications of the ACM
Modeling high-dimensional index structures using sampling
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Improved master theorems for divide-and-conquer recurrences
Journal of the ACM (JACM)
Performance engineering case study: heap construction
Journal of Experimental Algorithmics (JEA)
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Social processes and proofs of theorems and programs
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Parallel Implementations of the Selection Problem: A Case Study
International Journal of Parallel Programming
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
An Improvement on Tree Selection Sort
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Performance Engineering Case Study: Heap Construction
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Combining Generic and Domain Specific Reasoning by Using Contexts
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
An evaluation of required element testing strategies
ICSE '84 Proceedings of the 7th international conference on Software engineering
Linear time bounds for median computations
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
SELECT—a formal system for testing and debugging programs by symbolic execution
Proceedings of the international conference on Reliable software
Proceedings of the international conference on Reliable software
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The Early Search for Tractable Ways of Reasoning about Programs
IEEE Annals of the History of Computing
Analysis of multiple quickselect variants
Theoretical Computer Science
Quickselect and the Dickman Function
Combinatorics, Probability and Computing
Adaptive sampling for quickselect
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The roots of structured programming
SIGCSE '78 Papers of the SIGCSE/CSA technical symposium on Computer science education
Fast computation of database operations using graphics processors
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient relational database management using graphics processors
DaMoN '05 Proceedings of the 1st international workshop on Data management on new hardware
On Floyd and Rivest's SELECT algorithm
Theoretical Computer Science
On quickselect, partial sorting and multiple quickselect
Information Processing Letters
An integrated efficient solution for computing frequent and top-k elements in data streams
ACM Transactions on Database Systems (TODS)
Probabilistic analysis of algorithms for the Dutch national flag problem
Theoretical Computer Science
Fast computation of database operations using graphics processors
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Formal proof of a program: Find
Science of Computer Programming
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry: Theory and Applications
Randomized algorithm for the sum selection problem
Theoretical Computer Science
Rk-hist: an r-tree based histogram for multi-dimensional selectivity estimation
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
High-performance priority queues for parallel crawlers
Proceedings of the 10th ACM workshop on Web information and data management
A summary of progress toward proving program correctness
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Note: Moves and displacements of particular elements in Quicksort
Theoretical Computer Science
Modular Verification of Recursive Programs
Languages: From Formal to Natural
On Smoothed Analysis of Quicksort and Hoare's Find
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Optimal Randomized Algorithm for the Density Selection Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Distributional analysis of swaps in Quick Select
Theoretical Computer Science
Adaptive sampling strategies for quickselects
ACM Transactions on Algorithms (TALG)
Journal of Computing Sciences in Colleges
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Better size estimation for sparse matrix products
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
An Efficient Algorithm for Partial Order Production
SIAM Journal on Computing
Versatile probability-based indexing for approximate similarity search
Proceedings of the Fourth International Conference on SImilarity Search and APplications
The analysis of Range Quickselect and related problems
Theoretical Computer Science
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
Towards optimal multiple selection
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Rank selection in multidimensional data
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Efficient computation of frequent and top-k elements in data streams
ICDT'05 Proceedings of the 10th international conference on Database Theory
Research paper: The saga of minimum spanning trees
Computer Science Review
Fast k-selection algorithms for graphics processing units
Journal of Experimental Algorithmics (JEA)
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
Practically efficient multi-party sorting protocols from comparison sort algorithms
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Elicitation and approximately stable matching with partial preferences
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 48.24 |