Time parameter and arbitrary deunions in the set union problem

This publication has 15 references indexed in Scilit:

• Making data structures persistent
  Published by Association for Computing Machinery (ACM) ,1986
• The set union problem with backtracking
  Published by Springer Nature ,1986
• On the complexity of unification sequences
  Published by Springer Nature ,1986
• Self-adjusting binary search trees
  Journal of the ACM, 1985
• A data structure for dynamic trees
  Journal of Computer and System Sciences, 1983
• A linear-time algorithm for a special case of disjoint set union
  Published by Association for Computing Machinery (ACM) ,1983
• A new data structure for representing sorted lists
  Acta Informatica, 1982
• Design and Analysis of a Data Structure for Representing Sorted Lists
  SIAM Journal on Computing, 1980
• Preserving order in a forest in less than logarithmic time and linear space
  Information Processing Letters, 1977
• Efficiency of a Good But Not Linear Set Union Algorithm
  Journal of the ACM, 1975