Data structures and network algorithms
Data structures and network algorithms
The pairing heap: a new form of self-adjusting heap
Algorithmica
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
An implicit binomial queue with constant insertion time
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Handbook of theoretical computer science (vol. A)
Persistent lists with catenation via recursive slow-down
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A data structure for manipulating priority queues
Communications of the ACM
Communications of the ACM
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A Generalization of Binomial Queues
A Generalization of Binomial Queues
Purely functional representations of catenable sorted lists
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Buckets, heaps, lists, and monotone priority queues
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
Meldable heaps and boolean union-find
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Parallel Priority Data Structure with Applications
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths
ISAAC '01 Proceedings of the 12th 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
Information Processing Letters
Meldable RAM priority queues and minimum directed spanning trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Black box for constant-time insertion in priority queues (note)
ACM Transactions on Algorithms (TALG)
On the power of structural violations in priority queues
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
ACM Transactions on Algorithms (TALG)
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Maintaining arrays of contiguous objects
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
The violation heap: a relaxed Fibonacci-like heap
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Efficient CCG parsing: A* versus adaptive supertagging
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Policy-based benchmarking of weak heaps and their relatives,
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A proposal to detect errors in Enterprise Application Integration solutions
Journal of Systems and Software
Strictly-Regular number system and data structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Fat heaps without regular counters
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Direct graph k-partitioning with a Kernighan-Lin like heuristic
Operations Research Letters
SIAM Journal on Computing
Determining the relative accuracy of attributes
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |