%0 Book Section %B Computing and CombinatoricsComputing and Combinatorics %D 1998 %T De-amortization of Algorithms %A Rao Kosaraju,S. %A Pop, Mihai %E Hsu,Wen-Lian %E Kao,Ming-Yang %X 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. %B Computing and CombinatoricsComputing and Combinatorics %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 1449 %P 4 - 14 %8 1998/// %@ 978-3-540-64824-6 %G eng %U http://dx.doi.org/10.1007/3-540-68535-9_4