Theoremadvanced
Driscoll-Sarnak-Sleator-Tarjan persistence theorem
Also called DSST theorem, node-copying theorem, full persistence theorem.
Any pointer data structure with bounded in-degree can be made fully persistent with O(1) amortized overhead per update.
Any pointer data structure with bounded in-degree can be made fully persistent with O(1) amortized overhead per update.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag KP38B4 Edit this page History Report an error