v1v2v3 (latest)

Distributed Verification and Hardness of Distributed Approximation

12 November 2010

Roger Wattenhofer

Papers citing "Distributed Verification and Hardness of Distributed Approximation"

50 / 141 papers shown

Title
Local Distance-Preserving Node Embeddings and Their Performance on Random Graphs My Le Luana Ruiz Souvik Dhara 67 0 0 11 Apr 2025
The Singular Optimality of Distributed Computation in LOCAL Fabien Dufoulon Gopal Pandurangan Peter Robinson Michele Scquizzato 66 2 0 11 Nov 2024
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP M. Ghaffari Anton Trygub 56 4 0 23 Sep 2024
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs Maxime Flin Magnús M. Halldórsson Alexandre Nolin 63 2 0 20 Aug 2024
On the Power of Graphical Reconfigurable Circuits Y. Emek Yuval Gil Noga Harlev 39 1 0 20 Aug 2024
$k$ -Center Clustering in Distributed Models Leyla Biabani A. Paz 22 1 0 25 Jul 2024
Model-Agnostic Approximation of Constrained Forest Problems Corinna Coupette Alipasha Montaseri Christoph Lenzen 22 0 0 14 Jul 2024
Deterministic Expander Routing: Faster and More Versatile Yi-Jun Chang Shang-En Huang Hsin-Hao Su 89 3 0 06 May 2024
Fast Broadcast in Highly Connected Networks Shashwat Chandra Yi-Jun Chang Michal Dory Mohsen Ghaffari Dean Leitersdorf 48 1 0 19 Apr 2024
Towards singular optimality in the presence of local initial knowledge Hongyan Ji Sriram V. Pemmaraju 80 1 0 22 Feb 2024
On Distributed Computation of the Minimum Triangle Edge Transversal K. Censor-Hillel Majd Khoury 90 0 0 21 Feb 2024
Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter Andreas Padalkin Christian Scheideler 43 3 0 19 Feb 2024
Tight Bounds on the Message Complexity of Distributed Tree Verification S. Kutten Peter Robinson Ming Ming Tan 44 1 0 22 Jan 2024
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model Vignesh Manoharan V. Ramachandran 39 3 0 16 Aug 2023
A Distributed Conductance Tester Without Global Information Collection Tugkan Batu Amitabh Trehan Chhaya Trehan 15 0 0 23 May 2023
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability Armando Castañeda Gilde Valeria Rodríguez 18 3 0 06 Jan 2023
$(1-ε)$ -Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings Shang-En Huang Hsin-Hao Su 49 2 0 29 Dec 2022
A Nearly Time-Optimal Distributed Approximation of Minimum Cost $k$ -Edge-Connected Spanning Subgraph Michal Dory M. Ghaffari 55 2 0 09 Nov 2022
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances Václav Rozhon Bernhard Haeupler A. Martinsson Christoph Grunau Goran Zuzic 92 14 0 28 Oct 2022
Routing Schemes for Hybrid Communication Networks Samantha R. Coy A. Czumaj Christian Scheideler P. Schneider Julian Werthmann 21 3 0 11 Oct 2022
Distributed Quantum Interactive Proofs Franccois Le Gall Masayuki Miyamoto H. Nishimura 49 8 0 04 Oct 2022
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm Fabien Dufoulon S. Kutten W. Moses Gopal Pandurangan David Peleg 68 5 0 03 Oct 2022
Computing Power of Hybrid Models in Synchronous Networks Pierre Fraigniaud Pedro Montealegre Pablo Paredes I. Rapaport Martín Ríos-Wilson Ioan Todinca 50 2 0 04 Aug 2022
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks Xudong Wu Penghui Yao MQ 58 12 0 06 Jun 2022
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs Taisuke Izumi Naoki Kitamura Takamasa Naruse Gregory Schwartzman 49 5 0 30 May 2022
Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model Vignesh Manoharan V. Ramachandran 59 4 0 30 May 2022
Asynchronous Neural Networks for Learning in Graphs Lukas Faber Roger Wattenhofer GNN 54 3 0 24 May 2022
Awake Complexity of Distributed Minimum Spanning Tree John E. Augustine W. Moses Gopal Pandurangan 43 4 0 18 Apr 2022
$Undirected $(1+\varepsilon)$-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms$ Undirected $(1+\varepsilon)$ -Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms Václav Rozhon Christoph Grunau Bernhard Haeupler Goran Zuzic Jason Li 51 29 0 12 Apr 2022
Routing Schemes and Distance Oracles in the Hybrid Model Fabian Kuhn P. Schneider 13 10 0 14 Feb 2022
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters Janne H. Korhonen Amir Nikabadi GNN 82 4 0 14 Sep 2021
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts Ioannis Anagnostides Christoph Lenzen Bernhard Haeupler Goran Zuzic Themis Gouleakis 51 8 0 11 Sep 2021
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model Ioannis Anagnostides Themis Gouleakis 44 11 0 03 Aug 2021
Low-Congestion Shortcuts in Constant Diameter Graphs Shimon Kogan M. Parter 28 11 0 03 Jun 2021
Locally Checkable Labelings with Small Messages Alkida Balliu K. Censor-Hillel Yannic Maus Dennis Olivetti Jukka Suomela 28 16 0 12 May 2021
Communication Costs in a Geometric Communication Network Sima Hajiaghaei Shanjani Valerie King GNN 37 0 0 27 Apr 2021
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 55 5 0 25 Apr 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm S. Forster Gramoz Goranci Yang P. Liu Richard Peng Xiaorui Sun Mingquan Ye 53 22 0 31 Dec 2020
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 69 13 0 10 Nov 2020
Reactive Proof Labeling Schemes for Distributed Decision Jiaqi Chen Shlomi Dolev S. Kutten 28 0 0 04 Nov 2020
Distance Computations in the Hybrid Network Model via Oracle Simulations K. Censor-Hillel Dean Leitersdorf Volodymyr Polosukhin 57 17 0 26 Oct 2020
Low-Congestion Shortcuts for Graphs Excluding Dense Minors M. Ghaffari Bernhard Haeupler 28 24 0 07 Aug 2020
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization Yi-Jun Chang Thatchaphol Saranurak 28 34 0 29 Jul 2020
Local Certification of Graphs with Bounded Genus Laurent Feuilloley Pierre Fraigniaud Pedro Montealegre I. Rapaport É. Rémila Ioan Todinca 52 24 0 16 Jul 2020
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs Michel Feldmann Kristian Hinnenthal Christian Scheideler 32 22 0 02 Jul 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 76 30 0 15 Jun 2020
Distributed Approximation on Power Graphs R. Bar-Yehuda K. Censor-Hillel Yannic Maus Shreyas Pai Sriram V. Pemmaraju 51 9 0 06 Jun 2020
Input-Dynamic Distributed Algorithms for Communication Networks Klaus-Tycho Foerster Janne H. Korhonen A. Paz Joel Rybicki Stefan Schmid 29 3 0 15 May 2020
Compact Distributed Certification of Planar Graphs Laurent Feuilloley Pierre Fraigniaud I. Rapaport É. Rémila Pedro Montealegre Ioan Todinca 49 30 0 12 May 2020
Distributed Weighted Min-Cut in Nearly-Optimal Time Michal Dory Yuval Efron Sagnik Mukhopadhyay Danupon Nanongkai 63 22 0 20 Apr 2020