12 citations · 25 across the 12 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DC2020
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Michael Feldmann, Kristian Hinnenthal, Christian Scheideler
We consider the problem of computing shortest paths in hybrid networks, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc conn…
cs.DC2020★ 1 cited
Time- and Space-Optimal Clock Synchronization in the Beeping Model
Michael Feldmann, Ardalan Khazraei, Christian Scheideler
We consider the clock synchronization problem in the (discrete) beeping model: Given a network of nodes with each node having a clock value , the goa…