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 machine learning, data science, health, and algorithmic fairness to networks, cloud computing, and sustainable systems.
Distinguished Career Award in Computer Science from the Washington Academy of Sciences (2021)[16][17]
Selected publications
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. PMID15141212.
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.
Gandhi, R.; Khuller, S.; Parathasarathy, S.; Srinivasan, A. (May 2006). "Dependent Rounding and its Applications to Approximation Algorithms". Journal of the ACM. 53 (3): 324–360. doi:10.1145/1147954.1147956.
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]
↑ 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. ISBN0-7695-1390-5.
This page is based on this Wikipedia article Text is available under the CC BY-SA 4.0 license; additional terms may apply. Images, videos and audio are available under their respective licenses.