15 citations · 31 across the 12 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2016★ 3 cited
Plurality Consensus via Shuffling: Lessons Learned from Load Balancing
Petra Berenbrink, Tom Friedetzky, Peter Kling +2
We consider \emph{plurality consensus} in a network of nodes. Initially, each node has one of opinions. The nodes execute a (randomized) distributed protocol to agree on th…
cs.DS2012
Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time
Petra Berenbrink, Colin Cooper, Tom Friedetzky
We consider a modified random walk which uses unvisited edges whenever possible, and makes a simple random walk otherwise. We call such a walk an edge-process. We assume there is a…