Self-timing programs and the quantum scheduler
Communications of the ACM
Animating algorithms with XTANGO
ACM SIGACT News
Do algorithm animations assist learning?: an empirical study and analysis
CHI '93 Proceedings of the INTERACT '93 and CHI '93 Conference on Human Factors in Computing Systems
Pairing heaps: experiments and analysis
Communications of the ACM
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Information theoretic implications for pairing heaps
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
GMSim: a tool for compositional GSMP modeling
Proceedings of the 30th conference on Winter simulation
Weight-biased leftist trees and modified skip lists
Journal of Experimental Algorithmics (JEA)
Worst-case efficient priority queues
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On the efficiency of pairing heaps and related data structures
Journal of the ACM (JACM)
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Correspondence-based data structures for double-ended priority queues
Journal of Experimental Algorithmics (JEA)
Implementing weighted b-matching algorithms: insights from a computational study
Journal of Experimental Algorithmics (JEA)
Improved Upper Bounds for Pairing Heaps
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Randomized Meldable Priority Queues
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
The number of tests required to search an unordered table
Information Processing Letters
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Parameterized self-adjusting heaps
Journal of Algorithms
Towards a Final Analysis of Pairing Heaps
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Complexity O(1) priority queue for event driven molecular dynamics simulations
Journal of Computational Physics
Profiles of random trees: Plane-oriented recursive trees
Random Structures & Algorithms
ACM Transactions on Algorithms (TALG)
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Near-optimal dynamic replication in unstructured peer-to-peer networks
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Algorithms (TALG)
Pairing heaps with O(log log n) decrease cost
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Flat combining and the synchronization-parallelism tradeoff
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Deletion without rebalancing in balanced binary trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Pairing heaps with costless meld
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
The violation heap: a relaxed Fibonacci-like heap
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
On the matter of dynamic optimality in an extended model for tree access operations
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Policy-based benchmarking of weak heaps and their relatives,
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
The complexity of implicit and space efficient priority queues
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A unifying property for distribution-sensitive priority queues
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Research paper: The saga of minimum spanning trees
Computer Science Review
SIAM Journal on Computing
A priority queue with the time-finger property
Journal of Discrete Algorithms
The weak-heap data structure: Variants and applications
Journal of Discrete Algorithms
Growing neural gas efficiently
Neurocomputing
The weak-heap family of priority queues in theory and praxis
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
| Hi-index | 0.04 |