56 citations · 98 across the 6 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2002
On the Importance of Having an Identity or, is Consensus really Universal?
Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri +1
We show that Naming-- the existence of distinct IDs known to all-- is a hidden but necessary assumption of Herlihy's universality result for Consensus. We then show in a very preci…
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…