Aravind Srinivasan

Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan: On Random Sampling Auctions for Digital Goods. CoRR abs/1303.4438 (2013)

Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marathe, Jianhua Shao, Aravind Srinivasan: Mobile Data Offloading through Opportunistic Communications and Social Participation. IEEE Trans. Mob. Comput. 11(5): 821-834 (2012)

Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan: Solving Packing Integer Programs via Randomized Rounding with Alterations. Theory of Computing 8(1): 533-565 (2012)

Iyswarya Narayanan, Venkatesh Sarangan, Arunchandar Vasan, Aravind Srinivasan, Anand Sivasubramaniam: Networking lessons: From computers to water. COMSNETS 2012: 1-6

Bo Han, Aravind Srinivasan: eDiscovery: Energy efficient device discovery for mobile opportunistic communications. ICNP 2012: 1-10

Christopher L. Barrett, Richard J. Beckman, Keith R. Bisset, Jiangzhuo Chen, Thomas DuBois, Stephen Eubank, V. S. Anil Kumar, Bryan Lewis, Madhav V. Marathe, Aravind Srinivasan, Paula Elaine Stretz: Optimizing epidemic protection for socially essential workers. IHI 2012: 31-40

Bo Han, Aravind Srinivasan: Your friends have more friends than you do: identifying influential mobile users through random walks. MobiHoc 2012: 5-14

Bernhard Haeupler, Barna Saha, Aravind Srinivasan: New Constructive Aspects of the Lovász Local Lemma. J. ACM 58(6): 28 (2011)

Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan: Maximum bipartite flow in networks with adaptive channel width. Theor. Comput. Sci. 412(24): 2577-2587 (2011)

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

Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthasarathy, Aravind Srinivasan: Approximation algorithms for throughput maximization in wireless networks with delay constraints. INFOCOM 2011: 1116-1124

Thomas DuBois, Jennifer Golbeck, Aravind Srinivasan: Predicting Trust and Distrust in Social Networks. SocialCom/PASSAT 2011: 418-424

Thomas DuBois, Jennifer Golbeck, Aravind Srinivasan: Network Clustering Approximation Algorithm Using One Pass Black Box Sampling. CoRR abs/1110.3563 (2011)

Aravind Srinivasan: Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009. SIGACT News 41(1): 28-30 (2010)

Bo Han, Pan Hui, Aravind Srinivasan: Mobile data offloading in metropolitan area networks. Mobile Computing and Communications Review 14(4): 28-30 (2010)

Bernhard Haeupler, Barna Saha, Aravind Srinivasan: New Constructive Aspects of the Lovasz Local Lemma. FOCS 2010: 397-406

Barna Saha, Aravind Srinivasan: A New Approximation Technique for Resource-Allocation Problems. ICS 2010: 342-357

Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy: Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. IPCO 2010: 244-257

Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan: On k-Column Sparse Packing Programs. IPCO 2010: 369-382

Bernhard Haeupler, Barna Saha, Aravind Srinivasan: New Constructive Aspects of the Lovasz Local Lemma. CoRR abs/1001.1231 (2010)

Barna Saha, Aravind Srinivasan: A New Approximation Technique for Resource-Allocation Problems. CoRR abs/1001.1470 (2010)

Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy: Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm. CoRR abs/1003.1295 (2010)

Jaroslaw Byrka, MohammadReza Ghodsi, Aravind Srinivasan: LP-rounding algorithms for facility-location problems. CoRR abs/1007.3611 (2010)

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

V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: A unified approach to scheduling on unrelated parallel machines. J. ACM 56(5) (2009)

Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan: Maximum Bipartite Flow in Networks with Adaptive Channel Width. ICALP (2) 2009: 351-362

Bo Han, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks. INFOCOM 2009: 1521-1529

Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan: On random sampling auctions for digital goods. ACM Conference on Electronic Commerce 2009: 187-196

Thomas DuBois, Jennifer Golbeck, Aravind Srinivasan: Rigorous Probabilistic Trust-Inference with Applications to Clustering. Web Intelligence 2009: 655-658

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

Aravind Srinivasan: A note on the distribution of the number of prime factors of the integers. Inf. Process. Lett. 109(2): 133-135 (2008)

Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan, Samir Khuller: Efficient and Resilient Backbones for Multihop Wireless Networks. IEEE Trans. Mob. Comput. 7(11): 1349-1362 (2008)

Aravind Srinivasan: Budgeted Allocations in the Full-Information Setting. APPROX-RANDOM 2008: 247-253

Sriram V. Pemmaraju, Aravind Srinivasan: The Randomized Coloring Procedure with Symmetry-Breaking. ICALP (1) 2008: 306-319

Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Capacity of Asynchronous Random-Access Scheduling in Wireless Networks. INFOCOM 2008: 1148-1156

Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. INFOCOM 2008: 1166-1174

Aravind Srinivasan: Improved algorithmic versions of the Lovász Local Lemma. SODA 2008: 611-620

V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Minimum Weighted Completion Time. Encyclopedia of Algorithms 2008

Ruggero Morselli, Bobby Bhattacharjee, Michael A. Marsh, Aravind Srinivasan: Efficient lookup on unstructured topologies. IEEE Journal on Selected Areas in Communications 25(1): 62-72 (2007)

Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang: Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. SIAM J. Comput. 36(5): 1494-1511 (2007)

Thomas Schlegel, Aravind Srinivasan, Maxim Foursa, Manfred Bogen, Rejin Narayanan, David d'Angelo, Géza Haidegger, Istvan Mezgar, Joseph Canou, Damien Sallé, Fabrizio Meo, Jon Agirre Ibarbia, Anja Herrmann Praturlon: INT-MANUS: Interactive Production Control in a Distributed Environment. HCI (4) 2007: 1150-1159

Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhattacharjee, Peter J. Keleher, Aravind Srinivasan: Distributed Ranked Search. HiPC 2007: 7-20

Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Cross-layer latency minimization in wireless networks with SINR constraints. MobiHoc 2007: 110-119

Aravind Srinivasan: Randomized Algorithms and Probabilistic Analysis in Wireless Networking. SAGA 2007: 54-57

Aravind Srinivasan: Approximation algorithms for stochastic and risk-averse optimization. SODA 2007: 1305-1313

Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan: Dependent rounding and its applications to approximation algorithms. J. ACM 53(3): 324-360 (2006)

Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan: An improved approximation algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci. 72(1): 16-33 (2006)

V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan, Sibylle Zust: Provable algorithms for parallel generalized sweep scheduling. J. Parallel Distrib. Comput. 66(6): 807-821 (2006)

Peter Sanders, Aravind Srinivasan, Berthold Vöcking: Foreword. Theory Comput. Syst. 39(6): 785 (2006)

Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang: Approximation algorithms for channel allocation problems in broadcast networks. Networks 47(4): 225-236 (2006)

Aravind Srinivasan: An Extension of the Lovász Local Lemma, and its Applications to Integer Programming. SIAM J. Comput. 36(3): 609-634 (2006)

Aravind Srinivasan: Review of "The Random Projection Method by Santosh Vempala". SIGACT News 37(4): 41-43 (2006)

Arunesh Mishra, Vladimir Brik, Suman Banerjee, Aravind Srinivasan, William A. Arbaugh: Client-driven channel management for wireless LANs. Mobile Computing and Communications Review 10(4): 8-10 (2006)

Anupam Gupta, Aravind Srinivasan: An Improved Approximation Ratio for the Covering Steiner Problem. Theory of Computing 2(1): 53-64 (2006)

Suman Banerjee, Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan: Resilient multicast using overlays. IEEE/ACM Trans. Netw. 14(2): 237-248 (2006)

Kalyanmoy Deb, Aravind Srinivasan: Innovization: innovating design principles through optimization. GECCO 2006: 1629-1636

Arunesh Mishra, Vladimir Brik, Suman Banerjee, Aravind Srinivasan, William A. Arbaugh: A Client-Driven Approach for Channel Management in Wireless LANs. INFOCOM 2006

Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis: Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. ISAAC 2006: 628-637

Rob Sherwood, Bobby Bhattacharjee, Aravind Srinivasan: P⁵: A protocol for scalable anonymous communication. Journal of Computer Security 13(6): 839-876 (2005)

Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Comput. Syst. Sci. 71(4): 467-479 (2005)

V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints. APPROX-RANDOM 2005: 146-157

V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Approximation Algorithms for Scheduling on Multiple Machines. FOCS 2005: 254-263

V. S. Anil Kumar, Srinivasan Parthasarathy, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust: Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes. IPDPS 2005

Ruggero Morselli, Bobby Bhattacharjee, Aravind Srinivasan, Michael A. Marsh: Efficient lookup on unstructured topologies. PODC 2005: 77-86

V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Algorithmic aspects of capacity in wireless networks. SIGMETRICS 2005: 133-144

Rajiv Gandhi, Samir Khuller, Aravind Srinivasan: Approximation algorithms for partial covering problems. J. Algorithms 53(1): 55-84 (2004)

Sanjeev Khanna, Aravind Srinivasan: Special issue: 35th Annual ACM Symposium on Theory of Computing. J. Comput. Syst. Sci. 69(3): 305- (2004)

Hadas Shachnai, Aravind Srinivasan: Finding Large Independent Sets in Graphs and Hypergraphs. SIAM J. Discrete Math. 18(3): 488-500 (2004)

Anupam Gupta, Aravind Srinivasan, Éva Tardos: Cost-Sharing Mechanisms for Network Design. APPROX-RANDOM 2004: 139-150

Suman Banerjee, Seungjoon Lee, Ryan Braud, Bobby Bhattacharjee, Aravind Srinivasan: Scalable resilient media streaming. NOSSDAV 2004: 4-9

Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang: Structural and algorithmic aspects of massive social networks. SODA 2004: 718-727

V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: End-to-end packet-scheduling in wireless ad-hoc networks. SODA 2004: 1021-1030

Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis: Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance. CoRR cs.CC/0411076 (2004)

Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis: Lower bounds on the Deterministic and Quantum Communication Complexity of HAM_n^a. Electronic Colloquium on Computational Complexity (ECCC)(120) (2004)

Aravind Srinivasan: On the approximability of clique and related maximization problems. J. Comput. Syst. Sci. 67(3): 633-651 (2003)

Christopher L. Barrett, Achla Marathe, Madhav V. Marathe, Doug Cook, Gregory Hicks, Vance Faber, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist: Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry. J. Graph Algorithms Appl. 7(1): 3-31 (2003)

William I. Gasarch, Evan Golub, Aravind Srinivasan: When does a random Robin Hood win? Theor. Comput. Sci. 1-3(304): 477-484 (2003)

Anupam Gupta, Aravind Srinivasan: On the Covering Steiner Problem. FSTTCS 2003: 244-251

Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan: An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. ICALP 2003: 164-175

Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang: Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. RANDOM-APPROX 2003: 47-58

Suman Banerjee, Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan: Resilient multicast using overlays. SIGMETRICS 2003: 102-113

Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang: Integrality ratio for group Steiner trees and directed steiner trees. SODA 2003: 275-284

Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. SODA 2003: 717-724

Aravind Srinivasan: An Extension of the Lovasz Local Lemma, and its Applications to Integer Programming. CoRR cs.DS/0307043 (2003)

Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan: Wavelength rerouting in optical networks, or the Venetian Routing problem. J. Algorithms 45(2): 93-125 (2002)

Goran Konjevod, R. Ravi, Aravind Srinivasan: Approximation algorithms for the covering Steiner problem. Random Struct. Algorithms 20(3): 465-482 (2002)

Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan: Approximating the Domatic Number. SIAM J. Comput. 32(1): 172-195 (2002)

Eran Halperin, Aravind Srinivasan: Improved Approximation Algorithms for the Partial Vertex Cover Problem. APPROX 2002: 161-174

Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan: Dependent Rounding in Bipartite Graphs. FOCS 2002: 323-332

Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane: Clustering and Server Selection using Passive Monitoring. INFOCOM 2002

Rob Sherwood, Bobby Bhattacharjee, Aravind Srinivasan: P5: A Protocol for Scalable Anonymous Communication. IEEE Symposium on Security and Privacy 2002: 58-70

Yi Li, Philip M. Long, Aravind Srinivasan: Improved Bounds on the Sample Complexity of Learning. J. Comput. Syst. Sci. 62(3): 516-527 (2001)

Frank Thomson Leighton, Chi-Jen Lu, Satish Rao, Aravind Srinivasan: New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SIAM J. Comput. 31(2): 626-641 (2001)

Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk: Better Approximation Guarantees for Job-Shop Scheduling. SIAM J. Discrete Math. 14(1): 67-92 (2001)

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

Aravind Srinivasan: Distributions on Level-Sets with Applications to Approximation Algorithms. FOCS 2001: 588-597

Rajiv Gandhi, Samir Khuller, Aravind Srinivasan: Approximation Algorithms for Partial Covering Problems. ICALP 2001: 225-236

Aravind Srinivasan: New approaches to covering and packing problems. SODA 2001: 567-576

Aravind Srinivasan: Domatic partitions and the Lovász local lemma. SODA 2001: 922-923

Hadas Shachnai, Aravind Srinivasan: Finding large independent sets of hypergraphs in parallel. SPAA 2001: 163-168

Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist: Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. Algorithm Engineering 2001: 172-184

Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman: Low discrepancy sets yield approximate min-wise independent permutation families. Inf. Process. Lett. 73(1-2): 29-32 (2000)

Alok Baveja, Aravind Srinivasan: Approximating low-congestion routing and column-restricted packing problems. Inf. Process. Lett. 74(1-2): 19-25 (2000)

Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan: Contention resolution with constant expected delay. J. ACM 47(6): 1048-1096 (2000)

Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan: Improved Algorithms via Approximations of Probability Distributions. J. Comput. Syst. Sci. 61(1): 81-107 (2000)

Ping Bai, B. Prabhakaran, Aravind Srinivasan: Retrieval Scheduling for Collaborative Multimedia Presentations. Multimedia Syst. 8(2): 146-155 (2000)

Alok Baveja, Aravind Srinivasan: Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems. Math. Oper. Res. 25(2): 255-280 (2000)

Jaikumar Radhakrishnan, Aravind Srinivasan: Improved bounds and algorithms for hypergraph 2-coloring. Random Struct. Algorithms 16(1): 4-32 (2000)

Aravind Srinivasan, Chung-Piaw Teo: A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria. SIAM J. Comput. 30(6): 2051-2068 (2000)

Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan: Wavelength rerouting in optical networks, or the Venetian routing problem. APPROX 2000: 72-83

Aravind Srinivasan, K. G. Ramakrishnan, Krishnan Kumaran, Murali Aravamudan, Shamim A. Naqvi: Optimal Design of Signaling Networks for Internet Telephony. INFOCOM 2000: 707-716

Yi Li, Philip M. Long, Aravind Srinivasan: Improved bounds on the sample complexity of learning. SODA 2000: 309-318

Aravind Srinivasan: The value of strong inapproximability results for clique. STOC 2000: 144-152

Peter Auer, Philip M. Long, Aravind Srinivasan: Approximating Hyper-Rectangles: Learning and Pseudo-random Sets. Electronic Colloquium on Computational Complexity (ECCC) 7(72) (2000)

Aravind Srinivasan, David Zuckerman: Computing with Very Weak Random Sources. SIAM J. Comput. 28(4): 1433-1459 (1999)

Aravind Srinivasan: Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM J. Comput. 29(2): 648-670 (1999)

Ping Bai, B. Prabhakaran, Aravind Srinivasan: Application-layer broker for scalable Internet services with resource reservation. ACM Multimedia (2) 1999: 103-106

Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman: Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families. RANDOM-APPROX 1999: 11-15

Frank Thomson Leighton, Satish Rao, Aravind Srinivasan: New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SODA 1999: 643-652

Michael E. Saks, Aravind Srinivasan, Shiyu Zhou: Explicit OR-Dispersers with Polylogarithmic Degree. J. ACM 45(1): 123-154 (1998)

Peter Auer, Philip M. Long, Aravind Srinivasan: Approximating Hyper-Rectangles: Learning and Pseudorandom Sets. J. Comput. Syst. Sci. 57(3): 376-388 (1998)

Jaikumar Radhakrishnan, Aravind Srinivasan: Improved Bounds and Algorithms for Hypergraph Two-Coloring. FOCS 1998: 684-693

Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann: Low-Bandwidth Routing and Electrical Power Networks. ICALP 1998: 604-615

Noga Alon, Aravind Srinivasan: Improved Parallel Approximation of a Class of Integer Programming Problems. Algorithmica 17(4): 449-462 (1997)

Alessandro Panconesi, Aravind Srinivasan: Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds. SIAM J. Comput. 26(2): 350-368 (1997)

Aravind Srinivasan: Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problems. FOCS 1997: 416-425

P. S. Giridharan, Aravind Srinivasan: Mechanism design for intellectual property rights protection. ICIS 1997: 448

Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk: Better Approximation Guarantees for Job-shop Scheduling. SODA 1997: 599-608

Aravind Srinivasan: Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems. SODA 1997: 692-701

Peter Auer, Philip M. Long, Aravind Srinivasan: Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets. STOC 1997: 314-323

Aravind Srinivasan, Chung-Piaw Teo: A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria. STOC 1997: 636-643

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

Noga Alon, Aravind Srinivasan: Improved Parallel Approximation of a Class of Integer Programming Programming Problems. ICALP 1996: 562-573

Aravind Srinivasan: An Extension of the Lovász Local Lemma, and its Applications to Integer Programming. SODA 1996: 6-15

Alessandro Panconesi, Aravind Srinivasan: The Local Natur of Delta-Coloring and its Algorithmic Applications. Combinatorica 15(2): 255-280 (1995)

Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan: Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems. SIAM J. Comput. 24(5): 1036-1050 (1995)

Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan: Chernoff-Hoeffding Bounds for Applications with Limited Independence. SIAM J. Discrete Math. 8(2): 223-250 (1995)

Mike Paterson, Aravind Srinivasan: Contention Resolution with Bounded Delay. FOCS 1995: 104-113

Moni Naor, Leonard J. Schulman, Aravind Srinivasan: Splitters and Near-Optimal Derandomization. FOCS 1995: 182-191

Aravind Srinivasan: Improved approximations of packing and covering problems. STOC 1995: 268-276

Michael E. Saks, Aravind Srinivasan, Shiyu Zhou: Explicit dispersers with polylog degree. STOC 1995: 479-488

Aravind Srinivasan, David Zuckerman: Computing with Very Weak Random Sources. FOCS 1994: 264-275

Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan: Improved algorithms via approximations of probability distributions (extended abstract). STOC 1994: 584-592

Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan: Chernoff-Hoeffding Bounds for Applications with Limited Independence. SODA 1993: 331-340

Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan: Randomness-optimal unique element isolation, with applications to perfect matching and related problems. STOC 1993: 458-467

Alessandro Panconesi, Aravind Srinivasan: Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract). PODC 1992: 251-262

Alessandro Panconesi, Aravind Srinivasan: Improved Distributed Algorithms for Coloring and Network Decomposition Problems. STOC 1992: 581-592

R. Mahesh, C. Pandu Rangan, Aravind Srinivasan: On Finding the Minimum Bandwidth of Interval Graphs. Inf. Comput. 95(2): 218-224 (1991)

Aravind Srinivasan, C. Pandu Rangan: Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs. Theor. Comput. Sci. 91(1): 1-21 (1991)