A lower bound for the complexity of the union-split-find problem

• Authors:

• K. Mehlhorn;S. Näher;H. Alt

• Affiliations:

• -;-;-

• Venue:
• 14th International Colloquium on Automata, languages and programming
• Year:
• 1987