1. Pairing heaps: experiments and analysis;Stasko;Commun ACM,1987
2. An empirical analysis of algorithms for constructing a minimum spanning tree;Moret,1991
3. The influence of caches on the performance of heaps;LaMarca;J Exp Algorithmics (JEA),1996
4. A back-to-basics empirical study of priority queues;Larkin,2014
5. The weak-heap family of priority queues in theory and praxis;Edelkamp,2012