Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with amortized time:
TR95-062 | 14th December 1995
Amir M. Ben-Amram, Zvi Galil

On Data Structure Tradeoffs and an Application to Union-Find

Comments: 1

Consider a problem involving updates and queries of a data structure.
Assume that there exists a family of algorithms which exhibit a
tradeoff between query and update time. We demonstrate a general
technique of constructing from such a family
a single algorithm with best amortized time. We indicate some ... more >>>

ISSN 1433-8092 | Imprint