Grandchildren-weight-balanced binary search 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

Efficient top-down updates in AVL trees
by: Jugé, Vincent
Published: (2024)

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

Certified binary search tree on W-types
by: Arengas, Gustavo
Published: (2024)

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

On multidimensional generalization of binary search
by: Dereniowski, Dariusz, et al.
Published: (2024)

Generation of weighted trees, block trees and block graphs
by: Ekim, Tınaz, et al.
Published: (2024)

Performance bounds for nearest neighbor search with k-d trees
by: Bazzani, Marco, et al.
Published: (2026)

Holonomic equations and efficient random generation of binary trees
by: Lescanne, Pierre
Published: (2022)

Efficient size-prescribed $k$-core search
by: Liu, Yiping, et al.
Published: (2024)

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

New weighted additive spanners
by: La, An, et al.
Published: (2024)

Edge-weighted Matching in the Dark
by: Huang, Zhiyi, et al.
Published: (2025)

Online facility location with weights and congestion
by: Chakraborty, Arghya, et al.
Published: (2022)

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)

Improved online load balancing with known makespan
by: Böhm, Martin, et al.
Published: (2024)

Improved girth approximation in weighted undirected graphs
by: Kadria, Avi, et al.
Published: (2025)

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

A Dynamic, Self-balancing k-d Tree
by: Brown, Russell A.
Published: (2025)

A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
by: Elkin, Yury, et al.
Published: (2021)

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)

Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem
by: Bläsius, Thomas, et al.
Published: (2025)

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs
by: Borst, Sander, et al.
Published: (2025)

Are there graphs whose shortest path structure requires large edge weights?
by: Bernstein, Aaron, et al.
Published: (2023)

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)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
by: Borst, Sander, et al.
Published: (2024)

Balanced Learned Sort: a new learned model for fast and balanced item bucketing
by: Ferragina, Paolo, 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)

Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more
by: Karczmarz, Adam, et al.
Published: (2024)

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)

Faster single-source shortest paths with negative real weights via proper hop distance
by: Huang, Yufan, et al.
Published: (2024)