Imagen de Portada

Probabilistic AVL Trees (p-AVL): Relaxing Deterministic Balancing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Desikan, Hayagriv
Formato:	Preprint
Publicado:	2026
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

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

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

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

Deterministic Almost-Linear-Time Gomory-Hu Trees
por: Abboud, Amir, et al.
Publicado: (2025)

NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
por: Gaspers, Serge, et al.
Publicado: (2025)

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

Concurrent Balanced Augmented Trees
por: Wrench, Evan, et al.
Publicado: (2026)

Deterministic Dynamic Edge Colouring
por: Christiansen, Aleksander B. G.
Publicado: (2024)

Deterministic Cache-Oblivious Funnelselect
por: Brodal, Gerth Stølting, et al.
Publicado: (2024)

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
por: Kiran, Mekala, et al.
Publicado: (2026)

A Simple Deterministic Reduction From Gomory-Hu Tree to Maxflow and Expander Decomposition
por: Gutenberg, Maximilian Probst, et al.
Publicado: (2025)

Faster Pseudo-Deterministic Minimum Cut
por: Kenneth-Mordoch, Yotam
Publicado: (2026)

Faster Deterministic Streaming Vertex Coloring
por: Chechik, Shiri, et al.
Publicado: (2026)

Deterministic Mincut in Almost-Linear Time
por: Li, Jason
Publicado: (2021)

A Note on Deterministic FPTAS for Partition
por: Chen, Lin, et al.
Publicado: (2025)

Packed Acyclic Deterministic Finite Automata
por: Shibata, Hiroki, et al.
Publicado: (2024)

Deterministic Online Bipartite Edge Coloring
por: Blikstad, Joakim, et al.
Publicado: (2024)

Deterministic Monotone Min-Plus Product and Convolution
por: Jin, Ce, et al.
Publicado: (2026)

Deterministic Edge Coloring with few Colors in CONGEST
por: Blikstad, Joakim, et al.
Publicado: (2026)

The Bidirected Cut Relaxation for Steiner Tree: Better Integrality Gap Bounds and the Limits of Moat Growing
por: Paschmanns, Paul, et al.
Publicado: (2026)

Vizing's Theorem in Deterministic Almost-Linear Time
por: Assadi, Sepehr, et al.
Publicado: (2025)

Fast Practical Compression of Deterministic Finite Automata
por: Bille, Philip, et al.
Publicado: (2023)

Deterministic $k$-Median Clustering in Near-Optimal Time
por: Costa, Martín, et al.
Publicado: (2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
por: Bernstein, Aaron, et al.
Publicado: (2025)

Deterministic Padded Decompositions and Negative-Weight Shortest Paths
por: Li, Jason
Publicado: (2025)

A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
por: Dufay, Marc, et al.
Publicado: (2025)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
por: Wan, Zongqi, et al.
Publicado: (2024)

Extending the Applicability of Bloom Filters by Relaxing their Parameter Constraints
por: Walther, Paul, et al.
Publicado: (2025)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
por: Chuzhoy, Julia, et al.
Publicado: (2026)

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture
por: Björklund, Andreas, et al.
Publicado: (2024)

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
por: Jiang, Yonggang, et al.
Publicado: (2025)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
por: Henzinger, Monika, et al.
Publicado: (2024)

A Deterministic Partition Tree and Applications
por: Wang, Haitao
Publicado: (2025)

A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
por: Tian, Kangyi, et al.
Publicado: (2026)

An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
por: Meel, Kuldeep S., et al.
Publicado: (2024)

Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
por: Kuo, Tung-Wei
Publicado: (2024)

When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
por: Udwani, Rajan
Publicado: (2023)

Deterministic Simple $(Δ+\varepsilonα)$-Edge-Coloring in Near-Linear Time
por: Elkin, Michael, et al.
Publicado: (2024)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
por: Anand, Aditya, et al.
Publicado: (2024)

Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time
por: El-Hayek, Antoine, et al.
Publicado: (2025)