Image de couverture de livre

Can Like Attract Like? A Study of Homonymous Gathering in Networks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Devismes, Stéphane, Dieudonné, Yoann, Labourel, Arnaud
Format:	Preprint
Publié:	2025
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

Graph Exploration: The Impact of a Distance Constraint
par: Devismes, Stéphane, et autres
Publié: (2024)

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

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

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

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

Fast Broadcast in Highly Connected Networks
par: Chandra, Shashwat, et autres
Publié: (2024)

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
par: Sahu, Abhijeet, et autres
Publié: (2026)

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

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

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

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

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

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

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

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

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

A Simple and Robust Protocol for Distributed Counting
par: Cohen, Edith, et autres
Publié: (2025)

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

A Scalable and Unified Framework to Weighted Rank Aggregation
par: Carmel, Amir, et autres
Publié: (2026)

A Hybrid Vectorized Merge Sort on ARM NEON
par: Zhou, Jincheng, et autres
Publié: (2024)

A Distributed Conductance Tester Without Global Information Collection
par: Batu, Tugkan, et autres
Publié: (2023)

A Parallel Scan Algorithm in the Tensor Core Unit Model
par: Zouzias, Anastasios, et autres
Publié: (2024)

A Fault-Tolerant Version of Safra's Termination Detection Algorithm
par: Fokkink, Wan, et autres
Publié: (2026)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
par: Gil, Yuval, et autres
Publié: (2025)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
par: Li, Qian, et autres
Publié: (2024)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
par: Cambus, Mélanie, et autres
Publié: (2022)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
par: McCoy, Hunter, et autres
Publié: (2025)

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

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
par: Hsieh, Chou-Ying, et autres
Publié: (2024)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
par: Almeida, Paulo Sérgio, 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)

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

BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
par: Coluzzi, Massimo, et autres
Publié: (2024)

A parallel algorithm for the odd two-face shortest k-disjoint path problem
par: Chakraborty, Srijan, et autres
Publié: (2025)

MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
par: Manor, Daniel, et autres
Publié: (2025)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
par: Assadi, Sepehr
Publié: (2023)

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

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)

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

Towards Optimal Distributed Edge Coloring with Fewer Colors
par: Jakob, Manuel, et autres
Publié: (2025)