Ayalvadi Ganesh

Gossip and its uses

I'll talk about how to spread gossip more quickly, about Steiner trees on the complete graph with random edge weights, and about the use of gossip in a distributed algorithm. All the terms in the abstract will be introduced during the talk.