atkinsonj sackn santoroand strothotte"min-max heaps and generalized priority queues,communications of the acm ( ) - bright"range restricted mergeable priority queues,information processing letters ( ) - brodal"worst-case efficient priority queues,proceedings of the seventh annual acmsiam symposium on discrete algorithms ( ) - brown"implementation and analysis of binomial queue algorithms,siam journal on computing ( ) - carlsson"the deap-- double-ended heap to implement double-ended priority queues,information processing letters ( ) - carlsson and chen"the complexity of heaps,proceedings of the third symposium on discrete algorithms ( ) - carlssonj chenand strothotte" note on the construction of the data structure 'deap',information processing letters ( ) - carlssonj munroand poblete"an implicit binomial queue with constant insertion time,proceedings of first scandinavian workshop on algorithm theory ( ) - chang and due"diamond dequea simple data structure for priority deques,information processing letters ( ) - cheriton and tarjan"finding minimum spanning trees,siam journal on computing ( ) - crane"linear lists and priority queues as balanced binary trees,technical report stan-cs- - computer science departmentstanford universitystanfordcalif ding and weiss"the relaxed min-max heapa mergeable double-ended priority queue,acta informatica ( ) - driscollh gabowr shrairmanand tarjan"relaxed heapsan alternative to fibonacci heaps with applications to parallel computation,communications of the acm ( ) - floyd"algorithm treesort ,communications of the acm ( ) fredmanr sedgewickd sleatorand tarjan"the pairing heapa new form of self-adjusting heap,algorithmica ( ) - fredman and tarjan"fibonacci heaps and their uses in improved network optimization algorithms,journal of the acm ( ) - gonnet and munro"heaps on heaps,siam journal on computing ( ) - hasham and sack"bounds for min-max heaps,bit ( ) - johnson"priority queues with update and finding minimum spanning trees,information processing letters ( ) - khoong and leong"double-ended binomial queues,proceedings of the fourth annual international symposium on algorithms and computation ( ) - knuththe art of computer programmingvol sorting and searching ed addisonwesleyreadingmass lamarca and ladner"the influence of caches on the performance of sorting,proceedings of the eighth annual acm-siam symposium on discrete algorithms ( ) -