A Pragmatic Implemention of Monotone Priority QueuesArne

[1]  E. Denardo,et al.  Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[2]  Rajeev Raman,et al.  Priority Queues: Small, Monotone and Trans-dichotomous , 1996, ESA.

[3]  Mikkel Thorup,et al.  On RAM priority queues , 1996, SODA '96.

[4]  Jon Louis Bentley,et al.  Engineering a sort function , 1993, Softw. Pract. Exp..

[5]  Arne Andersson,et al.  Sublogarithmic searching without multiplications , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[6]  Andrew V. Goldberg,et al.  Buckets, heaps, lists, and monotone priority queues , 1997, SODA '97.

[7]  Keith Bostic,et al.  Engineering Radix Sort , 1993, Comput. Syst..

[8]  Rajeev Raman,et al.  Sorting in linear time? , 1995, STOC '95.