Cover Image

Fast Spanning Tree Sampling in Broadcast Congested Clique

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Anari, Nima, Haqi, Alireza
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parallel Sampling via Autospeculation
by: Anari, Nima, et al.
Published: (2025)

Computing in a Faulty Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)

Faster Cycle Detection in the Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2024)

String Problems in the Congested Clique Model
by: Golan, Shay, et al.
Published: (2025)

Congested Clique Counting for Local Gibbs Distributions
by: Sobel, Joshua Z.
Published: (2025)

When MIS and Maximal Matching are Easy in the Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)

What Can We Compute in a Single Round of the Congested Clique?
by: Robinson, Peter
Published: (2022)

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)

Fast Broadcast in Highly Connected Networks
by: Chandra, Shashwat, et al.
Published: (2024)

Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)

Deterministic Even-Cycle Detection in Broadcast CONGEST
by: Fraigniaud, Pierre, et al.
Published: (2024)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026)

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
by: Sahu, Abhijeet, et al.
Published: (2026)

A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
by: Ghaffari, Mohsen, et al.
Published: (2024)

Fast Deterministic Distributed Degree Splitting
by: Maus, Yannic, et al.
Published: (2026)

Fast Concurrent Primitives Despite Contention
by: Bender, Michael A., et al.
Published: (2026)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
by: Wang, Letong, et al.
Published: (2023)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
by: Mordacchini, Matteo, et al.
Published: (2025)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
by: Polyanskii, Nikita, et al.
Published: (2024)

Skip Hash: A Fast Ordered Map Via Software Transactional Memory
by: Rodriguez, Matthew, et al.
Published: (2024)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
by: Feist, Dankrad, et al.
Published: (2025)

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

Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
by: Lingas, Andrzej
Published: (2024)

History Trees and Their Applications
by: Viglietta, Giovanni
Published: (2024)

Lock-Free Augmented Trees
by: Fatourou, Panagiota, et al.
Published: (2024)

A Surprisingly Simple Method for Distributed Euclidean-Minimum Spanning Tree / Single Linkage Dendrogram Construction from High Dimensional Embeddings via Distance Decomposition
by: Lettich, Richard
Published: (2024)

Tight Bounds on the Message Complexity of Distributed Tree Verification
by: Kutten, Shay, et al.
Published: (2024)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)

Parallel Joinable B-Trees in the Fork-Join I/O Model
by: Goodrich, Michael, et al.
Published: (2025)

MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
by: Manor, Daniel, et al.
Published: (2025)

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
by: Williams, Marvin, et al.
Published: (2025)

Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
by: Izumi, Taisuke, et al.
Published: (2025)

Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
by: Bonomi, Silvia, et al.
Published: (2021)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)

A Scalable and Unified Framework to Weighted Rank Aggregation
by: Carmel, Amir, et al.
Published: (2026)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
by: Dang'ana, Michael
Published: (2026)

Distributed Santa Claus via Global Rounding
by: de Vos, Tijn, et al.
Published: (2026)

Two Efficient Message-passing Exclusive Scan Algorithms
by: Träff, Jesper Larsson
Published: (2026)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
by: Flin, Maxime, et al.
Published: (2026)