Image de couverture de livre

Round-Delayed Amnesiac Flooding

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Alafin, Oluwatobi, Mertzios, George B., Spirakis, Paul G.
Format:	Preprint
Publié:	2026
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

Round and Communication Efficient Graph Coloring
par: Chang, Yi-Jun, et autres
Publié: (2024)

Distributed Santa Claus via Global Rounding
par: de Vos, Tijn, et autres
Publié: (2026)

Sorting in One and Two Rounds using $t$-Comparators
par: Gelles, Ran, et autres
Publié: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
par: Liu, Quanquan C., et autres
Publié: (2024)

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

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
par: Khoury, Seri, et autres
Publié: (2025)

Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
par: Lenzen, Christoph, et autres
Publié: (2024)

Distributed Triangle Detection is Hard in Few Rounds
par: Assadi, Sepehr, et autres
Publié: (2025)

Distributed Stochastic Graph Algorithms
par: Censor-Hillel, Keren, et autres
Publié: (2026)

Amnesiac Flooding: Easy to break, hard to escape
par: Austin, Henry, et autres
Publié: (2025)

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

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

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
par: Dang'ana, Michael
Publié: (2026)

Two Efficient Message-passing Exclusive Scan Algorithms
par: Träff, Jesper Larsson
Publié: (2026)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
par: Flin, Maxime, et autres
Publié: (2026)

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

Parallel Batch-Dynamic Maximal Independent Set
par: Blelloch, Guy, et autres
Publié: (2026)

Fast Deterministic Distributed Degree Splitting
par: Maus, Yannic, et autres
Publié: (2026)

Efficient calculation of available space for multi-NUMA virtual machines
par: Gudkov, Andrei, et autres
Publié: (2026)

Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
par: Filtser, Arnold, et autres
Publié: (2026)

Meta-Theorems for Cuttable Distributed Problems
par: Bonamy, Marthe, et autres
Publié: (2026)

Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
par: Karmegam, Arivarasan, et autres
Publié: (2026)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
par: Blelloch, Guy, et autres
Publié: (2026)

Evaluation of Dynamic Vector Bin Packing for Virtual Machine Placement
par: Lee, Zong Yu, et autres
Publié: (2026)

Near-optimal population protocols on bounded-degree trees
par: Rybicki, Joel, et autres
Publié: (2026)

Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems
par: Garg, Vijay K., et autres
Publié: (2026)

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

Fast Concurrent Primitives Despite Contention
par: Bender, Michael A., et autres
Publié: (2026)

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

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

Fast Spanning Tree Sampling in Broadcast Congested Clique
par: Anari, Nima, 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)

Perfect Matching with Few Link Activations
par: Mirault, Hugo, et autres
Publié: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)

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

Designing Parallel Algorithms for Community Detection using Arachne
par: Li, Fuhuan, et autres
Publié: (2025)

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

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

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