Min-max heaps and generalized priority queues
Communications of the ACM
IEEE Transactions on Software Engineering
Minimal space, average linear time duplicate deletion
Communications of the ACM
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Teaching the analysis of algorithms with visual proofs
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Efficient co-triangulation of large data sets
Proceedings of the conference on Visualization '98
Worst-case efficient priority queues
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The influence of caches on the performance of sorting
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters
Journal of the ACM (JACM)
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
External Hashing Schemes for Collections of Data Structures
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
Best sorting algorithm for nearly sorted lists
Communications of the ACM
A data structure for manipulating priority queues
Communications of the ACM
Proof techniques for hierarchically structured programs
Communications of the ACM
Some performance tests of “quicksort” and descendants
Communications of the ACM
Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certification
Communications of the ACM
Comment on London's certification of algorithms 245
Communications of the ACM
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Performance engineering case study: heap construction
Journal of Experimental Algorithmics (JEA)
Sorting sequential files with limited auxiliary storage
ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
ACM '72 Proceedings of the ACM annual conference - Volume 1
A note on constructing binary heaps with periodic networks
Information Processing Letters
Nordic Journal of Computing
Fast In-Place Verification of Data Dependencies
IEEE Transactions on Knowledge and Data Engineering
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the Performance of WEAK-HEAPSORT
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Structure and Constraints in Interactive Exploratory Algorithm Learning
Revised Lectures on Software Visualization, International Seminar
Theoretical Computer Science - Algorithms,automata, complexity and games
A methodology for verifying programs
Proceedings of the international conference on Reliable software
Some transformations for developing recursive programs
Proceedings of the international conference on Reliable software
Verifying programs by algebraic and logical reduction
Proceedings of the international conference on Reliable software
Towards a canonical form for computer programs
ACM '75 Proceedings of the 1975 annual conference
IEEE Annals of the History of Computing
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Implicit B-trees: a new data structure for the dictionary problem
Journal of Computer and System Sciences - Special issue on FOCS 2002
Lower and upper bounds on obtaining history independence
Information and Computation
Filter ranking in high-dimensional space
Data & Knowledge Engineering
An in-place algorithm for Klee's measure problem in two dimensions
Information Processing Letters
Efficient algorithms for finding sills in digital topographic maps
Computers & Geosciences
Generalized structured programs and loop trees
Science of Computer Programming
Line-segment intersection made in-place
Computational Geometry: Theory and Applications
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
A Simple Hardware Buddy System Memory Allocator
IEEE Transactions on Computers
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
On the adaptiveness of Quicksort
Journal of Experimental Algorithmics (JEA)
Snakes and ladders: patterns in Heapsort
Journal of Computing Sciences in Colleges
Information and Computation
Lower and upper bounds on obtaining history independence
Information and Computation
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Optimal cache-oblivious implicit dictionaries
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Sorting algorithms as special cases of a priority queue sort
Proceedings of the 42nd ACM technical symposium on Computer science education
A key-address mapping sort algorithm
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
In-Place algorithms for computing (layers of) maxima
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Line-segment intersection made in-place
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Tradeoffs between branch mispredictions and comparisons for sorting algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Lean programs, branch mispredictions, and sorting
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
In-place heap construction with optimized comparisons, moves, and cache misses
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Elementary Yet Precise Worst-Case Analysis of Floyd's Heap-Construction Program
Fundamenta Informaticae
A statistical approach to the relative performance analysis of sorting algorithms
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Journal of Discrete Algorithms
| Hi-index | 48.35 |