Image de couverture de livre

Fast Broadcast in Highly Connected Networks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chandra, Shashwat, Chang, Yi-Jun, Dory, Michal, Ghaffari, Mohsen, Leitersdorf, Dean
Format:	Preprint
Publié:	2024
Sujets:	Distributed, Parallel, and Cluster Computing 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

Improved All-Pairs Approximate Shortest Paths in Congested Clique
par: Bui, Hong Duc, et autres
Publié: (2024)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
par: Chang, Yi-Jun, et autres
Publié: (2023)

Bounded Memory in Distributed Networks
par: Basat, Ran Ben, et autres
Publié: (2025)

Massively Parallel Algorithms for Approximate Shortest Paths
par: Dory, Michal, et autres
Publié: (2024)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
par: Ghaffari, Mohsen, et autres
Publié: (2024)

Parallel Dynamic Maximal Matching
par: Ghaffari, Mohsen, et autres
Publié: (2024)

A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
par: Ghaffari, Mohsen, et autres
Publié: (2024)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)

A Simple Distributed Deterministic Planar Separator
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2026)

Distributed Maximum Flow in Planar Graphs
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2024)

Fast Spanning Tree Sampling in Broadcast Congested Clique
par: Anari, Nima, et autres
Publié: (2026)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
par: Chang, Yi-Jun
Publié: (2023)

Fully Scalable MPC Algorithms for Euclidean k-Center
par: Czumaj, Artur, et autres
Publié: (2025)

A Cut-Matching Game for Constant-Hop Expanders
par: Haeupler, Bernhard, et autres
Publié: (2022)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
par: Chang, Yi-Jun, et autres
Publié: (2026)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
par: Chang, Yi-Jun, et autres
Publié: (2022)

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
par: Chang, Yi-Jun, et autres
Publié: (2024)

Deterministic Even-Cycle Detection in Broadcast CONGEST
par: Fraigniaud, Pierre, et autres
Publié: (2024)

Optimal local certification on graphs of bounded pathwidth
par: Baterisna, Dan Alden, et autres
Publié: (2025)

Low-Distortion Clustering in Bounded Growth Graphs
par: Chang, Yi-Jun, et autres
Publié: (2024)

Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
par: Bonomi, Silvia, et autres
Publié: (2021)

Deterministic Expander Routing: Faster and More Versatile
par: Chang, Yi-Jun, et autres
Publié: (2024)

Round and Communication Efficient Graph Coloring
par: Chang, Yi-Jun, et autres
Publié: (2024)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
par: Chang, Yi-Jun, et autres
Publié: (2023)

Optimal Distributed Replacement Paths
par: Chang, Yi-Jun, et autres
Publié: (2025)

Fast Deterministic Distributed Degree Splitting
par: Maus, Yannic, et autres
Publié: (2026)

Fast Concurrent Primitives Despite Contention
par: Bender, Michael A., et autres
Publié: (2026)

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
par: Robinson, Peter, et autres
Publié: (2025)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
par: Wang, Letong, et autres
Publié: (2023)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
par: Polyanskii, Nikita, et autres
Publié: (2024)

Skip Hash: A Fast Ordered Map Via Software Transactional Memory
par: Rodriguez, Matthew, et autres
Publié: (2024)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
par: Mordacchini, Matteo, et autres
Publié: (2025)

Dynamic Maximal Matching in Clique Networks
par: Li, Minming, et autres
Publié: (2024)

Fully-Distributed Byzantine Agreement in Sparse Networks
par: Augustine, John, et autres
Publié: (2024)

Fully Scalable MPC Algorithms for Clustering in High Dimension
par: Czumaj, Artur, et autres
Publié: (2023)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
par: Bai, Sirui, et autres
Publié: (2024)

Energy-Efficient Maximal Independent Sets in Radio Networks
par: Banasik, Dominick, et autres
Publié: (2025)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
par: Baumecker, Malte, et autres
Publié: (2025)

Towards Scalable and Practical Batch-Dynamic Connectivity
par: De Man, Quinten, et autres
Publié: (2024)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
par: Feist, Dankrad, et autres
Publié: (2025)