Faster Cycle Detection in the Congested Clique
Fuente:
arXiv
Saved in:
| Main Authors: | Censor-Hillel, Keren, Even, Tomer, Williams, Virginia Vassilevska |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
When MIS and Maximal Matching are Easy in the Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)
by: Censor-Hillel, Keren, et al.
Published: (2025)
Computing in a Faulty Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)
by: Censor-Hillel, Keren, et al.
Published: (2025)
Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)
by: Censor-Hillel, Keren, et al.
Published: (2025)
Distributed Subgraph Finding: Progress and Challenges
by: Censor-Hillel, Keren
Published: (2022)
by: Censor-Hillel, Keren
Published: (2022)
On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)
by: Censor-Hillel, Keren, et al.
Published: (2024)
Near-Optimal Resilient Labeling Schemes
by: Censor-Hillel, Keren, et al.
Published: (2024)
by: Censor-Hillel, Keren, et al.
Published: (2024)
Distributed Stochastic Graph Algorithms
by: Censor-Hillel, Keren, et al.
Published: (2026)
by: Censor-Hillel, Keren, et al.
Published: (2026)
Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
by: Censor-Hillel, Keren, et al.
Published: (2023)
by: Censor-Hillel, Keren, et al.
Published: (2023)
Fast Approximate Counting of Cycles
by: Censor-Hillel, Keren, et al.
Published: (2024)
by: Censor-Hillel, Keren, et al.
Published: (2024)
String Problems in the Congested Clique Model
by: Golan, Shay, et al.
Published: (2025)
by: Golan, Shay, et al.
Published: (2025)
Bounded Memory in Distributed Networks
by: Basat, Ran Ben, et al.
Published: (2025)
by: Basat, Ran Ben, et al.
Published: (2025)
Congested Clique Counting for Local Gibbs Distributions
by: Sobel, Joshua Z.
Published: (2025)
by: Sobel, Joshua Z.
Published: (2025)
Fast Spanning Tree Sampling in Broadcast Congested Clique
by: Anari, Nima, et al.
Published: (2026)
by: Anari, Nima, et al.
Published: (2026)
Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)
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)
by: Robinson, Peter
Published: (2022)
Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate $k$-clique counts faster
by: Censor-Hillel, Keren, et al.
Published: (2025)
by: Censor-Hillel, Keren, et al.
Published: (2025)
Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)
by: Li, Minming, et al.
Published: (2024)
Deterministic Even-Cycle Detection in Broadcast CONGEST
by: Fraigniaud, Pierre, et al.
Published: (2024)
by: Fraigniaud, Pierre, et al.
Published: (2024)
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
by: Ghaffari, Mohsen, et al.
Published: (2024)
by: Ghaffari, Mohsen, et al.
Published: (2024)
Deterministic Expander Routing: Faster and More Versatile
by: Chang, Yi-Jun, et al.
Published: (2024)
by: Chang, Yi-Jun, et al.
Published: (2024)
Breaking Barriers for Distributed MIS by Faster Degree Reduction
by: Khoury, Seri, et al.
Published: (2025)
by: Khoury, Seri, et al.
Published: (2025)
Faster Distributed $Δ$-Coloring via Ruling Subgraphs
by: Bourreau, Yann, et al.
Published: (2025)
by: Bourreau, Yann, et al.
Published: (2025)
Faster Distributed $Δ$-Coloring via a Reduction to MIS
by: Bourreau, Yann, et al.
Published: (2025)
by: Bourreau, Yann, et al.
Published: (2025)
Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
by: Blelloch, Guy, et al.
Published: (2026)
by: Blelloch, Guy, et al.
Published: (2026)
Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
by: Elkin, Michael, et al.
Published: (2025)
by: Elkin, Michael, et al.
Published: (2025)
Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
by: Akker, Erik van den, et al.
Published: (2024)
by: Akker, Erik van den, et al.
Published: (2024)
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
by: Manoharan, Vignesh, et al.
Published: (2023)
by: Manoharan, Vignesh, et al.
Published: (2023)
Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
by: Lingas, Andrzej
Published: (2024)
by: Lingas, Andrzej
Published: (2024)
Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)
by: Li, Fuhuan, et al.
Published: (2025)
A Fault-Tolerant Version of Safra's Termination Detection Algorithm
by: Fokkink, Wan, et al.
Published: (2026)
by: Fokkink, Wan, et al.
Published: (2026)
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
by: Williams, Marvin, et al.
Published: (2025)
by: Williams, Marvin, et al.
Published: (2025)
Witness-Sensitive Detection of Induced Diamonds
by: Censor-Hillel, Keren, et al.
Published: (2026)
by: Censor-Hillel, Keren, et al.
Published: (2026)
Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
by: Yang, Mingqi
Published: (2024)
by: Yang, Mingqi
Published: (2024)
Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)
by: Wang, Letong, et al.
Published: (2024)
Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
by: Hsieh, Chou-Ying, et al.
Published: (2024)
by: Hsieh, Chou-Ying, et al.
Published: (2024)
Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
by: Liu, Quanquan C., et al.
Published: (2024)
by: Liu, Quanquan C., et al.
Published: (2024)
Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
by: Prokopenko, Andrey, et al.
Published: (2024)
by: Prokopenko, Andrey, et al.
Published: (2024)
Hash & Adjust: Competitive Demand-Aware Consistent Hashing
by: Pourdamghani, Arash, et al.
Published: (2024)
by: Pourdamghani, Arash, et al.
Published: (2024)
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
by: Ghaffari, Mohsen, et al.
Published: (2024)
by: Ghaffari, Mohsen, et al.
Published: (2024)
Parallel Integer Sort: Theory and Practice
by: Dong, Xiaojun, et al.
Published: (2024)
by: Dong, Xiaojun, et al.
Published: (2024)
Similar Items
-
When MIS and Maximal Matching are Easy in the Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025) -
Computing in a Faulty Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025) -
Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025) -
Distributed Subgraph Finding: Progress and Challenges
by: Censor-Hillel, Keren
Published: (2022) -
On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)