Cover Image

Efficient top-down updates in AVL trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Jugé, Vincent
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Grandchildren-weight-balanced binary search trees
by: Jugé, Vincent
Published: (2024)

Probabilistic AVL Trees (p-AVL): Relaxing Deterministic Balancing
by: Desikan, Hayagriv
Published: (2026)

Comparative Performance of the AVL Tree and Three Variants of the Red-Black Tree
by: Brown, Russell A.
Published: (2024)

Succinct Encodings of Binary Trees with Application to AVL Trees
by: Chizewer, Jeremy, et al.
Published: (2023)

Revisiting the Sparse Matrix Compression Problem
by: Jugé, Vincent, et al.
Published: (2026)

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
by: Cohen-Addad, Vincent, et al.
Published: (2025)

Theoretical insights and an experimental comparison of tango trees and multi-splay trees
by: Al-Adhami, Khaleel, et al.
Published: (2024)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
by: Hochbaum, Dorit S.
Published: (2024)

Solving the all pairs shortest path problem after minor update of a large dense graph
by: Liu, Gangli
Published: (2024)

Realizing temporal transportation trees
by: Mertzios, George B., et al.
Published: (2024)

Nested and outlier embeddings into trees
by: Chawla, Shuchi, et al.
Published: (2026)

Fast decremental tree sums in forests
by: Berendsohn, Benjamin Aram, et al.
Published: (2026)

Optimal bounds on a tree inference algorithm
by: Gardiner, Jack, et al.
Published: (2024)

Median and Small Parsimony Problems on RNA trees
by: Marchand, Bertrand, et al.
Published: (2024)

Spanning tree congestion of proper interval graphs
by: Otachi, Yota
Published: (2026)

Depth first representations of $k^2$-trees
by: Carmona, Gabriel, et al.
Published: (2025)

Composing dynamic programming tree-decomposition-based algorithms
by: Baste, Julien
Published: (2019)

Parallel batch queries on dynamic trees: algorithms and experiments
by: Ikram, Humza, et al.
Published: (2025)

Path Partitions of Phylogenetic Networks
by: Lafond, Manuel, et al.
Published: (2024)

Computational Complexity of the Interval Ordering Problem
by: Pawlowski, Simeon, et al.
Published: (2026)

A computational study of Gomory-Hu construction tree algorithms
by: Kolmogorov, Vladimir
Published: (2022)

Rapid mixing of the down-up walk on matchings of a fixed size
by: Jain, Vishesh, et al.
Published: (2024)

Kd-tree Based Wasserstein Distance Approximation for High-Dimensional Data
by: Teshigawara, Kanata, et al.
Published: (2026)

OrderedCuts: A new approach for computing Gomory-Hu tree
by: Kolmogorov, Vladimir
Published: (2022)

Constant-time edge label and leaf pointer maintenance on sliding suffix trees
by: Leonard, Laurentius, et al.
Published: (2023)

Forcing a unique minimum spanning tree and a unique shortest path
by: Gima, Tatsuya, et al.
Published: (2025)

Identifying bubble-like subgraphs in linear-time via a unified SPQR-tree framework
by: Sena, Francisco, et al.
Published: (2026)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
by: Lokshtanov, Daniel, et al.
Published: (2026)

Exact multiplicative updates for convolutional $β$-NMF in 2D
by: T., Pedro J. Villasana, et al.
Published: (2018)

Efficient parameterized approximation
by: Kratsch, Stefan, et al.
Published: (2025)

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
by: Cohen-Addad, Vincent, et al.
Published: (2022)

A Strong Linear Programming Relaxation for Weighted Tree Augmentation
by: Cohen-Addad, Vincent, et al.
Published: (2026)

An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree
by: Islam, Tariqul, et al.
Published: (2024)

Efficient distributional regression trees learning algorithms for calibrated non-parametric probabilistic forecasts
by: Duchemin, Quentin, et al.
Published: (2025)

Parameterized Complexity of Efficient Sortation
by: Ganian, Robert, et al.
Published: (2024)

Efficient Centroid-Linkage Clustering
by: Bateni, MohammadHossein, et al.
Published: (2024)

Efficient Dynamic Rank Aggregation
by: Alimi, Morteza, et al.
Published: (2025)

Space-Efficient Graph Kernelizations
by: Kammer, Frank, et al.
Published: (2020)

Finding the diameter of a tree with distance queries
by: Gerbner, Dániel, et al.
Published: (2025)

Constructing disjoint Steiner trees in Sierpiński graphs
by: Yang, Chenxu, et al.
Published: (2023)