Purely functional representations of catenable sorted lists
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Worst-case efficient priority queues
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Correspondence-based data structures for double-ended priority queues
Journal of Experimental Algorithmics (JEA)
Meldable heaps and boolean union-find
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
The randomized complexity of maintaining the minimum
Nordic Journal of Computing
Information Processing Letters
Multidimensional heaps and complementary range searching
Information Processing Letters
ACM Transactions on Algorithms (TALG)
Strictly-Regular number system and data structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
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
Hi-index | 0.00 |