Aravind Srinivasan
Aravind Srinivasan | |
|---|---|
| Born | 1968 (age 56–57) |
| Nationality | American |
| Alma mater | |
| Known for | Randomized algorithms, algorithmic fairness, networks, computational epidemiology |
| Awards |
|
| Scientific career | |
| Fields | Computer science, algorithms, probabilistic methods, data science |
| Institutions | University of Maryland, College Park |
| Doctoral advisor | David Shmoys |
| Website | https://www.cs.umd.edu/~srin/ |
Aravind Srinivasan is a Distinguished University Professor of computer science at the University of Maryland, College Park, with simultaneous appointments in the Department of Computer Science, UMIACS (University of Maryland Institute for Advanced Computer Studies), and AMSC. His research focuses on algorithms particularly randomized and probabilistic methods and their applications in fields ranging from data science, health, and algorithmic fairness to networks, cloud computing, and sustainable systems.
Education and academic career
Srinivasan earned his B.Tech. from Indian Institute of Technology Madras (1989) and his M.S. and Ph.D. in Computer Science from Cornell University (1993). He conducted postdoctoral research at the Institute for Advanced Study (Princeton) and DIMACS at Rutgers, worked at the National University of Singapore and in industrial research at Bell Labs, and joined the University of Maryland faculty in the early 2000s.[1]
Research
His research spans randomized and probabilistic algorithms,[2] combinatorial and continuous optimization, and applications in computational epidemiology,[3] genomics, Internet economy, social networks, energy systems, and fairness in AI.[4]
He has held editorial leadership roles, serving as Editor‑in‑Chief of ACM Transactions on Algorithms (2014–2020),[5] Editor of Theory of Computing (2006–2019),[6] Editor of Journal of Discrete Algorithms (Elsevier) (2004–2012) and as an Editor for the Journal of the IISc[7]
Honors and awards
- Fellows of ACM (2014),[8] IEEE (2010),[9] AAAS (2012),[10] AMS (2019),[11] EATCS (2017)[12] and SIAM (2020)[13]
- Distinguished University Professor, University of Maryland (2020)[14]
- Distinguished Alumnus Award from IIT Madras (2016)[1]
- Recipient of the Dijkstra Prize and Danny Lewin Award[15]
- Distinguished Career Award in Computer Science from the Washington Academy of Sciences (2021)[14][16]
Professional service
He served as Vice Chair of the IEEE Technical Committee on Mathematical Foundations of Computing (2015–2017), has held visiting positions varioys institutions, including Amazon Scholar since 2019.[17]
Selected Bibliography
Articles
- Eubank, Stephen; Guclu, Hasan; Anil Kumar, V. S.; Marathe, Madhav V.; Srinivasan, Aravind; Toroczkai, Zoltán; Wang, Nan (13 May 2004). "Modelling disease outbreaks in realistic urban social networks". Nature. 429 (6988): 180–184. Bibcode:2004Natur.429..180E. doi:10.1038/nature02541. PMID 15141212.
- Han, Bo; Hui, Pan; Kumar, V.S. Anil; Marathe, Madhav V.; Shao, Jianhua; Srinivasan, Aravind (May 2012). "Mobile Data Offloading through Opportunistic Communications and Social Participation". IEEE Transactions on Mobile Computing. 11 (5): 821–834. Bibcode:2012ITMC...11..821H. doi:10.1109/TMC.2011.101.
- Schmidt, Jeanette P.; Siegel, Alan; Srinivasan, Aravind (May 1995). "Chernoff–Hoeffding Bounds for Applications with Limited Independence". SIAM Journal on Discrete Mathematics. 8 (2): 223–250. doi:10.1137/S089548019223872X.
- Srinivasan, A.; Ham, T.; Malik, S.; Brayton, R.K. (1990). "Algorithms for discrete function manipulation". 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers. pp. 92–95. doi:10.1109/ICCAD.1990.129849. ISBN 0-8186-2055-2.
- Naor, M.; Schulman, L.J.; Srinivasan, A. (1995). "Splitters and near-optimal derandomization". Proceedings of IEEE 36th Annual Foundations of Computer Science: 182–191. doi:10.1109/SFCS.1995.492475. ISBN 0-8186-7183-1.
Patents
- Systems and methods for mapping a term to a vector representation in a semantic space.[18]
- Allocation of workloads in dynamic worker fleet.[19]
- Fast and scalable approximation methods for finding minimum cost flows with shared recovery strategies, and system using same.[20]
References
- ^ a b "Dr. Aravind Srinivasan - Office of Alumni & Corporate Relations". acr.iitm.ac.in. Indian Institute of Technology Madras. Retrieved 15 August 2025.
- ^ Srinivasan, A. (October 2001). "Distributions on level-sets with applications to approximation algorithms". Proceedings 42nd IEEE Symposium on Foundations of Computer Science. pp. 588–597. doi:10.1109/SFCS.2001.959935. ISBN 0-7695-1390-5.
- ^ Babay, Amy E.; Dinitz, Michael; Srinivasan, Aravind; Tsepenekas, Leonidas; Vullikanti, Anil (3 May 2022). "Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks". Proceedings of the 25th International Conference on Artificial Intelligence and Statistics. PMLR: 11641–11654.
- ^ "🔍 How do we ensure fairness in AI-driven decisions? | Department of Computer Science, UMD posted on the topic | LinkedIn". www.linkedin.com. University of Maryland. 15 March 2025.[self-published]
- ^ "ACM Transactions on Algorithms Welcomes Aravind Srinivasan as New Editor-in-Chief | ACM MemberNet - August 28, 2014". www.acm.org. Association for Computing Machinery. Retrieved 15 August 2025.
- ^ "Editors: Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science". theoryofcomputing.org. Retrieved 15 August 2025.
- ^ "Editorial board | Journal of the Indian Institute of Science". SpringerLink. Springer Nature. Retrieved 15 August 2025.
- ^ "ACM Fellows USA - 2014 | Aravind Srinivasan". awards.acm.org. 2014.
- ^ "IEEE Fellows Directory". services27.ieee.org. IEEE. Retrieved 15 August 2025.
- ^ "Srinivasan Named AAAS Fellow". www.cs.umd.edu. 9 December 2012.
- ^ "Professor Aravind Srinivasan named AMS Fellow for 2019". www.cs.umd.edu. 1 November 2018.
- ^ Chita, Efi. "EATCS Fellows class of 2017 named". European Association for Theoretical Computer Science. Retrieved 15 August 2025.
- ^ "SIAM Announces Class of 2020 Fellows | SIAM". Society for Industrial and Applied Mathematics. 31 March 2020.
- ^ a b "Aravind Srinivasan Wins Distinguished Career Award from the Washington Academy of Sciences". www.cs.umd.edu. 11 August 2021.
- ^ Dubhashi, Devdatt; Johansson, Fredrik; Kahl, Fredrik; Picchini, Umberto (12 November 2020). "Aravind Srinivasan - Fairness in AI and in Algorithms". Chalmers AI Talks.
- ^ "Awards Banquet 2021 | Washington Academy of Sciences". www.washacadsci.org. Washington Academy of Sciences. Retrieved 15 August 2025.
- ^ Weibo, Sina (11 September 2020). "Aravind Srinivasan: Amazon Scholar focuses on combinatorial optimization, algorithms, and AI". Amazon Science.
- ^ Barve, Rakesh; Anand, Akash; PURANIK, Arjun; Aravamudan, Murali; Soundararajan, Venkataramanan; Srinivasan, Aravind (16 July 2024). "Systems and methods for mapping a term to a vector representation in a semantic space". patents.google.com.
- ^ Sathe, Mihir; Srinivasan, Aravind; Nekkar, Pranav Rao Perampalli (2 January 2024). "Allocation of workloads in dynamic worker fleet". patents.google.com.
- ^ Fleischer, Lisa Karen; Saniee, Iraj; Shepherd, Frederick Bruce; Srinivasan, Aravind (9 October 2007). "Fast and scalable approximation methods for finding minimum cost flows with shared recovery strategies, and system using same". patents.google.com.
External links
- Aravind Srinivasan publications indexed by Google Scholar