Aravind Srinivasan is a professor of Computer Science, UMIACS, and AMSC here at the University. He serves as Editor-In- Chief of the ACM Transactions on Algorithms, Managing Editor for Theory of Computing, andan Associate Editor for Networks. He also serves as Vice Chair of the IEEE Technical Committee on the Mathematical Foundations of Computing.
Srinivasan is a Fellow of three professional societies: ACM, AAAS, and IEEE. He received a Distinguished Alumnus Award from his alma mater 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.
His speech abstract is as follows: The Lovasz Local Lemma (LLL) is a powerful probabilistic tool in computer science and in combinatorics. Starting with the breakthrough of Moser and Tardos in 2009, there has been much progress in our understanding of the algorithmic aspects of the LLL. I will survey some of this work; prior knowledge of the LLL will not be necessary.
The Department welcomes comments, suggestions and corrections. Send email to editor [at] cs.umd.edu.