Author:
Edelkamp Stefan,Elmasry Amr,Katajainen Jyrki
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference37 articles.
1. Cache-aware and cache-oblivious adaptive sorting;Brodal,2005
2. On the adaptiveness of quicksort;Brodal;ACM Journal of Experimental Algorithmics,2008
3. Implementation and analysis of binomial queue algorithms;Brown;SIAM Journal on Computing,1978
4. Policy-based benchmarking of weak heaps and their relatives;Bruun,2010
5. Shortest paths algorithms: Theory and experimental evaluation;Cherkassky;Mathematical Programming,1996
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. JHeaps: An open-source library of priority queues;SoftwareX;2021-12
2. Regular numeral systems for data structures;Acta Informatica;2021-07-25
3. Lazy Search Trees;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
4. Bipartite binomial heaps;RAIRO - Theoretical Informatics and Applications;2017-07
5. Optimizing Binary Heaps;Theory of Computing Systems;2017-04-21