ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2202.08008
  4. Cited By
Near-Shortest Path Routing in Hybrid Communication Networks

Near-Shortest Path Routing in Hybrid Communication Networks

16 February 2022
Samantha R. Coy
A. Czumaj
Michel Feldmann
Kristian Hinnenthal
Fabian Kuhn
Christian Scheideler
P. Schneider
Martijn Struijs
ArXiv (abs)PDFHTML

Papers citing "Near-Shortest Path Routing in Hybrid Communication Networks"

7 / 7 papers shown
Title
Byzantine Resilient Computing with the Cloud
Byzantine Resilient Computing with the Cloud
Songlin Wei
JIazhao Zhang
Shachar Meir
David Peleg
Srikkanth Ramachandran
He Wang
51
0
0
28 Sep 2023
Distributed Construction of Near-Optimal Compact Routing Schemes for
  Planar Graphs
Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
Jinfeng Dou
Thorsten Götte
Henning Hillebrandt
Christian Scheideler
Julian Werthmann
24
2
0
04 May 2023
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed
  Model
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model
Yi-Jun Chang
Oren Hecht
Dean Leitersdorf
19
0
0
13 Apr 2023
Routing Schemes for Hybrid Communication Networks
Routing Schemes for Hybrid Communication Networks
Samantha R. Coy
A. Czumaj
Christian Scheideler
P. Schneider
Julian Werthmann
28
3
0
11 Oct 2022
Computing Power of Hybrid Models in Synchronous Networks
Computing Power of Hybrid Models in Synchronous Networks
Pierre Fraigniaud
Pedro Montealegre
Pablo Paredes
I. Rapaport
Martín Ríos-Wilson
Ioan Todinca
55
2
0
04 Aug 2022
Routing Schemes and Distance Oracles in the Hybrid Model
Routing Schemes and Distance Oracles in the Hybrid Model
Fabian Kuhn
P. Schneider
18
10
0
14 Feb 2022
Almost Universally Optimal Distributed Laplacian Solvers via
  Low-Congestion Shortcuts
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts
Ioannis Anagnostides
Christoph Lenzen
Bernhard Haeupler
Goran Zuzic
Themis Gouleakis
60
8
0
11 Sep 2021
1