Abstract: I will discuss the role of algorithms and probabilistic methods in combinatorial optimization and public health, with an emphasis on networked phenomena. This includes research on the Lovasz Local Lemma and in combinatorial optimization, the role of networked phenomena in public-health preparedness, and algorithms in E-commerce. My goal is to articulate the power of algorithms, probabilistic methods, and networked phenomena in scientific, technological, and societal applications.
Bio: Arvind Srinivasan is a Professor of Computer Science at the University of Maryland, College Park. He received his undergraduate degree from the Indian Institute of Technology, Madras, and his Ph.D. from Cornell University. He was a postdoctoral researcher at the Institute for Advanced Study in Princeton and at DIMACS. He has also worked at Bell Labs.
Aravind Srinivasan's 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 fields including the social Web, machine learning, public health, biology, E-commerce, and energy. He is Editor-in-Chief of the ACM Transactions on Algorithms, a Managing Editor for Theory of Computing, and an Associate Editor of Networks. His papers have been (co-)recipients of the Best Paper/Best Student Paper Awards at various conferences in areas including algorithms, networking, and social networks. Srinivasan is a Fellow of four professional societies: ACM, AAAS, IEEE and EATCS. He received a Distinguished Alumnus Award from IIT Madras. He also received the Distinguished Faculty Award from the Board of Visitors of the College of Computing, Mathematical, and Natural Sciences (University of Maryland) in 2016. See: http://www.cs.umd.edu/~srin/