@inbook {16255,
	title = {De-amortization of Algorithms},
	booktitle = {Computing and CombinatoricsComputing and Combinatorics},
	series = {Lecture Notes in Computer Science},
	volume = {1449},
	year = {1998},
	month = {1998///},
	pages = {4 - 14},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	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.},
	isbn = {978-3-540-64824-6},
	url = {http://dx.doi.org/10.1007/3-540-68535-9_4},
	author = {Rao Kosaraju,S. and Pop, Mihai},
	editor = {Hsu,Wen-Lian and Kao,Ming-Yang}
}
