Lunches‎ > ‎

May 18: Probabilistic recurrences

posted May 18, 2015, 3:20 AM by Dirk Oliver Theis
Today, Abdullah will talk about random recursive relations, and what can be said about expectation and upper tail based on very general assumptions. The main results go back to a paper of Karp from the 1990s.
The motivation behind studying these relations lies in the analysis of randomized algorithms.
Comments