Self-adjusting binary search trees
Journal of the ACM (JACM)
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
Concurrent operations on priority queues
Communications of the ACM
A hierarchical single-key-lock access control using the Chinese remainder theorem
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Fishspear: a priority queue algorithm
Journal of the ACM (JACM)
GTW: a time warp system for shared memory multiprocessors
WSC '94 Proceedings of the 26th conference on Winter simulation
A comparative study of parallel and sequential priority queue algorithms
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Weight-biased leftist trees and modified skip lists
Journal of Experimental Algorithmics (JEA)
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 2
Efficient Execution of Time Warp Programs on Heterogeneous, NOW Platforms
IEEE Transactions on Parallel and Distributed Systems
Priority Queues and Sorting Methods for Parallel Simulation
IEEE Transactions on Software Engineering
Correspondence-based data structures for double-ended priority queues
Journal of Experimental Algorithmics (JEA)
Optimizing static calendar queues
ACM Transactions on Modeling and Computer Simulation (TOMACS)
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
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
Maintaining a Minimum Spanning Tree Under Transient Node Failures
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Parameterized self-adjusting heaps
Journal of Algorithms
Broad-phase collision detection using semi-adjusting BSP-trees
Proceedings of the 2005 symposium on Interactive 3D graphics and games
Twol-amalgamated priority queues
Journal of Experimental Algorithmics (JEA)
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
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
Pairing heaps with costless meld
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Automatic fine-grain locking using shape properties
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A linear time algorithm for the k maximal sums problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.05 |