Image de couverture de livre

Efficient top-down updates in AVL trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Jugé, Vincent
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Grandchildren-weight-balanced binary search trees
par: Jugé, Vincent
Publié: (2024)

Probabilistic AVL Trees (p-AVL): Relaxing Deterministic Balancing
par: Desikan, Hayagriv
Publié: (2026)

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

Succinct Encodings of Binary Trees with Application to AVL Trees
par: Chizewer, Jeremy, et autres
Publié: (2023)

Revisiting the Sparse Matrix Compression Problem
par: Jugé, Vincent, et autres
Publié: (2026)

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Theoretical insights and an experimental comparison of tango trees and multi-splay trees
par: Al-Adhami, Khaleel, et autres
Publié: (2024)

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

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

Realizing temporal transportation trees
par: Mertzios, George B., et autres
Publié: (2024)

Nested and outlier embeddings into trees
par: Chawla, Shuchi, et autres
Publié: (2026)

Fast decremental tree sums in forests
par: Berendsohn, Benjamin Aram, et autres
Publié: (2026)

Optimal bounds on a tree inference algorithm
par: Gardiner, Jack, et autres
Publié: (2024)

Median and Small Parsimony Problems on RNA trees
par: Marchand, Bertrand, et autres
Publié: (2024)

Spanning tree congestion of proper interval graphs
par: Otachi, Yota
Publié: (2026)

Depth first representations of $k^2$-trees
par: Carmona, Gabriel, et autres
Publié: (2025)

Composing dynamic programming tree-decomposition-based algorithms
par: Baste, Julien
Publié: (2019)

Parallel batch queries on dynamic trees: algorithms and experiments
par: Ikram, Humza, et autres
Publié: (2025)

Path Partitions of Phylogenetic Networks
par: Lafond, Manuel, et autres
Publié: (2024)

Computational Complexity of the Interval Ordering Problem
par: Pawlowski, Simeon, et autres
Publié: (2026)

A computational study of Gomory-Hu construction tree algorithms
par: Kolmogorov, Vladimir
Publié: (2022)

Rapid mixing of the down-up walk on matchings of a fixed size
par: Jain, Vishesh, et autres
Publié: (2024)

Kd-tree Based Wasserstein Distance Approximation for High-Dimensional Data
par: Teshigawara, Kanata, et autres
Publié: (2026)

OrderedCuts: A new approach for computing Gomory-Hu tree
par: Kolmogorov, Vladimir
Publié: (2022)

Constant-time edge label and leaf pointer maintenance on sliding suffix trees
par: Leonard, Laurentius, et autres
Publié: (2023)

Forcing a unique minimum spanning tree and a unique shortest path
par: Gima, Tatsuya, et autres
Publié: (2025)

Identifying bubble-like subgraphs in linear-time via a unified SPQR-tree framework
par: Sena, Francisco, et autres
Publié: (2026)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
par: Lokshtanov, Daniel, et autres
Publié: (2026)

Exact multiplicative updates for convolutional $β$-NMF in 2D
par: T., Pedro J. Villasana, et autres
Publié: (2018)

Efficient parameterized approximation
par: Kratsch, Stefan, et autres
Publié: (2025)

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
par: Cohen-Addad, Vincent, et autres
Publié: (2022)

A Strong Linear Programming Relaxation for Weighted Tree Augmentation
par: Cohen-Addad, Vincent, et autres
Publié: (2026)

An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree
par: Islam, Tariqul, et autres
Publié: (2024)

Efficient distributional regression trees learning algorithms for calibrated non-parametric probabilistic forecasts
par: Duchemin, Quentin, et autres
Publié: (2025)

Parameterized Complexity of Efficient Sortation
par: Ganian, Robert, et autres
Publié: (2024)

Efficient Centroid-Linkage Clustering
par: Bateni, MohammadHossein, et autres
Publié: (2024)

Finding the diameter of a tree with distance queries
par: Gerbner, Dániel, et autres
Publié: (2025)

Constructing disjoint Steiner trees in Sierpiński graphs
par: Yang, Chenxu, et autres
Publié: (2023)

Graph parameters that are coarsely equivalent to tree-length
par: Dragan, Feodor F.
Publié: (2025)

Efficient Dynamic Rank Aggregation
par: Alimi, Morteza, et autres
Publié: (2025)