Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the intricacies of write-efficient updates for AVL trees in this 51-minute lecture by Vincent Jugé from Université Gustave Eiffel, presented at the International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2025) at the Fields Institute. Scheduled for May 8, 2025, this talk delves into advanced techniques for optimizing write operations in AVL tree implementations, a crucial aspect for improving performance in modern data structures. Learn about cutting-edge research that balances the theoretical foundations of self-balancing binary search trees with practical implementation considerations for minimizing write operations.
