[Lowerbounds, Upperbounds]

Algorithms are everywhere.

Speaker: Abraham Flaxman

Time: Wednesday 12-1pm

Place: NSH 1507

Title: Handy distributions for average-case anaylsis

Abstract:
Since I managed to sneak in practice for my job talk at a Theory Lunch last month, (thanks for the feedback everybody!), I will regale you with an informal survey of some of the many distributions for random graphs and other structures that have been popular in average-case analysis of combinatorial algorithms.

No Comments :(