Image de couverture de livre

Optimal Dispersion Under Asynchrony

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Pattanayak, Debasish, Kshemkalyani, Ajay D., Kumar, Manish, Molla, Anisur Rahaman, Sharma, Gokarna
Format:	Preprint
Publié:	2025
Sujets:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Multiagent Systems Robotics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dispersion is (Almost) Optimal under (A)synchrony
par: Kshemkalyani, Ajay D., et autres
Publié: (2025)

Agentic Distributed Computing
par: Kshemkalyani, Ajay D., et autres
Publié: (2025)

Agent-based Leader Election, MST, and Beyond
par: Kshemkalyani, Ajay D., et autres
Publié: (2024)

Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
par: Chand, Prabhat Kumar, et autres
Publié: (2025)

Location-Aware Dispersion on Anonymous Graphs
par: Himani, et autres
Publié: (2026)

Computing Tree Structures in Anonymous Graphs via Mobile Agents
par: Chand, Prabhat Kumar, et autres
Publié: (2025)

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound
par: Cosson, Romain, et autres
Publié: (2025)

Distributed Butterfly Analysis using Mobile Agents
par: Chand, Prabhat Kumar, et autres
Publié: (2025)

Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient
par: Chand, Prabhat Kumar, et autres
Publié: (2024)

Asynchronous Gathering of Opaque Robots with Mobility Faults
par: Pramanick, Subhajit, et autres
Publié: (2025)

On the Power of Spatial Locality on Online Routing Problems
par: Guragain, Swapnil, et autres
Publié: (2025)

Optimal Fault-Tolerant Dispersion on Oriented Grids
par: Banerjee, Rik, et autres
Publié: (2024)

A Graph Isomorphism-based Decentralized Algorithm for Modular Robot Configuration Formation
par: Dutta, Ayan, et autres
Publié: (2016)

Optimizing Robot Dispersion on Grids: with and without Fault Tolerance
par: Banerjee, Rik, et autres
Publié: (2024)

Online Load and Graph Balancing for Random Order Inputs
par: Im, Sungjin, et autres
Publié: (2024)

Optimal Uniform Circle Formation by Asynchronous Luminous Robots
par: Feletti, Caterina, et autres
Publié: (2024)

Distributed Download from an External Data Source in Faulty Majority Settings
par: Augustine, John, et autres
Publié: (2024)

Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks
par: Zhang, Yunqi, et autres
Publié: (2024)

On the Randomized Locality of Matching Problems in Regular Graphs
par: Khoury, Seri, et autres
Publié: (2025)

Construction of a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers
par: Kshemkalyani, Ajay D., et autres
Publié: (2024)

Optimal Distributed Replacement Paths
par: Chang, Yi-Jun, et autres
Publié: (2025)

Semi-Synchronous Exploration in Dynamic Graphs
par: Saxena, Ashish, et autres
Publié: (2026)

Near-Optimal Resilient Labeling Schemes
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Towards Optimal Distributed Delta Coloring
par: Jakob, Manuel, et autres
Publié: (2025)

Optimal Deterministic Rendezvous in Labeled Lines
par: Bourreau, Yann, et autres
Publié: (2025)

Time-Optimal and Energy-Efficient Deterministic Consensus
par: Meir, Shachar, et autres
Publié: (2025)

Optimal local certification on graphs of bounded pathwidth
par: Baterisna, Dan Alden, et autres
Publié: (2025)

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

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

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

Message Optimality and Message-Time Trade-offs for APSP and Beyond
par: Dufoulon, Fabien, et autres
Publié: (2025)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
par: Dhulipala, Laxman, et autres
Publié: (2024)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
par: Baumecker, Malte, et autres
Publié: (2025)

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

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
par: Manoharan, Vignesh, et autres
Publié: (2022)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
par: Chang, Yi-Jun, et autres
Publié: (2023)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
par: Boneh, Itai, et autres
Publié: (2025)

The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
par: Lechowicz, Adam, et autres
Publié: (2023)

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

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
par: Censor-Hillel, Keren, et autres
Publié: (2023)