Name
Abstract | ||
|---|---|---|
In the limited workspace model, we consider algorithms whose input resides in read-only memory and that use only a constant or sublinear amount of writable memory to accomplish their task. We survey recent results in computational geometry that fall into this model and that strive to achieve the lowest possible running time. In addition to discussing the state of the art, we give some illustrative examples and mention open problems for further research. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3232679.3232692 | CoRR |
DocType | Volume | Issue |
Journal | abs/1806.05868 | 2 |
ISSN | Citations | PageRank |
ACM SIGACT News, 49(2), June 2018, pp. 77-94 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bahareh Banyassady | 1 | 0 | 0.34 |
| Matias Korman | 2 | 178 | 37.28 |
| Wolfgang Mulzer | 3 | 257 | 36.08 |