Image de couverture de livre

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

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

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

Certified binary search tree on W-types
par: Arengas, Gustavo
Publié: (2024)

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

On multidimensional generalization of binary search
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Generation of weighted trees, block trees and block graphs
par: Ekim, Tınaz, et autres
Publié: (2024)

Performance bounds for nearest neighbor search with k-d trees
par: Bazzani, Marco, et autres
Publié: (2026)

Holonomic equations and efficient random generation of binary trees
par: Lescanne, Pierre
Publié: (2022)

Efficient size-prescribed $k$-core search
par: Liu, Yiping, et autres
Publié: (2024)

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

New weighted additive spanners
par: La, An, et autres
Publié: (2024)

Edge-weighted Matching in the Dark
par: Huang, Zhiyi, et autres
Publié: (2025)

Online facility location with weights and congestion
par: Chakraborty, Arghya, et autres
Publié: (2022)

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)

Improved online load balancing with known makespan
par: Böhm, Martin, et autres
Publié: (2024)

Improved girth approximation in weighted undirected graphs
par: Kadria, Avi, et autres
Publié: (2025)

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

A Dynamic, Self-balancing k-d Tree
par: Brown, Russell A.
Publié: (2025)

A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
par: Elkin, Yury, et autres
Publié: (2021)

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)

Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem
par: Bläsius, Thomas, et autres
Publié: (2025)

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs
par: Borst, Sander, et autres
Publié: (2025)

Are there graphs whose shortest path structure requires large edge weights?
par: Bernstein, Aaron, et autres
Publié: (2023)

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)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
par: Borst, Sander, et autres
Publié: (2024)

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

Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more
par: Karczmarz, Adam, et autres
Publié: (2024)

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)

Faster single-source shortest paths with negative real weights via proper hop distance
par: Huang, Yufan, et autres
Publié: (2024)