Copertina

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

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Devismes, Stéphane, Dieudonné, Yoann, Labourel, Arnaud
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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