4 citations · 11 across the 12 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DC2013
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading
Zeyu Guo, He Sun
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander…
cs.CC2013
Randomness-efficient Curve Samplers
Zeyu Guo
Curve samplers are sampling algorithms that proceed by viewing the domain as a vector space over a finite field, and randomly picking a low-degree curve in it as the sample. Curve…
cs.DS2013
Randomness-Efficient Rumor Spreading
Zeyu Guo, He Sun
We study the classical rumor spreading problem, which is used to spread information in an unknown network with nodes. We present the first protocol for any expander graph w…