Aravind Srinivasan
Distinguished University Professor
4204 Iribe Center
(301) 405-2695
(301) 405-6709
Research Group(s):
Education:
Ph.D. Cornell University (Computer Science)
Special Awards/Honors:
IEEE Fellow, ACM Fellow, AAAS Fellow
Biography:
Aravind Srinivasan is a Distinguished University Professor of computer science with an appointment in the University of Maryland Institute for Advanced Computer Studies.
His research focuses on algorithms, probabilistic methods, and data science, with applications in areas such as health, E-commerce, cloud computing, and fairness in AI. Srinivasan’s work spans computational epidemiology, genomics, Internet economy, social networks, and sustainable growth, aiming to advance both the theory and practical application of these fields.
Go here to view Srinivasan's academic publications on Google Scholar.
Publications
2003
2003. When does a random Robin Hood win? Theoretical Computer Science. 304(1–3):477-484.
2003. Approximating the domatic number. SIAM Journal on Computing. 32(1):172-195.
2003. Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 2764:821-826.
2003. Integrality ratio for group Steiner trees and directed steiner trees. Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. :275-284.
2002
2002. Improved Approximation Algorithms for the Partial Vertex Cover Problem. Approximation Algorithms for Combinatorial OptimizationApproximation Algorithms for Combinatorial Optimization. 2462:161-174.
2002. Wavelength rerouting in optical networks, or the Venetian Routing problem. Journal of Algorithms. 45(2):93-125.
2002. P5 : a protocol for scalable anonymous communication. 2002 IEEE Symposium on Security and Privacy, 2002. Proceedings. :58-70.
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.
2002. Approximation algorithms for the covering Steiner problem. Random Structures & Algorithms. 20(3):465-482.
2002. Dependent rounding in bipartite graphs. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. :323-332.
2001
2001. The one-inclusion graph algorithm is near-optimal for the prediction model of learning. IEEE Transactions on Information Theory. 47(3):1257-1261.
2001. Better Approximation Guarantees for Job-Shop Scheduling. SIAM Journal on Discrete Mathematics. 14(1):67-67.
2001. Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.
2001. Domatic partitions and the Lovász local lemma. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :922-923.
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.
2001. Approximation algorithms for partial covering problems. Automata, Languages and Programming. :225-236.
2001. Improved Bounds on the Sample Complexity of Learning. Journal of Computer and System Sciences. 62(3):516-527.
2001. Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. Algorithm EngineeringAlgorithm Engineering. 2141:172-184.
2001. Near-optimal design of MP S tunnels with shared recovery. DIMACS Mini-Workshop on Quality of Service Issues in the Internet.
2001. Finding large independent sets of hypergraphs in parallel. Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures. :163-168.
2001. New approaches to covering and packing problems. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :567-576.
2001. The discrepancy of permutation families. Unpublished manuscript.
2000
2000. Improved Algorithms via Approximations of Probability Distributions. Journal of Computer and System Sciences. 61(1):81-107.
2000. Low-discrepancy sets for high-dimensional rectangles: a survey. Bulletin of the EATCS. 70:67-76.
2000. Retrieval scheduling for collaborative multimedia presentations. Multimedia Systems. 8(2):146-155.
2000. The value of strong inapproximability results for clique. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :144-152.
2000. Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem. Approximation Algorithms for Combinatorial Optimization. 1913:71-84.
2000. Approximating low-congestion routing and column-restricted packing problems. Information Processing Letters. 74(1–2):19-25.
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.
2000. Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems. Mathematics of Operations ResearchMathematics of Operations Research. 25(2):255-280.
2000. Combinatorial Problems Arising in Deregulated Electrical Power Industry: Survey and Future Directions. NONCONVEX OPTIMIZATION AND ITS APPLICATIONS. 42:138-162.
2000. Contention resolution with constant expected delay. J. ACM. 47(6):1048-1096.
2000. Low discrepancy sets yield approximate min-wise independent permutation families. Information Processing Letters. 73(1–2):29-32.
1999
1999. Application-layer broker for scalable Internet services with resource reservation. Proceedings of the seventh ACM international conference on Multimedia (Part 2). :103-106.
1999. Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM Journal on Computing. 29(2):648-648.
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.
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.
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.
1998
1998. Low-bandwidth routing and electrical power networks. Automata, Languages and ProgrammingAutomata, Languages and Programming. 1443:604-615.
1998. Improved bounds and algorithms for hypergraph two-coloring. 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings. :684-693.
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.
1998. Explicit OR-dispersers with polylogarithmic degree. Journal of the ACM (JACM). 45(1):123-154.
1997
1997. Better approximation guarantees for job-shop scheduling. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. :599-608.
1997. Scheduling and load-balancing via randomization. TR11/97
1997. Approximating hyper-rectangles: learning and pseudo-random sets. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. :314-323.
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.
1997. Mechanism design for intellectual property rights protection. Proceedings of the eighteenth international conference on Information systems. :448–-448–.
1997. Improved parallel approximation of a class of integer programming problems. Algorithmica. 17(4):449-462.
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.
1997. Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. :692-701.
1997. Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds. SIAM Journal on Computing. 26(2):350-350.
1996
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.
1996. On the Complexity of Distributed Network Decomposition. Journal of Algorithms. 20(2):356-374.
1995
1995. The local nature of Δ-coloring and its algorithmic applications. Combinatorica. 15(2):255-280.
1995. Improved approximation guarantees for packing and covering integer programs. DIMACS Technical Report.
1995. Improved approximations of packing and covering problems. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :268-276.
1995. Splitters and near-optimal derandomization. , 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings. :182-191.
1995. Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems. SIAM Journal on Computing. 24(5):1036-1036.
1994
1994. Computing with very weak random sources. , 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings. :264-275.
1993
1993. Chernoff-Hoeffding bounds for applications with limited independence. Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms. :331-340.
1993. Techniques for probabilistic analysis and randomness-efficient computation. Computer Science Technical Reports, Cornell University.
1992
1992. Improved distributed algorithms for coloring and network decomposition problems. Proceedings of the twenty-fourth annual ACM symposium on Theory of computing. :581-592.
1992. Fast randomized algorithms for distributed edge coloring. Proceedings of the eleventh annual ACM symposium on Principles of distributed computing. :251-262.
1992. A Generalization of Brooks' Theorem. Computer Science Technical Reports.
1991
1991. On finding the minimum bandwidth of interval graphs. Information and Computation. 95(2):218-224.
1991. Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs. Theoretical Computer Science. 91(1):1-21.