Cover Image

Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Filtser, Arnold, Fischer, Orr
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-Optimal Resilient Labeling Schemes
by: Censor-Hillel, Keren, et al.
Published: (2024)

All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
by: Fischer, Orr, et al.
Published: (2025)

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)

Distributed Interactive Proofs for Planarity with Log-Star Communication
by: Gil, Yuval, et al.
Published: (2025)

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

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)

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

Encoding Schemes for Parallel In-Place Algorithms
by: Hutton, Chase, et al.
Published: (2025)

Optimal Deterministic Rendezvous in Labeled Lines
by: Bourreau, Yann, et al.
Published: (2025)

Parallel and (Nearly) Work-Efficient Dynamic Programming
by: Ding, Xiangyun, et al.
Published: (2024)

Near-optimal population protocols on bounded-degree trees
by: Rybicki, Joel, et al.
Published: (2026)

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
by: Izumi, Taisuke, et al.
Published: (2023)

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

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
by: Manoharan, Vignesh, et al.
Published: (2022)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
by: Boneh, Itai, et al.
Published: (2025)

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
by: Censor-Hillel, Keren, et al.
Published: (2023)

Distributed Stochastic Graph Algorithms
by: Censor-Hillel, Keren, et al.
Published: (2026)

Optimal Distributed Replacement Paths
by: Chang, Yi-Jun, et al.
Published: (2025)

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

Distributed Graph Algorithms with Predictions
by: Boyar, Joan, et al.
Published: (2025)

Fast Deterministic Distributed Degree Splitting
by: Maus, Yannic, et al.
Published: (2026)

Meta-Theorems for Cuttable Distributed Problems
by: Bonamy, Marthe, et al.
Published: (2026)

Distributed Maximum Flow in Planar Graphs
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)

Distributed Subgraph Finding: Progress and Challenges
by: Censor-Hillel, Keren
Published: (2022)

Towards Optimal Distributed Delta Coloring
by: Jakob, Manuel, et al.
Published: (2025)

Local Density and its Distributed Approximation
by: Christiansen, Aleksander Bjørn, et al.
Published: (2024)

$k$-Center Clustering in Distributed Models
by: Biabani, Leyla, et al.
Published: (2024)

Distributed Santa Claus via Global Rounding
by: de Vos, Tijn, et al.
Published: (2026)

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

On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)

Congested Clique Counting for Local Gibbs Distributions
by: Sobel, Joshua Z.
Published: (2025)

The Local Information Cost of Distributed Graph Spanners
by: Robinson, Peter
Published: (2020)

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

Distributed Delta-Coloring under Bandwidth Limitations
by: Maus, Yannic, et al.
Published: (2024)

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

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
by: Flin, Maxime, et al.
Published: (2026)

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

Distributed Lovász Local Lemma under Bandwidth Limitations
by: Halldórsson, Magnús M., et al.
Published: (2024)

Distributed Reductions for the Maximum Weight Independent Set Problem
by: Borowitz, Jannick, et al.
Published: (2025)

Breaking Barriers for Distributed MIS by Faster Degree Reduction
by: Khoury, Seri, et al.
Published: (2025)