Amortized complexity of bulk updates in AVL-trees

DOI10.1007/3-540-45471-3_45MaRDI QIDQ3046521zbMATH OpenOpenAlexFDO

Authors Eljas Soisalon-Soininen, Peter Widmayer

Publication date 12 August 2004

Published in Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45471-3_45

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An Amortized Analysis of Insertions into AVL-Trees
• Single and bulk updates in stratified trees: An amortized and worst-case analysis
• scientific article; zbMATH DE number 3928331
• Deletion without rebalancing in balanced binary trees
• Deletion without rebalancing in binary search trees

Cited in

(2)

• An Amortized Analysis of Insertions into AVL-Trees
• Single and bulk updates in stratified trees: An amortized and worst-case analysis

This page was built for publication: Amortized complexity of bulk updates in AVL-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046521)