February 10, 2011 - Aravind Srinivasan

Algorithms, Randomness, and Networks: Confluence and Applications

Time: 10:45 am - 11:45 am


We will discuss the role of algorithms and probabilistic methods in combinatorial optimization and public health, with an emphasis on networked phenomena. This includes recent and ongoing research on the Lovasz Local Lemma, the role of networked phenomena in public-health preparedness, and algorithmic issues in wireless networking. Our goal is to articulate the power of algorithms, probabilistic methods, and networked phenomena in scientific, technological, and societal applications.


Aravind Srinivasan is a Professor with the Department of Computer Science and the Institute for Advanced Computer Studies at the University of Maryland, College Park. His research interests are in randomized algorithms, networking, social networks, and combinatorial optimization, as well as in the growing confluence of algorithms, networks, and randomness in society, in fields including the social Web and public health. He has published several papers in these areas, in journals including Nature, Journal of the ACM, IEEE/ACM Transactions on Networking, and the SIAM Journal on Computing. He is an editor of four journals, and is an IEEE Fellow.


Rao Kosaraju