Imagen de Portada

Near-Optimal Resilient Labeling Schemes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Censor-Hillel, Keren, Huberman, Einav
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Distributed Subgraph Finding: Progress and Challenges
por: Censor-Hillel, Keren
Publicado: (2022)

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

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

Computing in a Faulty Congested Clique
por: Censor-Hillel, Keren, et al.
Publicado: (2025)

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

Faster Cycle Detection in the Congested Clique
por: Censor-Hillel, Keren, et al.
Publicado: (2024)

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

When MIS and Maximal Matching are Easy in the Congested Clique
por: Censor-Hillel, Keren, et al.
Publicado: (2025)

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

Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
por: Filtser, Arnold, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

Towards Optimal Distributed Delta Coloring
por: Jakob, Manuel, et al.
Publicado: (2025)

Time-Optimal and Energy-Efficient Deterministic Consensus
por: Meir, Shachar, et al.
Publicado: (2025)

Optimal local certification on graphs of bounded pathwidth
por: Baterisna, Dan Alden, et al.
Publicado: (2025)

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

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

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

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
por: Dhulipala, Laxman, et al.
Publicado: (2024)

Message Optimality and Message-Time Trade-offs for APSP and Beyond
por: Dufoulon, Fabien, et al.
Publicado: (2025)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
por: Chang, Yi-Jun, et al.
Publicado: (2023)

The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
por: Lechowicz, Adam, et al.
Publicado: (2023)

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed?
por: Hajiaghayi, Mohammad T., et al.
Publicado: (2024)

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

Improved All-Pairs Approximate Shortest Paths in Congested Clique
por: Bui, Hong Duc, et al.
Publicado: (2024)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
por: Yang, Mingqi
Publicado: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
por: Wang, Letong, et al.
Publicado: (2024)

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

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
por: Liu, Quanquan C., et al.
Publicado: (2024)

Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
por: Prokopenko, Andrey, et al.
Publicado: (2024)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
por: Pourdamghani, Arash, et al.
Publicado: (2024)

Parallel Integer Sort: Theory and Practice
por: Dong, Xiaojun, et al.
Publicado: (2024)