Implementation and Analysis of Binomial Queue Algorithms

This publication has 9 references indexed in Scilit:

• A trivial algorithm whose analysis isn't
  Journal of Computer and System Sciences, 1978
• A data structure for manipulating priority queues
  Communications of the ACM, 1978
• Deletions That Preserve Randomness
  IEEE Transactions on Software Engineering, 1977
• Finding Minimum Spanning Trees
  SIAM Journal on Computing, 1976
• The First Digit Problem
  The American Mathematical Monthly, 1976
• Random insertion into a priority queue structure
  IEEE Transactions on Software Engineering, 1975
• The Number of 1’s in Binary Integers: Bounds and Extremal Properties
  SIAM Journal on Computing, 1974
• Efficiency of Equivalence Algorithms
  Published by Springer Nature ,1972
• Computational Complexity of Partitioned List Algorithms
  IEEE Transactions on Computers, 1970