Worst-case Analysis of Set Union Algorithms (Q3769963)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Worst-case Analysis of Set Union Algorithms |
scientific article; zbMATH DE number 4028899
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-case Analysis of Set Union Algorithms |
scientific article; zbMATH DE number 4028899 |
Statements
Worst-case Analysis of Set Union Algorithms (English)
0 references
1984
0 references
equivalence algorithm
0 references
set union
0 references
inverse Ackermann function
0 references
asymptotic worst-case running time
0 references
path compression
0 references
0.8750305771827698
0 references
0.8331476449966431
0 references
0.8319606184959412
0 references
0.8260916471481323
0 references
