A priority queue in which initialization and queue operations takeO(loglogD) time

This publication has 7 references indexed in Scilit:

• Implementation and Analysis of Binomial Queue Algorithms
  SIAM Journal on Computing, 1978
• Preserving order in a forest in less than logarithmic time and linear space
  Information Processing Letters, 1977
• Efficient Algorithms for Shortest Paths in Sparse Networks
  Journal of the ACM, 1977
• Design and implementation of an efficient priority queue
  Theory of Computing Systems, 1976
• Analysis of an algorithm for priority queue administration
  BIT Numerical Mathematics, 1975
• Priority queues with update and finding minimum spanning trees
  Information Processing Letters, 1975
• Preserving order in a forest in less than logarithmic time
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1975