Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Devismes, Stéphane, Dieudonné, Yoann, Labourel, Arnaud
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

Graph Exploration: The Impact of a Distance Constraint
por: Devismes, Stéphane, et al.
Publicado: (2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
por: Wan, Zijin, et al.
Publicado: (2024)

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

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

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

Fast Broadcast in Highly Connected Networks
por: Chandra, Shashwat, et al.
Publicado: (2024)

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
por: Sahu, Abhijeet, et al.
Publicado: (2026)

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

Energy-Efficient Maximal Independent Sets in Radio Networks
por: Banasik, Dominick, et al.
Publicado: (2025)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
por: Bai, Sirui, et al.
Publicado: (2024)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
por: Feist, Dankrad, et al.
Publicado: (2025)

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

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
por: Chang, Yi-Jun, et al.
Publicado: (2026)

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
por: Chang, Yi-Jun, et al.
Publicado: (2022)

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

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

A Scalable and Unified Framework to Weighted Rank Aggregation
por: Carmel, Amir, et al.
Publicado: (2026)

A Hybrid Vectorized Merge Sort on ARM NEON
por: Zhou, Jincheng, et al.
Publicado: (2024)

A Distributed Conductance Tester Without Global Information Collection
por: Batu, Tugkan, et al.
Publicado: (2023)

A Parallel Scan Algorithm in the Tensor Core Unit Model
por: Zouzias, Anastasios, et al.
Publicado: (2024)

A Fault-Tolerant Version of Safra's Termination Detection Algorithm
por: Fokkink, Wan, et al.
Publicado: (2026)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
por: Gil, Yuval, et al.
Publicado: (2025)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
por: Li, Qian, et al.
Publicado: (2024)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
por: Cambus, Mélanie, et al.
Publicado: (2022)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
por: McCoy, Hunter, et al.
Publicado: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
por: Mordacchini, Matteo, et al.
Publicado: (2025)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
por: Hsieh, Chou-Ying, et al.
Publicado: (2024)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
por: Almeida, Paulo Sérgio, et al.
Publicado: (2024)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
por: Chang, Yi-Jun, et al.
Publicado: (2023)

Skip Hash: A Fast Ordered Map Via Software Transactional Memory
por: Rodriguez, Matthew, et al.
Publicado: (2024)

BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
por: Coluzzi, Massimo, et al.
Publicado: (2024)

A parallel algorithm for the odd two-face shortest k-disjoint path problem
por: Chakraborty, Srijan, et al.
Publicado: (2025)

MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
por: Manor, Daniel, et al.
Publicado: (2025)

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

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

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
por: Blin, Lelia, et al.
Publicado: (2026)

Efficient Dynamic MaxFlow Computation on GPUs
por: Kannappan, Shruthi, et al.
Publicado: (2025)

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