Image de couverture de livre

Concurrent Balanced Augmented Trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wrench, Evan, Singh, Ajay, Roh, Younghun, Fatourou, Panagiota, Jayanti, Siddhartha, Ruppert, Eric, Wei, Yuanhao
Format:	Preprint
Publié:	2026
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

Concurrent Double-Ended Priority Queues
par: Fatourou, Panagiota, et autres
Publié: (2025)

Lock-Free Augmented Trees
par: Fatourou, Panagiota, et autres
Publié: (2024)

PIPQ: Strict Insert-Optimized Concurrent Priority Queue
par: Grimes, Olivia, et autres
Publié: (2025)

Machine-Verifying Toom-Cook Multiplication with Integer Evaluation Points
par: Nanniyur, Srihari, et autres
Publié: (2026)

Aggregating Funnels for Faster Fetch&Add and Queues
par: Roh, Younghun, et autres
Publié: (2024)

Efficient Distributed Data Structures for Future Many-core Architectures
par: Fatourou, Panagiota, et autres
Publié: (2024)

Big Atomics
par: Anderson, Daniel, et autres
Publié: (2025)

Balancing Weights, Directed Sparsification, and Augmenting Paths
par: Li, Jason
Publié: (2026)

Learning-Augmented Dynamic Submodular Maximization
par: Agarwal, Arpit, et autres
Publié: (2023)

Concurrent Composition for Differentially Private Continual Mechanisms
par: Henzinger, Monika, et autres
Publié: (2024)

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

Building a Balanced k-d Tree in O(kn log n) Time
par: Brown, Russell A.
Publié: (2014)

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

History-Independent Load Balancing
par: Bender, Michael A., et autres
Publié: (2026)

Load Balancing with Duration Predictions
par: Azar, Yossi, et autres
Publié: (2025)

A Better-Than-2 Approximation for the Directed Tree Augmentation Problem
par: Neuwohner, Meike, et autres
Publié: (2025)

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time
par: Bernstein, Aaron, et autres
Publié: (2024)

HART: A Hybrid Addressing Scheme for Self-Balancing Binary Search Trees in Phase Change Memory (PCM)
par: Desai, Mahek, et autres
Publié: (2025)

Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It
par: Osterkamp, Eric M., et autres
Publié: (2024)

Finding the Balance Rate of Uncertain Signed Graphs
par: Wang, Zeyu, et autres
Publié: (2026)

Improved Approximation Algorithm for Maximum Balanced Biclique
par: Manurangsi, Pasin
Publié: (2026)

Dominating Set with Quotas: Balancing Coverage and Constraints
par: Chatterjee, Sobyasachi, et autres
Publié: (2026)

Hardness and Approximation Algorithms for Balanced Districting Problems
par: Dharangutte, Prathamesh, et autres
Publié: (2025)

Balancing Two-Dimensional Straight-Line Programs
par: Boneh, Itai, et autres
Publié: (2025)

Improved Online Load Balancing in the Two-Norm
par: Borst, Sander, et autres
Publié: (2025)

Balancing the Spread of Two Opinions in Sparse Social Networks
par: Knop, Dušan, et autres
Publié: (2021)

Streaming Algorithms for Connectivity Augmentation
par: Jin, Ce, et autres
Publié: (2024)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors
par: Assadi, Sepehr, et autres
Publié: (2024)

Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
par: Räcke, Harald, et autres
Publié: (2024)

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
par: Kiran, Mekala, et autres
Publié: (2026)

Approximation Algorithms for Steiner Connectivity Augmentation
par: Hathcock, Daniel, et autres
Publié: (2023)

Learning-Augmented Online Covering Problems
par: Ameli, Afrouz Jabal, et autres
Publié: (2025)

Engineering Weighted Connectivity Augmentation Algorithms
par: Faraj, Marcelo Fonseca, et autres
Publié: (2024)

Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
par: Kesselheim, Thomas, et autres
Publié: (2025)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
par: Kolmogorov, Vladimir, et autres
Publié: (2026)

Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
par: Bringmann, Karl, et autres
Publié: (2024)

Optimal Learning-Augmented Algorithm for Online Bidding
par: Lee, Changyeol, et autres
Publié: (2026)

3/2-Approximation for the Forest Augmentation Problem
par: Çivril, Ali
Publié: (2024)

Time-Bucketed Balance Records: Bounded-Storage Ephemeral Tokens for Resource-Constrained Systems
par: Scovil, Shaun, et autres
Publié: (2025)

Balanced Learned Sort: a new learned model for fast and balanced item bucketing
par: Ferragina, Paolo, et autres
Publié: (2024)