Image de couverture de livre

What Can We Compute in a Single Round of the Congested Clique?

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Robinson, Peter
Format:	Preprint
Publié:	2022
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

Computing in a Faulty Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

Faster Cycle Detection in the Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2024)

String Problems in the Congested Clique Model
par: Golan, Shay, et autres
Publié: (2025)

Congested Clique Counting for Local Gibbs Distributions
par: Sobel, Joshua Z.
Publié: (2025)

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

When MIS and Maximal Matching are Easy in the Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

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

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

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

The Local Information Cost of Distributed Graph Spanners
par: Robinson, Peter
Publié: (2020)

Round-Delayed Amnesiac Flooding
par: Alafin, Oluwatobi, et autres
Publié: (2026)

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

Distributed Santa Claus via Global Rounding
par: de Vos, Tijn, et autres
Publié: (2026)

Sorting in One and Two Rounds using $t$-Comparators
par: Gelles, Ran, et autres
Publié: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
par: Liu, Quanquan C., 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)

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

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
par: Khoury, Seri, et autres
Publié: (2025)

Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
par: Lenzen, Christoph, et autres
Publié: (2024)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
par: Dhulipala, Laxman, et autres
Publié: (2024)

Tight Bounds on the Message Complexity of Distributed Tree Verification
par: Kutten, Shay, et autres
Publié: (2024)

Time-Optimal and Energy-Efficient Deterministic Consensus
par: Meir, Shachar, et autres
Publié: (2025)

Perfect Matching with Few Link Activations
par: Mirault, Hugo, et autres
Publié: (2025)

Message Optimality and Message-Time Trade-offs for APSP and Beyond
par: Dufoulon, Fabien, et autres
Publié: (2025)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
par: Wan, Zijin, et autres
Publié: (2024)

Can Like Attract Like? A Study of Homonymous Gathering in Networks
par: Devismes, Stéphane, et autres
Publié: (2025)

Distributed Triangle Detection is Hard in Few Rounds
par: Assadi, Sepehr, et autres
Publié: (2025)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
par: De Man, Quinten, et autres
Publié: (2025)

Efficient Dynamic MaxFlow Computation on GPUs
par: Kannappan, Shruthi, et autres
Publié: (2025)

On Distributed Computation of the Minimum Triangle Edge Transversal
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
par: Yang, Mingqi
Publié: (2024)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
par: Ashvinkumar, Vikrant, et autres
Publié: (2023)

Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems
par: Garg, Vijay K., et autres
Publié: (2026)

Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
par: Lingas, Andrzej
Publié: (2024)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
par: Sanders, Peter, et autres
Publié: (2024)

Scalable Fault-Tolerant MapReduce
par: Hespe, Demian, et autres
Publié: (2024)

The Quantum Message Complexity of Distributed Wake-Up with Advice
par: Robinson, Peter, et autres
Publié: (2026)

Weighted Matching in a Poly-Streaming Model
par: Ullah, Ahammed, et autres
Publié: (2025)

Faster Distributed $Δ$-Coloring via a Reduction to MIS
par: Bourreau, Yann, et autres
Publié: (2025)

Orientation does not help with 3-coloring a grid in online-LOCAL
par: Boudier, Thomas, et autres
Publié: (2025)