Name
Abstract | ||
|---|---|---|
This paper gives a new deamortized solution to the sequential-file-maintenance problem. The data structure uses several new tools for solving this historically complicated problem. These tools include an unbalanced ternary-tree layout embedded in the sparse table, one-way rebalancing, and extra structural properties to keep interaction among rebalances to a minimum. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.5555/3039686.3039784 | SODA |
Field | DocType | ISBN |
Discrete mathematics,Data mining,Data structure,Online algorithm,Computer science,Theoretical computer science,Competitive analysis | Conference | 978-1-61197-503-1 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael A. Bender | 1 | 2144 | 138.24 |
| Jeremy T. Fineman | 2 | 587 | 36.10 |
| Seth Gilbert | 3 | 1413 | 94.72 |
| tsvi kopelowitz | 4 | 233 | 26.01 |
| pablo montes | 5 | 42 | 2.94 |