139 citations · 139 across the 2 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2004★ 139 cited
Simple Distributed Weighted Matchings
Jaap-Henk Hoepman
Wattenhofer [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximum weight…
cs.DC1999
Self-stabilizing mutual exclusion on a ring, even if K=N
Jaap-Henk Hoepman
We show that, contrary to common belief, Dijkstra's self-stabilizing mutual exclusion algorithm on a ring [Dij74,Dij82] also stabilizes when the number of states per node is one le…
cs.DC1999
Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method
Harry Buhrman, Jaap-Henk Hoepman, Paul Vitanyi
We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information for almost all network topologies. In most models fo…