Cover Image

UFO Trees: Practical and Provably-Efficient Parallel Batch-Dynamic Trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	De Man, Quinten, Sharma, Atharva, Gowda, Kishen N, Dhulipala, Laxman
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
by: Blelloch, Guy, et al.
Published: (2026)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
by: Dhulipala, Laxman, et al.
Published: (2024)

Towards Scalable and Practical Batch-Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2024)

Efficient Centroid-Linkage Clustering
by: Bateni, MohammadHossein, et al.
Published: (2024)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)

Parallel Batch-Dynamic Maximal Independent Set
by: Blelloch, Guy, et al.
Published: (2026)

Parallel Hierarchical Agglomerative Clustering in Low Dimensions
by: Bateni, MohammadHossein, et al.
Published: (2025)

Parallel Integer Sort: Theory and Practice
by: Dong, Xiaojun, et al.
Published: (2024)

DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering
by: Yu, Shangdi, et al.
Published: (2025)

Parallel Algorithms for Hierarchical Nucleus Decomposition
by: Shi, Jessica, et al.
Published: (2023)

It's Hard to HAC with Average Linkage!
by: Bateni, MohammadHossein, et al.
Published: (2024)

Fine-Grained Privacy Guarantees for Coverage Problems
by: Dhulipala, Laxman, et al.
Published: (2024)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
by: Dhulipala, Laxman, et al.
Published: (2024)

Improved Parallel Algorithms for EF1 Allocations
by: Gowda, Kishen N, et al.
Published: (2026)

Chamfer-Linkage for Hierarchical Agglomerative Clustering
by: Gowda, Kishen N, et al.
Published: (2026)

Provably Fast and Space-Efficient Parallel Biconnectivity
by: Dong, Xiaojun, et al.
Published: (2023)

Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
by: Ghaffari, Mohsen, et al.
Published: (2025)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024)

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
by: Ghaffari, Mohsen, et al.
Published: (2025)

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
by: Wheatman, Brian, et al.
Published: (2024)

Fast and Compact Sketch-Based Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2025)

Practical Parallel Block Tree Construction: First Results
by: Clausecker, Robert, et al.
Published: (2025)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
by: Dhulipala, Laxman, et al.
Published: (2024)

Near-Optimal Differentially Private k-Core Decomposition
by: Dhulipala, Laxman, et al.
Published: (2023)

Tree Embedding in High Dimensions: Dynamic and Massively Parallel
by: Goranci, Gramoz, et al.
Published: (2025)

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
by: Chen, Chi-Yeh
Published: (2025)

Approximate Nearest Neighbor Search with Window Filters
by: Engels, Joshua, et al.
Published: (2024)

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
by: Dhulipala, Laxman, et al.
Published: (2025)

Efficiently Constructing Sparse Navigable Graphs
by: Conway, Alex, et al.
Published: (2025)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
by: Dhulipala, Laxman, et al.
Published: (2023)

Bounding the Fragmentation of B-Trees Subject to Batched Insertions
by: Bender, Michael A., et al.
Published: (2026)

Efficient Matroid Intersection via a Batch-Update Auction Algorithm
by: Blikstad, Joakim, et al.
Published: (2024)

Efficient Parallel Algorithms for Hypergraph Matching
by: Reinstädtler, Henrik, et al.
Published: (2026)

Massively Parallel Minimum Spanning Tree in General Metric Spaces
by: Azarmehr, Amir, et al.
Published: (2024)

High Probability Work Efficient Parallel Algorithms
by: Hutton, Chase, et al.
Published: (2026)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
by: Blelloch, Guy E., et al.
Published: (2025)

Dynamic Graph Coloring: Sequential, Parallel, and Distributed
by: Ghaffari, Mohsen, et al.
Published: (2025)

Efficient Parallel Ising Samplers via Localization Schemes
by: Chen, Xiaoyu, et al.
Published: (2025)

Efficient and Provable Algorithms for Covariate Shift
by: Adil, Deeksha, et al.
Published: (2025)