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.
2012. Networking lessons: From computers to water. 2012 Fourth International Conference on Communication Systems and Networks (COMSNETS). :1-6.
2012. Optimizing epidemic protection for socially essential workers. Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium. :31-40.
2012. Mobile Data Offloading through Opportunistic Communications and Social Participation. Mobile Computing, IEEE Transactions on. 11(5):821-834.
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.
2011. Network Clustering Approximation Algorithm Using One Pass Black Box Sampling. arXiv:1110.3563.
2011. Approximation algorithms for throughput maximization in wireless networks with delay constraints. 2011 Proceedings IEEE INFOCOM. :1116-1124.
2011. Local Balancing Influences Global Structure in Social Networks. Proceedings of the National Academy of SciencesPNAS. 108(5):1751-1752.
2011. Article 28 (28 pages)-New Constructive Aspects of the Lovász Local Lemma. Journal of the ACM-Association for ComputingMachinery. 58(6)
2011. Capacity of wireless networks under SINR interference constraints. Wireless Networks. 17(7):1605-1624.
2011. Maximum bipartite flow in networks with adaptive channel width. Theoretical Computer Science. 412(24):2577-2587.
2010. Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization. 6080:244-257.
2010. New Constructive Aspects of the Lovasz Local Lemma. 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). :397-406.
2010. On k-Column Sparse Packing Programs. Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization. 6080:369-382.
2010. LP-rounding algorithms for facility-location problems. arXiv:1007.3611.
2010. Cellular traffic offloading through opportunistic communications: a case study. Proceedings of the 5th ACM workshop on Challenged networks. :31-38.
2010. Mobile data offloading in metropolitan area networks. SIGMOBILE Mob. Comput. Commun. Rev.. 14(4):28-30.
2009. Improving recommendation accuracy by clustering social networks with trust. Recommender Systems & the Social Web. :1-8.
2009. A unified approach to scheduling on unrelated parallel machines. J. ACM. 56(5):28:1–28:31-28:1–28:31.
2009. Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks. IEEE INFOCOM 2009. :1521-1529.
2009. On random sampling auctions for digital goods. Proceedings of the 10th ACM conference on Electronic commerce. :187-196.
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.
2009. Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. Algorithmica. 55(1):205-226.
2008. A note on the distribution of the number of prime factors of the integers. Information Processing Letters. 109(2):133-135.
2008. Cost-Sharing Mechanisms for Network Design. Algorithmica. 50(1):98-119.
2008. Efficient and Resilient Backbones for Multihop Wireless Networks. Mobile Computing, IEEE Transactions on. 7(11):1349-1362.
2008. Improved algorithmic versions of the Lovász Local Lemma. Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms. :611-620.
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.
2008. The Randomized Coloring Procedure with Symmetry-Breaking. Automata, Languages and ProgrammingAutomata, Languages and Programming. 5125:306-319.
2008. Capacity of Asynchronous Random-Access Scheduling in Wireless Networks. IEEE INFOCOM 2008. The 27th Conference on Computer Communications. :1148-1156.
2008. Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. IEEE INFOCOM 2008. The 27th Conference on Computer Communications. :1166-1174.
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.
2007. Approximation algorithms for stochastic and risk-averse optimization. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. :1305-1313.
2007. Fast and scalable approximation methods for finding minimum cost flows with .... 10/053,079(7280526)
2007. Randomized Algorithms and Probabilistic Analysis in Wireless Networking. Stochastic Algorithms: Foundations and ApplicationsStochastic Algorithms: Foundations and Applications. 4665:54-57.
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.
2007. Distributed Ranked Search. High Performance Computing – HiPC 2007High Performance Computing – HiPC 2007. 4873:7-20.
2007. Distributed ranked search. High Performance Computing–HiPC 2007. :7-20.
2007. Efficient lookup on unstructured topologies. IEEE Journal on Selected Areas in Communications. 25(1):62-72.
2006. Dependent rounding and its applications to approximation algorithms. Journal of the ACM. 53(3):324-360.
2006. A client-driven approach for channel management in wireless LANs. IEEE Infocom. 6
2006. Provable algorithms for parallel generalized sweep scheduling. Journal of Parallel and Distributed Computing. 66(6):807-821.
2006. Structure of social contact networks and their impact on epidemics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 70:181-181.
2006. System and method for locating a closest server in response to a client .... 09/726,192(7020698)
2006. Ranking search results in peer-to-peer systems. Technical Reports from UMIACS.
2006. Resilient multicast using overlays. IEEE/ACM Transactions on Networking. 14(2):237-248.
2006. Ranking search results in P2P systems. Technical Report, CR-TR-4779, Department of Computer Science, University of Maryland.
2006. Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. Algorithms and ComputationAlgorithms and Computation. 4288:628-637.
2006. Review of "The Random Projection Method by Santosh Vempala". SIGACT News. 37(4):41-43.
2006. An improved approximation algorithm for vertex cover with hard capacities. Journal of Computer and System Sciences. 72(1):16-33.
2006. Client-driven channel management for wireless LANs. SIGMOBILE Mob. Comput. Commun. Rev.. 10(4):8-10.
2006. Approximation algorithms for channel allocation problems in broadcast networks. Networks. 47(4):225-236.
2006. Session 8A-Combinatorial Optimization and Quantum Computing-Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. Lecture Notes in Computer Science. 4288:628-637.
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.
2005. Efficient lookup on unstructured topologies. Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing. :77-86.
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.
2005. Efficient strategies for channel management in wireless lans. UMD, CS Tech. Rep. CS-TR. 4729
2004. Special issue: 35th Annual ACM Symposium on Theory of Computing. Journal of Computer and System Sciences. 69(3):305-305.
2004. Approximation algorithms for partial covering problems. Journal of Algorithms. 53(1):55-84.
2004. Structural and algorithmic aspects of massive social networks. Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. :718-727.
2004. Guest editors' foreword: special issue: 35th annual ACM symposium on theory of computing. Journal of Computer and System Sciences. 69(3):305-305.
2004. Scalable resilient media streaming. Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video. :4-9.
2004. Method of designing signaling networks for internet telephony. : 09/517,658(6687363)
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.
2004. End-to-end packet-scheduling in wireless ad-hoc networks. Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. :1021-1030.
2004. Modelling disease outbreaks in realistic urban social networks. Nature. 429(6988):180-184.
2003. Integrality ratio for group Steiner trees and directed steiner trees. Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. :275-284.
2003. An Improved Approximation Ratio for the Covering Steiner Problem. Theory of Computing. 2:53-64.
2003. On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.
2003. Resilient multicast using overlays. SIGMETRICS Perform. Eval. Rev.. 31(1):102-113.