2020 - SIAM Fellow For contributions to randomized algorithms and probablistic methods with applications to network and computational science.
2019 - ACM Senior Member
2019 - Fellow of the American Mathematical Society For contributions to theoretical computer science, discrete probability, network science and applications and for service to the profession.
2018 - Member of Academia Europaea
2014 - ACM Fellow For contributions to algorithms, probabilistic methods, and networks.
2012 - Fellow of the American Association for the Advancement of Science (AAAS)
1985 - Fellow of the American Society of Mechanical Engineers
Aravind Srinivasan mainly investigates Approximation algorithm, Combinatorics, Discrete mathematics, Computer network and Mathematical optimization. His Approximation algorithm study integrates concerns from other disciplines, such as Rounding, Bipartite graph and Random graph. The concepts of his Combinatorics study are interwoven with issues in Upper and lower bounds and Set cover problem.
His Discrete mathematics study incorporates themes from Routing and Combinatorial optimization. His Computer network research incorporates themes from Wireless network and Distributed computing. His Distributed computing research is multidisciplinary, relying on both Cellular network, Mobile broadband, Mobile data offloading and Femtocell.
His main research concerns Approximation algorithm, Combinatorics, Discrete mathematics, Mathematical optimization and Algorithm. Aravind Srinivasan has included themes like Scheduling, Rounding and Combinatorial optimization in his Approximation algorithm study. His work carried out in the field of Scheduling brings together such families of science as Wireless network and Distributed computing.
His research in Combinatorics intersects with topics in Parallel algorithm and Upper and lower bounds. The Discrete mathematics study combines topics in areas such as Set cover problem, Polynomial and Integer programming. When carried out as part of a general Mathematical optimization research project, his work on Linear programming, Facility location problem and Stochastic optimization is frequently linked to work in Matching, therefore connecting diverse disciplines of study.
Aravind Srinivasan focuses on Approximation algorithm, Theoretical computer science, Mathematical optimization, Combinatorics and Algorithm. His Approximation algorithm study combines topics from a wide range of disciplines, such as Discrete mathematics, Matroid, Set cover problem and Rounding. His Theoretical computer science research is multidisciplinary, incorporating perspectives in Vertex, Bipartite graph, Graph and Cluster analysis.
As part of one scientific family, he deals mainly with the area of Mathematical optimization, narrowing it down to issues related to the Distribution, and often Order. His work on Lovász local lemma as part of general Combinatorics research is often related to Negative correlation, thus linking different fields of science. The various areas that he examines in his Algorithm study include Structure and Competitive analysis.
Aravind Srinivasan mainly focuses on Competitive analysis, Approximation algorithm, Mathematical optimization, Matching and Lovász local lemma. Aravind Srinivasan combines subjects such as Linear programming, Algorithm, Bipartite graph and Artificial intelligence with his study of Competitive analysis. His research ties Outlier and Approximation algorithm together.
His work on Combinatorial optimization as part of general Mathematical optimization study is frequently linked to Impossibility, therefore connecting diverse disciplines of science. His research on Discrete mathematics and Combinatorics is centered around Lovász local lemma. His studies deal with areas such as Satisfiability, Polynomial and Solution set as well as Combinatorics.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Modelling disease outbreaks in realistic urban social networks.
Stephen Eubank;Hasan Guclu;V. S. Anil Kumar;Madhav V. Marathe.
Mobile Data Offloading through Opportunistic Communications and Social Participation
Bo Han;Pan Hui;V. S. A. Kumar;M. V. Marathe.
IEEE Transactions on Mobile Computing (2012)
Chernoff-Hoeffding Bounds for Applications with Limited Independence
Jeanette P. Schmidt;Alan Siegel;Aravind Srinivasan.
SIAM Journal on Discrete Mathematics (1995)
P 5 : a protocol for scalable anonymous communication
Rob Sherwood;Bobby Bhattacharjee;Aravind Srinivasan.
Journal of Computer Security (2005)
Splitters and near-optimal derandomization
M. Naor;L.J. Schulman;A. Srinivasan.
foundations of computer science (1995)
Cellular traffic offloading through opportunistic communications: a case study
Bo Han;Pan Hui;V.S. Anil Kumar;Madhav V. Marathe.
workshop challenged networks (2010)
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Devdatt Dubhashi;Alessandro Mei;Alessandro Panconesi;Jaikumar Radhakrishnan.
Journal of Computer and System Sciences (2005)
A Client-Driven Approach for Channel Management in Wireless LANs
A. Mishra;V. Brik;S. Banerjee;A. Srinivasan.
ieee international conference computer and communications (2006)
Innovization: innovating design principles through optimization
Kalyanmoy Deb;Aravind Srinivasan.
genetic and evolutionary computation conference (2006)
P/sup 5/ : a protocol for scalable anonymous communication
R. Sherwood;B. Bhattacharjee;A. Srinivasan.
ieee symposium on security and privacy (2002)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: