Analysis of Randomized Algorithms: A talk by Petra Berenbrink, Associate Professor of Computing Science at SFU
Thursday, March 19
2:30 – 4:00 pm
A310 on the Abbotsford UFV campus
Dr. Petra Berenbrink will present several randomized graph-based algorithms. The first algorithm is a random walk process on a graph. Here we analyse the so-called cover time of the process. The second algorithm comes from the area of game theory. The task of the selfish agents is to distribute their tasks over a set of servers. The goal of every agent is to allocate his own task to a server with minimum load. The last process is a so-called voting process which spreads opinions in a network.
For more information, email email@example.com.