BARC talk by Aravind Srinivasan

Friday, May 15, 2026, Aravind Srinivasan, Professor at the University of Maryland, USA, will be giving at talk on "Generating and utilizing various types of negative dependence".

Abstract:
Various notions of negative dependence arise naturally and/or are desirable in various random processes and randomized algorithms. We survey how to generate and utilize a few such notions of negative dependence, and sketch applications to concentration inequalities, fairness, and approximation algorithms.

Bio:
Aravind Srinivasan is a Distinguished University Professor and Professor with the Department of Computer Science at the University of Maryland, College Park. He received his B. Tech. from the Indian Institute of Technology, Madras, and his Ph.D. from Cornell University. His research interests include algorithms, probabilistic methods, data science, network science, machine learning, and optimization: theory, and applications in areas including AI interpretability and fairness, health, E-commerce, and cloud computing. He is a Fellow of the ACM, AAAS, IEEE, AMS, EATCS, and SIAM. 

Host:
Srikanth Srinivasan