Aravind Srinivasan

Professor
3263 A.V. Williams Building
(301) 405-2695
(301) 405-6709
Education: 
Ph.D. Cornell University (Computer Science)
Special Awards/Honors: 
IEEE Fellow, ACM Fellow
Biography: 

Aravind Srinivasan is a professor in the Department of Computer Science.

His research interests include randomized algorithms, networking, social networks, and combinatorial optimization, as well as the growing confluence of algorithms, networks, and randomness in society, including the fields of social media and public health. He has published several papers in these areas in journals including Nature, the Journal of the ACM, IEEE/ACM Transactions on Networking, and the SIAM Journal on Computing.

Srinivasan is an editor of four journals and has served on the program committees of various conferences. He was a co-recipient of the Best Student Paper Award at ACM STOC 1992, and received an IBM Graduate Fellowship during his doctoral studies.

Srinivasan was named an ACM Fellow in 2015. He is also an IEEE Fellow.

Srinivasan received his undergraduate degree from the Indian Institute of Technology, Madras, and his doctorate from Cornell University, both in computer science. He was a postdoctoral researcher at the Institute for Advanced Study in Princeton and at DIMACS. Additionally, Srinivasan has worked in industrial research at Bell Labs.

Publications

2012


Barrett C, Beckman R, Bisset K, Chen J, DuBois T, Eubank S, Kumar AVS, Lewis B, Marathe MV, Srinivasan A et al..  2012.  Optimizing epidemic protection for socially essential workers. Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium.
:31-40.

Han B, Hui P, Kumar VSA, Marathe MV, Shao J, Srinivasan A.  2012.  Mobile Data Offloading through Opportunistic Communications and Social Participation. Mobile Computing, IEEE Transactions on. 11(5):821-834.

Narayanan I, Sarangan V, Vasan A, Srinivasan A, Sivasubramaniam A.  2012.  Networking lessons: From computers to water. 2012 Fourth International Conference on Communication Systems and Networks (COMSNETS).
:1-6.

2011


DuBois T, Golbeck J, Srinivasan A.  2011.  Predicting Trust and Distrust in Social Networks. Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom).
:418-424.

Pei G, Anil Kumar VS, Parthasarathy S, Srinivasan A.  2011.  Approximation algorithms for throughput maximization in wireless networks with delay constraints. 2011 Proceedings IEEE INFOCOM.
:1116-1124.

Srinivasan A.  2011.  Local Balancing Influences Global Structure in Social Networks. Proceedings of the National Academy of SciencesPNAS. 108(5):1751-1752.

Haeupler B, Saha B, Srinivasan A.  2011.  Article 28 (28 pages)-New Constructive Aspects of the Lovász Local Lemma. Journal of the ACM-Association for ComputingMachinery. 58(6)

Chafekar D, Anil Kumar V, Marathe M, Parthasarathy S, Srinivasan A.  2011.  Capacity of wireless networks under SINR interference constraints. Wireless Networks. 17(7):1605-1624.

Azar Y, Mądry A, Moscibroda T, Panigrahi D, Srinivasan A.  2011.  Maximum bipartite flow in networks with adaptive channel width. Theoretical Computer Science. 412(24):2577-2587.

2010


Han B, Hui P, Srinivasan A.  2010.  Mobile data offloading in metropolitan area networks. SIGMOBILE Mob. Comput. Commun. Rev.. 14(4):28-30.

Byrka J, Srinivasan A, Swamy C.  2010.  Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization. 6080:244-257.

Haeupler B, Saha B, Srinivasan A.  2010.  New Constructive Aspects of the Lovasz Local Lemma. 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS).
:397-406.

Bansal N, Korula N, Nagarajan V, Srinivasan A.  2010.  On k-Column Sparse Packing Programs. Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization. 6080:369-382.

Han B, Hui P, Kumar AVS, Marathe MV, Pei G, Srinivasan A.  2010.  Cellular traffic offloading through opportunistic communications: a case study. Proceedings of the 5th ACM workshop on Challenged networks.
:31-38.

2009


DuBois T, Golbeck J, Kleint J, Srinivasan A.  2009.  Improving recommendation accuracy by clustering social networks with trust. Recommender Systems & the Social Web.
:1-8.

Kumar AVS, Marathe MV, Parthasarathy S, Srinivasan A.  2009.  A unified approach to scheduling on unrelated parallel machines. J. ACM. 56(5):28:1–28:31-28:1–28:31.

Han B, Kumar VSA, Marathe MV, Parthasarathy S, Srinivasan A.  2009.  Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks. IEEE INFOCOM 2009.
:1521-1529.

Alaei S, Malekian A, Srinivasan A.  2009.  On random sampling auctions for digital goods. Proceedings of the 10th ACM conference on Electronic commerce.
:187-196.

DuBois T, Golbeck J, Srinivasan A.  2009.  Rigorous Probabilistic Trust-Inference with Applications to Clustering. IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT '09. 1:655-658.

Anil Kumar V, Marathe M, Parthasarathy S, Srinivasan A.  2009.  Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. Algorithmica. 55(1):205-226.

2008


Chafekar D, Kumart VSA, Marathe MV, Parthasarathy S, Srinivasan A.  2008.  Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. IEEE INFOCOM 2008. The 27th Conference on Computer Communications.
:1166-1174.

Gupta A, Srinivasan A, Tardos É.  2008.  Cost-Sharing Mechanisms for Network Design. Algorithmica. 50(1):98-119.

Srinivasan A.  2008.  Improved algorithmic versions of the Lovász Local Lemma. Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms.
:611-620.

Srinivasan A.  2008.  Budgeted Allocations in the Full-Information Setting. Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. 5171:247-253.

Pemmaraju S, Srinivasan A.  2008.  The Randomized Coloring Procedure with Symmetry-Breaking. Automata, Languages and ProgrammingAutomata, Languages and Programming. 5125:306-319.

Chafekar D, Levin D, Kumar VSA, Marathe MV, Parthasarathy S, Srinivasan A.  2008.  Capacity of Asynchronous Random-Access Scheduling in Wireless Networks. IEEE INFOCOM 2008. The 27th Conference on Computer Communications.
:1148-1156.

2007


Kumar VSA, Marathe MV, Parthasarathy S, Srinivasan A.  2007.  Provable algorithms for joint optimization of transport, routing and MAC layers in wireless ad hoc networks. Proc. DialM-POMC Workshop on Foundations of Mobile Computing.

Srinivasan A.  2007.  Approximation algorithms for stochastic and risk-averse optimization. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms.
:1305-1313.

Srinivasan A.  2007.  Randomized Algorithms and Probabilistic Analysis in Wireless Networking. Stochastic Algorithms: Foundations and ApplicationsStochastic Algorithms: Foundations and Applications. 4665:54-57.

Chafekar D, Kumar AVS, Marathe MV, Parthasarathy S, Srinivasan A.  2007.  Cross-layer latency minimization in wireless networks with SINR constraints. Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing.
:110-119.

Gopalakrishnan V, Morselli R, Bhattacharjee B, Keleher P, Srinivasan A.  2007.  Distributed Ranked Search. High Performance Computing – HiPC 2007High Performance Computing – HiPC 2007. 4873:7-20.

Gopalakrishnan V, Morselli R, Bhattacharjee B, Keleher P, Srinivasan A.  2007.  Distributed ranked search. High Performance Computing–HiPC 2007.
:7-20.

Morselli R, Bhattacharjee B, Marsh MA, Srinivasan A.  2007.  Efficient lookup on unstructured topologies. IEEE Journal on Selected Areas in Communications. 25(1):62-72.

2006


Gandhi R, Halperin E, Khuller S, Kortsarz G, Srinivasan A.  2006.  An improved approximation algorithm for vertex cover with hard capacities. Journal of Computer and System Sciences. 72(1):16-33.

Mishra A, Brik V, Banerjee S, Srinivasan A, Arbaugh WA.  2006.  Client-driven channel management for wireless LANs. SIGMOBILE Mob. Comput. Commun. Rev.. 10(4):8-10.

Gandhi R, Khuller S, Parthasarathy S, Srinivasan A.  2006.  Dependent rounding and its applications to approximation algorithms. Journal of the ACM. 53(3):324-360.

Anil Kumar VS, Marathe MV, Parthasarathy S, Srinivasan A, Zust S.  2006.  Provable algorithms for parallel generalized sweep scheduling. Journal of Parallel and Distributed Computing. 66(6):807-821.

Eubank S, Kumar VSA, Marathe MV, Srinivasan A, Wang N.  2006.  Structure of social contact networks and their impact on epidemics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 70:181-181.

Andrews M, Hofmann M, Shepherd B, Srinivasan A, Winkler P, Zane F.  2006.  System and method for locating a closest server in response to a client .... 09/726,192(7020698)

Gopalakrishnan V, Morselli R, Bhattacharjee B, Keleher P, Srinivasan A.  2006.  Ranking search results in peer-to-peer systems. Technical Reports from UMIACS.

Banerjee S, Lee S, Bhattacharjee B, Srinivasan A.  2006.  Resilient multicast using overlays. IEEE/ACM Transactions on Networking. 14(2):237-248.

Gopalakrishnan V, Morselli R, Bhattacharjee B, Keleher P, Srinivasan A.  2006.  Ranking search results in P2P systems. Technical Report, CR-TR-4779, Department of Computer Science, University of Maryland.

Ambainis A, Gasarch W, Srinivasan A, Utis A.  2006.  Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. Algorithms and ComputationAlgorithms and Computation. 4288:628-637.

2005


Mishra A, Brik V, Banerjee S, Srinivasan A, Arbaugh WA.  2005.  Efficient strategies for channel management in wireless lans. UMD, CS Tech. Rep. CS-TR. 4729

Kumar AVS, Marathe MV, Parthasarathy S, Srinivasan A.  2005.  Algorithmic aspects of capacity in wireless networks. Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems.
:133-144.

Morselli R, Bhattacharjee B, Srinivasan A, Marsh MA.  2005.  Efficient lookup on unstructured topologies. Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing.
:77-86.

Kumar V, Marathe M, Parthasarathy S, Srinivasan A.  2005.  Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints. Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. 3624:609-609.

2004


Banerjee S, Lee S, Braud R, Bhattacharjee B, Srinivasan A, Chu Y, Zhang H, Sinha R, Papadopoulos C, Boustead P et al..  2004.  SESSION 2: STREAMING. Proceedings of the 14th International Workshop on Network and Operating Systems Support for Digital Audio and Video: NOSSDAV 2003: June 16-18, 2004, Cork, Ireland.
:3-3.

Kumar AVS, Marathe MV, Parthasarathy S, Srinivasan A.  2004.  End-to-end packet-scheduling in wireless ad-hoc networks. Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms.
:1021-1030.

Eubank S, Guclu H, Kumar AVS, Marathe MV, Srinivasan A, Toroczkai Z|[aacute]|n, Wang N.  2004.  Modelling disease outbreaks in realistic urban social networks. Nature. 429(6988):180-184.

Khanna S, Srinivasan A.  2004.  Special issue: 35th Annual ACM Symposium on Theory of Computing. Journal of Computer and System Sciences. 69(3):305-305.

Eubank S, Kumar AVS, Marathe MV, Srinivasan A, Wang N.  2004.  Structural and algorithmic aspects of massive social networks. Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms.
:718-727.

Banerjee S, Lee S, Braud R, Bhattacharjee B, Srinivasan A.  2004.  Scalable resilient media streaming. Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video.
:4-9.

Aravamudan M, Kumaran K, Ramakrishnan K G, Srinivasan A.  2004.  Method of designing signaling networks for internet telephony. : 09/517,658(6687363)

2003


Gandhi R, Khuller S, Srinivasan A, Wang N.  2003.  Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 2764:821-826.

Halperin E, Kortsarz G, Krauthgamer R, Srinivasan A, Wang N.  2003.  Integrality ratio for group Steiner trees and directed steiner trees. Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms.
:275-284.

Srinivasan A.  2003.  On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.

Pages