v1v2v3 (latest)

Computing Shortest Paths and Diameter in the Hybrid Network Model

15 June 2020

Papers citing "Computing Shortest Paths and Diameter in the Hybrid Network Model"

32 / 32 papers shown

Title
Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter Andreas Padalkin Christian Scheideler 84 5 0 19 Feb 2024
Byzantine Resilient Computing with the Cloud Songlin Wei JIazhao Zhang Shachar Meir David Peleg Srikkanth Ramachandran He Wang 101 1 0 28 Sep 2023
Towards Universally Optimal Shortest Paths Algorithms in the Hybrid Model P. Schneider 94 0 0 09 Jun 2023
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model Yi-Jun Chang Oren Hecht Dean Leitersdorf 50 0 0 13 Apr 2023
Routing Schemes for Hybrid Communication Networks Samantha R. Coy A. Czumaj Christian Scheideler P. Schneider Julian Werthmann 90 3 0 11 Oct 2022
Computing Power of Hybrid Models in Synchronous NetworksInternational Conference on Principles of Distributed Systems (OPODIS), 2022 Pierre Fraigniaud Pedro Montealegre Pablo Paredes I. Rapaport Martín Ríos-Wilson Ioan Todinca 115 2 0 04 Aug 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 112 29 0 12 Apr 2022
Near-Shortest Path Routing in Hybrid Communication NetworksInternational Conference on Principles of Distributed Systems (OPODIS), 2022 Samantha R. Coy A. Czumaj Michel Feldmann Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider Martijn Struijs 67 14 0 16 Feb 2022
Routing Schemes and Distance Oracles in the Hybrid ModelInternational Symposium on Distributed Computing (DISC), 2022 Fabian Kuhn P. Schneider 56 11 0 14 Feb 2022
Distributed Computing With the CloudSafety-critical Systems Symposium (SSS), 2021 Y. Afek Gal Giladi B. Patt-Shamir 97 13 0 27 Sep 2021
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts Ioannis Anagnostides Christoph Lenzen Bernhard Haeupler Goran Zuzic Themis Gouleakis 204 8 0 11 Sep 2021
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model Ioannis Anagnostides Themis Gouleakis 108 13 0 03 Aug 2021
Efficient Stepping Algorithms and Implementations for Parallel Shortest PathsACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021 Xiaojun Dong Yan Gu Yihan Sun Yunming Zhang 120 37 0 13 May 2021
Near-Optimal Scheduling in the Congested CliqueColloquium on Structural Information & Communication Complexity (SIROCCO), 2021 K. Censor-Hillel Yannic Maus Volodymyr Polosukhin 71 1 0 14 Feb 2021
Distance Computations in the Hybrid Network Model via Oracle SimulationsSymposium on Theoretical Aspects of Computer Science (STACS), 2020 K. Censor-Hillel Dean Leitersdorf Volodymyr Polosukhin 113 18 0 26 Oct 2020
Time-Optimal Construction of Overlay NetworksDistributed computing (Distrib. Comput.), 2020 Thorsten Götte Kristian Hinnenthal Christian Scheideler Julian Werthmann 120 24 0 08 Sep 2020
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs Michel Feldmann Kristian Hinnenthal Christian Scheideler 184 23 0 02 Jul 2020
Shortest Paths in a Hybrid Network ModelACM-SIAM Symposium on Discrete Algorithms (SODA), 2019 John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 102 33 0 04 Sep 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 132 55 0 14 Mar 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear TimeSymposium on the Theory of Computing (STOC), 2018 A. Bernstein K. Kirchberg 135 54 0 08 Nov 2018
Deterministic Distributed Ruling Sets of Line Graphs Fabian Kuhn Yannic Maus Simon Weidner 71 25 0 18 May 2018
$A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds$ A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds U. Agarwal V. Ramachandran Valerie King Matteo Pontecorvi 95 38 0 15 Apr 2018
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model K. Censor-Hillel Dean Leitersdorf Elia Turner 145 35 0 13 Feb 2018
$Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ Rounds$ Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ RoundsIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2017 Chien-Chung Huang Danupon Nanongkai Thatchaphol Saranurak 140 45 0 13 Aug 2017
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems F. Gall 96 49 0 09 Aug 2016
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths Monika Henzinger Sebastian Krinninger Danupon Nanongkai 240 112 0 27 Apr 2015
Algebraic Methods in the Congested Clique K. Censor-Hillel P. Kaski Janne H. Korhonen Christoph Lenzen A. Paz Jukka Suomela 86 161 0 17 Mar 2015
Fast Partial Distance Estimation and ApplicationsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2014 Christoph Lenzen B. Patt-Shamir 113 62 0 26 Dec 2014
Approximation of Distances and Shortest Paths in the Broadcast Congest CliqueInternational Conference on Principles of Distributed Systems (OPODIS), 2014 S. Holzer N. Pinsker 136 58 0 10 Dec 2014
Fast Routing Table Construction Using Small MessagesSymposium on the Theory of Computing (STOC), 2012 Christoph Lenzen B. Patt-Shamir 131 76 0 21 Oct 2012
Optimal Deterministic Routing and Sorting on the Congested CliqueACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2012 Christoph Lenzen 177 172 0 08 Jul 2012
Distributed Verification and Hardness of Distributed Approximation Atish Das Sarma S. Holzer Liah Kor Amos Korman Danupon Nanongkai Gopal Pandurangan David Peleg Roger Wattenhofer 260 349 0 12 Nov 2010