De-amortization of Algorithms
| Title | De-amortization of Algorithms |
| Publication Type | Book Chapters |
| Year of Publication | 1998 |
| Authors | Rao Kosaraju S, Pop M |
| Editor | Hsu W-L, Kao M-Y |
| Book Title | Computing and CombinatoricsComputing and Combinatorics |
| Series Title | Lecture Notes in Computer Science |
| Volume | 1449 |
| Pagination | 4 - 14 |
| Publisher | Springer Berlin / Heidelberg |
| ISBN Number | 978-3-540-64824-6 |
| Abstract | De-amortization aims to convert algorithms with excellent overall speed, f ( n ) for performing n operations, into algorithms that take no more than O ( f ( n )/ n ) steps for each operation. The paper reviews several existing techniques for de-amortization of algorithms. |
| URL | http://dx.doi.org/10.1007/3-540-68535-9_4 |