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

2003


Gupta A, Srinivasan A.  2003.  On the Covering Steiner Problem. FST TCS 2003: Foundations of Software Technology and Theoretical Computer ScienceFST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. 2914:244-251.

Feige U, Halldórsson MM, Kortsarz G, Srinivasan A.  2003.  Approximating the domatic number. SIAM Journal on Computing. 32(1):172-195.

Gasarch W, Golub E, Srinivasan A.  2003.  When does a random Robin Hood win? Theoretical Computer Science. 304(1–3):477-484.

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.

2002


Gandhi R, Khuller S, Parthasarathy S, Srinivasan A.  2002.  Dependent rounding in bipartite graphs. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
:323-332.

Halperin E, Srinivasan A.  2002.  Improved Approximation Algorithms for the Partial Vertex Cover Problem. Approximation Algorithms for Combinatorial OptimizationApproximation Algorithms for Combinatorial Optimization. 2462:161-174.

Caprara A, Italiano GF, Mohan G, Panconesi A, Srinivasan A.  2002.  Wavelength rerouting in optical networks, or the Venetian Routing problem. Journal of Algorithms. 45(2):93-125.

Andrews M, Shepherd B, Srinivasan A, Winkler P, Zane F.  2002.  Clustering and server selection using passive monitoring. IEEE INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. 3:1717-1725vol.3-1717-1725vol.3.

Sherwood R, Bhattacharjee B, Srinivasan A.  2002.  P5 : a protocol for scalable anonymous communication. 2002 IEEE Symposium on Security and Privacy, 2002. Proceedings.
:58-70.

Konjevod G, Ravi R, Srinivasan A.  2002.  Approximation algorithms for the covering Steiner problem. Random Structures & Algorithms. 20(3):465-482.

2001


Shachnai H, Srinivasan A.  2001.  Finding large independent sets of hypergraphs in parallel. Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures.
:163-168.

Srinivasan A.  2001.  New approaches to covering and packing problems. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms.
:567-576.

Spencer JH, Srinivasan A, Tetali P.  2001.  The discrepancy of permutation families. Unpublished manuscript.

Goldberg L A, Paterson M, Srinivasan A, Sweedyk E.  2001.  Better Approximation Guarantees for Job-Shop Scheduling. SIAM Journal on Discrete Mathematics. 14(1):67-67.

Li Y, Long PM, Srinivasan A.  2001.  The one-inclusion graph algorithm is near-optimal for the prediction model of learning. IEEE Transactions on Information Theory. 47(3):1257-1261.

Srinivasan A.  2001.  Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings.
:588-597.

Srinivasan A.  2001.  Domatic partitions and the Lovász local lemma. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms.
:922-923.

Kumaran K, Srinivasan A, Wang Q, Lanning S, Ramakrishnan KG.  2001.  Efficient algorithms for location and sizing problems in network design. IEEE Global Telecommunications Conference, 2001. GLOBECOM '01. 4:2586-2590vol.4-2586-2590vol.4.

Gandhi R, Khuller S, Srinivasan A.  2001.  Approximation algorithms for partial covering problems. Automata, Languages and Programming.
:225-236.

Li Y, Long PM, Srinivasan A.  2001.  Improved Bounds on the Sample Complexity of Learning. Journal of Computer and System Sciences. 62(3):516-527.

Barrett C, Cook D, Hicks G, Faber V, Marathe A, Marathe M, Srinivasan A, Sussmann Y, Thornquist H.  2001.  Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. Algorithm EngineeringAlgorithm Engineering. 2141:172-184.

Fleischer L, Meyerson A, Saniee I, Shepherd FB, Srinivasan A.  2001.  Near-optimal design of MP S tunnels with shared recovery. DIMACS Mini-Workshop on Quality of Service Issues in the Internet.

2000


Saks M, Srinivasan A, Zhou S, Zuckerman D.  2000.  Low discrepancy sets yield approximate min-wise independent permutation families. Information Processing Letters. 73(1–2):29-32.

Chari S, Rohatgi P, Srinivasan A.  2000.  Improved Algorithms via Approximations of Probability Distributions. Journal of Computer and System Sciences. 61(1):81-107.

Bai P, Prabhakaran B, Srinivasan A.  2000.  Retrieval scheduling for collaborative multimedia presentations. Multimedia Systems. 8(2):146-155.

Srinivasan A.  2000.  The value of strong inapproximability results for clique. Proceedings of the thirty-second annual ACM symposium on Theory of computing.
:144-152.

Caprara A, Italiano G, Mohan G, Panconesi A, Srinivasan A.  2000.  Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem. Approximation Algorithms for Combinatorial Optimization. 1913:71-84.

Srinivasan A, Ramakrishnan KG, Kumaran K, Aravamudan M, Naqvi S.  2000.  Optimal design of signaling networks for Internet telephony. IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. 2:707-716vol.2-707-716vol.2.

Baveja A, Srinivasan A.  2000.  Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems. Mathematics of Operations ResearchMathematics of Operations Research. 25(2):255-280.

Cook D, Hicks G, Faber V, Marathe MV, Srinivasan A, Sussmann YJ, Thornquist H.  2000.  Combinatorial Problems Arising in Deregulated Electrical Power Industry: Survey and Future Directions. NONCONVEX OPTIMIZATION AND ITS APPLICATIONS. 42:138-162.

Goldberg L A, Mackenzie PD, Paterson M, Srinivasan A.  2000.  Contention resolution with constant expected delay. J. ACM. 47(6):1048-1096.

1999


Leighton T, Rao S, Srinivasan A.  1999.  New algorithmic aspects of the Local Lemma with applications to routing and partitioning. Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms.
:643-652.

Srinivasan A.  1999.  A survey of the role of multicommodity flow and randomization in network design and routing. American Mathematical Society, Series in Discrete Mathematics and Theoretical Computer Science. 43:271-302.

Srinivasan A.  1999.  Approximation algorithms via randomized rounding: a survey. Lectures on Approximation and Randomized Algorithms (M. Karonski and HJ Promel, editors), Series in Advanced Topics in Mathematics, Polish Scientific Publishers PWN.
:9-71.

Bai P, Prabhakaran B, Srinivasan A.  1999.  Application-layer broker for scalable Internet services with resource reservation. Proceedings of the seventh ACM international conference on Multimedia (Part 2).
:103-106.

1998


Cook D, Faber V, Marathe M, Srinivasan A, Sussmann Y.  1998.  Low-bandwidth routing and electrical power networks. Automata, Languages and ProgrammingAutomata, Languages and Programming. 1443:604-615.

Radhakrishnan J, Srinivasan A.  1998.  Improved bounds and algorithms for hypergraph two-coloring. 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings.
:684-693.

Leighton T, Rao S, Srinivasan A.  1998.  Multicommodity flow and circuit switching. , Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998. 7:459-465vol.7-459-465vol.7.

Saks M, Srinivasan A, Zhou S.  1998.  Explicit OR-dispersers with polylogarithmic degree. Journal of the ACM (JACM). 45(1):123-154.

1997


Goldberg L A, Paterson M, Srinivasan A, Sweedyk E.  1997.  Better approximation guarantees for job-shop scheduling. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms.
:599-608.

Auer P, Long PM, Srinivasan A.  1997.  Approximating hyper-rectangles: learning and pseudo-random sets. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing.
:314-323.

Srinivasan A.  1997.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. , 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings.
:416-425.

Giridharan PS, Srinivasan A.  1997.  Mechanism design for intellectual property rights protection. Proceedings of the eighteenth international conference on Information systems.
:448–-448–.

Srinivasan A, Teo C-P.  1997.  A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing.
:636-643.

1996


Srinivasan A.  1996.  An extension of the Lovász Local Lemma, and its applications to integer programming. Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms.
:6-15.

Panconesi A, Srinivasan A.  1996.  On the Complexity of Distributed Network Decomposition. Journal of Algorithms. 20(2):356-374.

1995


Srinivasan A.  1995.  Improved approximations of packing and covering problems. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing.
:268-276.

Naor M, Schulman LJ, Srinivasan A.  1995.  Splitters and near-optimal derandomization. , 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings.
:182-191.

1994


Srinivasan A, Zuckerman D.  1994.  Computing with very weak random sources. , 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings.
:264-275.

1993


Schmidt JP, Siegel A, Srinivasan A.  1993.  Chernoff-Hoeffding bounds for applications with limited independence. Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms.
:331-340.

1992


Panconesi A, Srinivasan A.  1992.  Improved distributed algorithms for coloring and network decomposition problems. Proceedings of the twenty-fourth annual ACM symposium on Theory of computing.
:581-592.

Srinivasan A.  1992.  A Generalization of Brooks' Theorem. Computer Science Technical Reports.

Panconesi A, Srinivasan A.  1992.  Fast randomized algorithms for distributed edge coloring. Proceedings of the eleventh annual ACM symposium on Principles of distributed computing.
:251-262.

1991


Mahesh R, Rangan C.P, Srinivasan A.  1991.  On finding the minimum bandwidth of interval graphs. Information and Computation. 95(2):218-224.

Pages