Imagen de Portada

Efficient top-down updates in AVL trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Jugé, Vincent
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Grandchildren-weight-balanced binary search trees
por: Jugé, Vincent
Publicado: (2024)

Probabilistic AVL Trees (p-AVL): Relaxing Deterministic Balancing
por: Desikan, Hayagriv
Publicado: (2026)

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

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

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

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

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

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

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

Realizing temporal transportation trees
por: Mertzios, George B., et al.
Publicado: (2024)

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

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

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

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

Spanning tree congestion of proper interval graphs
por: Otachi, Yota
Publicado: (2026)

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

Composing dynamic programming tree-decomposition-based algorithms
por: Baste, Julien
Publicado: (2019)

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

Path Partitions of Phylogenetic Networks
por: Lafond, Manuel, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

Efficient parameterized approximation
por: Kratsch, Stefan, et al.
Publicado: (2025)

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

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

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

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

Parameterized Complexity of Efficient Sortation
por: Ganian, Robert, et al.
Publicado: (2024)

Efficient Centroid-Linkage Clustering
por: Bateni, MohammadHossein, et al.
Publicado: (2024)

Efficient Dynamic Rank Aggregation
por: Alimi, Morteza, et al.
Publicado: (2025)

Space-Efficient Graph Kernelizations
por: Kammer, Frank, et al.
Publicado: (2020)

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

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