Getting back to the past in the union-find problem

This publication has 13 references indexed in Scilit:

• On the single-operation worst-case time complexity of the disjoint set union problem
  Published by Springer Nature ,2005
• The set union problem with backtracking
  Published by Springer Nature ,1986
• On the complexity of unification sequences
  Published by Springer Nature ,1986
• Amortized Computational Complexity
  SIAM Journal on Algebraic Discrete Methods, 1985
• A linear-time algorithm for a special case of disjoint set union
  Published by Association for Computing Machinery (ACM) ,1983
• A class of algorithms which require nonlinear time to maintain disjoint sets
  Journal of Computer and System Sciences, 1979
• Efficiency of a Good But Not Linear Set Union Algorithm
  Journal of the ACM, 1975
• Set Merging Algorithms
  SIAM Journal on Computing, 1973
• Binary Search Trees of Bounded Balance
  SIAM Journal on Computing, 1973
• Organization and maintenance of large ordered indexes
  Acta Informatica, 1972