A Lower Bound on the Complexity of the Union-Split-Find Problem (Q3832045)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lower Bound on the Complexity of the Union-Split-Find Problem |
scientific article |
Statements
A Lower Bound on the Complexity of the Union-Split-Find Problem (English)
0 references
1988
0 references
complexity
0 references
interval splitting
0 references
priority queue
0 references
union
0 references
lower bound
0 references
pointer machine
0 references
