Image de couverture de livre

Optimal Deterministic Rendezvous in Labeled Lines

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bourreau, Yann, Narayanan, Ananth, Nolin, Alexandre
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

Faster Distributed $Δ$-Coloring via a Reduction to MIS
par: Bourreau, Yann, et autres
Publié: (2025)

Faster Distributed $Δ$-Coloring via Ruling Subgraphs
par: Bourreau, Yann, et autres
Publié: (2025)

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

Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
par: Flin, Maxime, et autres
Publié: (2024)

Content-Oblivious Leader Election on Rings
par: Frei, Fabian, et autres
Publié: (2024)

On the Locality of Hall's Theorem
par: Brandt, Sebastian, et autres
Publié: (2025)

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

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

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

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

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

Decentralized Distributed Graph Coloring: Cluster Graphs
par: Flin, Maxime, et autres
Publié: (2024)

Massively Parallel Ruling Set Made Deterministic
par: Giliberti, Jeff, et autres
Publié: (2024)

Deterministic Expander Routing: Faster and More Versatile
par: Chang, Yi-Jun, et autres
Publié: (2024)

Deterministic Even-Cycle Detection in Broadcast CONGEST
par: Fraigniaud, Pierre, et autres
Publié: (2024)

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

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
par: Robinson, Peter, et autres
Publié: (2025)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
par: Gil, Yuval
Publié: (2024)

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

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

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

Concurrent Deterministic Skiplist and Other Data Structures
par: Sasidharan, Aparna
Publié: (2023)

Towards Optimal Distributed Delta Coloring
par: Jakob, Manuel, 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 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)

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

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

Efficient Dynamic MaxFlow Computation on GPUs
par: Kannappan, Shruthi, 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)