Worst-case Analysis of Set Union Algorithms (Q3769963): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/jacm/TarjanL84, #quickstatements; #temporary_batch_1731530891435 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/62.2160 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044146725 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jacm/TarjanL84 / rank | |||
Normal rank | |||
Latest revision as of 22:26, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case Analysis of Set Union Algorithms |
scientific article |
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
