Imagen de Portada

Congested Clique Counting for Local Gibbs Distributions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Sobel, Joshua Z.
Formato:	Preprint
Publicado:	2025
Materias:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

Fast Spanning Tree Sampling in Broadcast Congested Clique
por: Anari, Nima, et al.
Publicado: (2026)

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

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

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

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

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

A Simple and Robust Protocol for Distributed Counting
por: Cohen, Edith, et al.
Publicado: (2025)

Local Density and its Distributed Approximation
por: Christiansen, Aleksander Bjørn, et al.
Publicado: (2024)

On the Randomized Locality of Matching Problems in Regular Graphs
por: Khoury, Seri, et al.
Publicado: (2025)

The Local Information Cost of Distributed Graph Spanners
por: Robinson, Peter
Publicado: (2020)

Distributed Lovász Local Lemma under Bandwidth Limitations
por: Halldórsson, Magnús M., et al.
Publicado: (2024)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
por: Bonamy, Marthe, et al.
Publicado: (2025)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
por: Sanders, Peter, et al.
Publicado: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
por: Liu, Quanquan C., et al.
Publicado: (2024)

ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
por: Shovan, S. M., et al.
Publicado: (2025)

On the Locality of Hall's Theorem
por: Brandt, Sebastian, et al.
Publicado: (2025)

Optimal Distributed Replacement Paths
por: Chang, Yi-Jun, et al.
Publicado: (2025)

Bounded Memory in Distributed Networks
por: Basat, Ran Ben, et al.
Publicado: (2025)

Distributed Graph Algorithms with Predictions
por: Boyar, Joan, et al.
Publicado: (2025)

Distributed Stochastic Graph Algorithms
por: Censor-Hillel, Keren, et al.
Publicado: (2026)

Towards Optimal Distributed Delta Coloring
por: Jakob, Manuel, et al.
Publicado: (2025)

Distributed Maximum Flow in Planar Graphs
por: Abd-Elhaleem, Yaseen, et al.
Publicado: (2024)

Fast Deterministic Distributed Degree Splitting
por: Maus, Yannic, et al.
Publicado: (2026)

Meta-Theorems for Cuttable Distributed Problems
por: Bonamy, Marthe, et al.
Publicado: (2026)

Distributed Subgraph Finding: Progress and Challenges
por: Censor-Hillel, Keren
Publicado: (2022)

$k$-Center Clustering in Distributed Models
por: Biabani, Leyla, et al.
Publicado: (2024)

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

On Distributed Computation of the Minimum Triangle Edge Transversal
por: Censor-Hillel, Keren, et al.
Publicado: (2024)

Distributed Delta-Coloring under Bandwidth Limitations
por: Maus, Yannic, et al.
Publicado: (2024)

Fully-Distributed Byzantine Agreement in Sparse Networks
por: Augustine, John, et al.
Publicado: (2024)

A Simple Distributed Deterministic Planar Separator
por: Abd-Elhaleem, Yaseen, et al.
Publicado: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
por: Jakob, Manuel, et al.
Publicado: (2025)

Distributed Interactive Proofs for Planarity with Log-Star Communication
por: Gil, Yuval, et al.
Publicado: (2025)

Distributed Reductions for the Maximum Weight Independent Set Problem
por: Borowitz, Jannick, et al.
Publicado: (2025)

Breaking Barriers for Distributed MIS by Faster Degree Reduction
por: Khoury, Seri, et al.
Publicado: (2025)

Faster Distributed $Δ$-Coloring via Ruling Subgraphs
por: Bourreau, Yann, et al.
Publicado: (2025)