| 2008 |
|---|
| 119 | EE | Aravind Srinivasan:
Budgeted Allocations in the Full-Information Setting.
APPROX-RANDOM 2008: 247-253 |
| 118 | EE | Sriram Pemmaraju,
Aravind Srinivasan:
The Randomized Coloring Procedure with Symmetry-Breaking.
ICALP (1) 2008: 306-319 |
| 117 | EE | 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 |
| 116 | EE | 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 |
| 115 | EE | Aravind Srinivasan:
Improved algorithmic versions of the Lovász Local Lemma.
SODA 2008: 611-620 |
| 114 | EE | V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Minimum Weighted Completion Time.
Encyclopedia of Algorithms 2008 |
| 113 | EE | Anupam Gupta,
Aravind Srinivasan,
Éva Tardos:
Cost-Sharing Mechanisms for Network Design.
Algorithmica 50(1): 98-119 (2008) |
| 112 | EE | Aravind Srinivasan:
A note on the distribution of the number of prime factors of the integers.
Inf. Process. Lett. 109(2): 133-135 (2008) |
| 2007 |
|---|
| 111 | EE | 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 |
| 110 | EE | Vijay Gopalakrishnan,
Ruggero Morselli,
Bobby Bhattacharjee,
Peter J. Keleher,
Aravind Srinivasan:
Distributed Ranked Search.
HiPC 2007: 7-20 |
| 109 | EE | 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 |
| 108 | EE | Aravind Srinivasan:
Randomized Algorithms and Probabilistic Analysis in Wireless Networking.
SAGA 2007: 54-57 |
| 107 | EE | Aravind Srinivasan:
Approximation algorithms for stochastic and risk-averse optimization.
SODA 2007: 1305-1313 |
| 106 | EE | 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) |
| 105 | EE | 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) |
| 2006 |
|---|
| 104 | EE | Kalyanmoy Deb,
Aravind Srinivasan:
Innovization: innovating design principles through optimization.
GECCO 2006: 1629-1636 |
| 103 | EE | Arunesh Mishra,
Vladimir Brik,
Suman Banerjee,
Aravind Srinivasan,
William A. Arbaugh:
A Client-Driven Approach for Channel Management in Wireless LANs.
INFOCOM 2006 |
| 102 | EE | 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 |
| 101 | EE | Suman Banerjee,
Seungjoon Lee,
Bobby Bhattacharjee,
Aravind Srinivasan:
Resilient multicast using overlays.
IEEE/ACM Trans. Netw. 14(2): 237-248 (2006) |
| 100 | EE | Rajiv Gandhi,
Samir Khuller,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Dependent rounding and its applications to approximation algorithms.
J. ACM 53(3): 324-360 (2006) |
| 99 | EE | 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) |
| 98 | EE | 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) |
| 97 | EE | 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) |
| 96 | EE | Rajiv Gandhi,
Samir Khuller,
Aravind Srinivasan,
Nan Wang:
Approximation algorithms for channel allocation problems in broadcast networks.
Networks 47(4): 225-236 (2006) |
| 95 | EE | Aravind Srinivasan:
An Extension of the Lovász Local Lemma, and its Applications to Integer Programming.
SIAM J. Comput. 36(3): 609-634 (2006) |
| 94 | EE | Aravind Srinivasan:
Review of "The Random Projection Method by Santosh Vempala".
SIGACT News 37(4): 41-43 (2006) |
| 93 | EE | Peter Sanders,
Aravind Srinivasan,
Berthold Vöcking:
Foreword.
Theory Comput. Syst. 39(6): 785 (2006) |
| 92 | EE | Anupam Gupta,
Aravind Srinivasan:
An Improved Approximation Ratio for the Covering Steiner Problem.
Theory of Computing 2(1): 53-64 (2006) |
| 2005 |
|---|
| 91 | EE | 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 |
| 90 | EE | V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Approximation Algorithms for Scheduling on Multiple Machines.
FOCS 2005: 254-263 |
| 89 | EE | V. S. Anil Kumar,
Srinivasan Parthasarathy,
Madhav V. Marathe,
Aravind Srinivasan,
Sibylle Zust:
Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes.
IPDPS 2005 |
| 88 | EE | Ruggero Morselli,
Bobby Bhattacharjee,
Aravind Srinivasan,
Michael A. Marsh:
Efficient lookup on unstructured topologies.
PODC 2005: 77-86 |
| 87 | EE | V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Algorithmic aspects of capacity in wireless networks.
SIGMETRICS 2005: 133-144 |
| 86 | EE | 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) |
| 85 | EE | Rob Sherwood,
Bobby Bhattacharjee,
Aravind Srinivasan:
P5: A protocol for scalable anonymous communication.
Journal of Computer Security 13(6): 839-876 (2005) |
| 2004 |
|---|
| 84 | EE | Anupam Gupta,
Aravind Srinivasan,
Éva Tardos:
Cost-Sharing Mechanisms for Network Design.
APPROX-RANDOM 2004: 139-150 |
| 83 | EE | Suman Banerjee,
Seungjoon Lee,
Ryan Braud,
Bobby Bhattacharjee,
Aravind Srinivasan:
Scalable resilient media streaming.
NOSSDAV 2004: 4-9 |
| 82 | EE | 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 |
| 81 | EE | 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 |
| 80 | EE | 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) |
| 79 | EE | Andris Ambainis,
William I. Gasarch,
Aravind Srinivasan,
Andrey Utis:
Lower bounds on the Deterministic and Quantum Communication Complexity of HAMna
Electronic Colloquium on Computational Complexity (ECCC)(120): (2004) |
| 78 | EE | Rajiv Gandhi,
Samir Khuller,
Aravind Srinivasan:
Approximation algorithms for partial covering problems.
J. Algorithms 53(1): 55-84 (2004) |
| 77 | EE | Sanjeev Khanna,
Aravind Srinivasan:
Special issue: 35th Annual ACM Symposium on Theory of Computing.
J. Comput. Syst. Sci. 69(3): 305- (2004) |
| 76 | EE | Hadas Shachnai,
Aravind Srinivasan:
Finding Large Independent Sets in Graphs and Hypergraphs.
SIAM J. Discrete Math. 18(3): 488-500 (2004) |
| 2003 |
|---|
| 75 | EE | Anupam Gupta,
Aravind Srinivasan:
On the Covering Steiner Problem.
FSTTCS 2003: 244-251 |
| 74 | EE | Rajiv Gandhi,
Eran Halperin,
Samir Khuller,
Guy Kortsarz,
Aravind Srinivasan:
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.
ICALP 2003: 164-175 |
| 73 | EE | Rajiv Gandhi,
Samir Khuller,
Aravind Srinivasan,
Nan Wang:
Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.
RANDOM-APPROX 2003: 47-58 |
| 72 | EE | Suman Banerjee,
Seungjoon Lee,
Bobby Bhattacharjee,
Aravind Srinivasan:
Resilient multicast using overlays.
SIGMETRICS 2003: 102-113 |
| 71 | EE | Eran Halperin,
Guy Kortsarz,
Robert Krauthgamer,
Aravind Srinivasan,
Nan Wang:
Integrality ratio for group Steiner trees and directed steiner trees.
SODA 2003: 275-284 |
| 70 | EE | 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 |
| 69 | EE | Aravind Srinivasan:
An Extension of the Lovasz Local Lemma, and its Applications to Integer Programming
CoRR cs.DS/0307043: (2003) |
| 68 | EE | Aravind Srinivasan:
On the approximability of clique and related maximization problems.
J. Comput. Syst. Sci. 67(3): 633-651 (2003) |
| 67 | EE | 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) |
| 66 | EE | William I. Gasarch,
Evan Golub,
Aravind Srinivasan:
When does a random Robin Hood win?
Theor. Comput. Sci. 1-3(304): 477-484 (2003) |
| 2002 |
|---|
| 65 | EE | Eran Halperin,
Aravind Srinivasan:
Improved Approximation Algorithms for the Partial Vertex Cover Problem.
APPROX 2002: 161-174 |
| 64 | EE | Rajiv Gandhi,
Samir Khuller,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Dependent Rounding in Bipartite Graphs.
FOCS 2002: 323-332 |
| 63 | EE | Rob Sherwood,
Bobby Bhattacharjee,
Aravind Srinivasan:
P5: A Protocol for Scalable Anonymous Communication.
IEEE Symposium on Security and Privacy 2002: 58- |
| 62 | EE | Matthew Andrews,
F. Bruce Shepherd,
Aravind Srinivasan,
Peter Winkler,
Francis Zane:
Clustering and Server Selection using Passive Monitoring.
INFOCOM 2002 |
| 61 | EE | 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) |
| 60 | EE | Goran Konjevod,
R. Ravi,
Aravind Srinivasan:
Approximation algorithms for the covering Steiner problem.
Random Struct. Algorithms 20(3): 465-482 (2002) |
| 59 | EE | Uriel Feige,
Magnús M. Halldórsson,
Guy Kortsarz,
Aravind Srinivasan:
Approximating the Domatic Number.
SIAM J. Comput. 32(1): 172-195 (2002) |
| 2001 |
|---|
| 58 | EE | 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 |
| 57 | | Aravind Srinivasan:
Distributions on Level-Sets with Applications to Approximation Algorithms.
FOCS 2001: 588-597 |
| 56 | EE | Rajiv Gandhi,
Samir Khuller,
Aravind Srinivasan:
Approximation Algorithms for Partial Covering Problems.
ICALP 2001: 225-236 |
| 55 | EE | Aravind Srinivasan:
New approaches to covering and packing problems.
SODA 2001: 567-576 |
| 54 | EE | Aravind Srinivasan:
Domatic partitions and the Lovász local lemma.
SODA 2001: 922-923 |
| 53 | EE | Hadas Shachnai,
Aravind Srinivasan:
Finding large independent sets of hypergraphs in parallel.
SPAA 2001: 163-168 |
| 52 | | 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) |
| 51 | | Yi Li,
Philip M. Long,
Aravind Srinivasan:
Improved Bounds on the Sample Complexity of Learning.
J. Comput. Syst. Sci. 62(3): 516-527 (2001) |
| 50 | EE | 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) |
| 49 | EE | 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) |
| 2000 |
|---|
| 48 | EE | 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 |
| 47 | EE | Aravind Srinivasan,
K. G. Ramakrishnan,
Krishnan Kumaran,
Murali Aravamudan,
Shamim A. Naqvi:
Optimal Design of Signaling Networks for Internet Telephony.
INFOCOM 2000: 707-716 |
| 46 | EE | Yi Li,
Philip M. Long,
Aravind Srinivasan:
Improved bounds on the sample complexity of learning.
SODA 2000: 309-318 |
| 45 | EE | Aravind Srinivasan:
The value of strong inapproximability results for clique.
STOC 2000: 144-152 |
| 44 | EE | Peter Auer,
Philip M. Long,
Aravind Srinivasan:
Approximating Hyper-Rectangles: Learning and Pseudo-random Sets
Electronic Colloquium on Computational Complexity (ECCC) 7(72): (2000) |
| 43 | EE | 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) |
| 42 | EE | Alok Baveja,
Aravind Srinivasan:
Approximating low-congestion routing and column-restricted packing problems.
Inf. Process. Lett. 74(1-2): 19-25 (2000) |
| 41 | EE | Leslie Ann Goldberg,
Philip D. MacKenzie,
Mike Paterson,
Aravind Srinivasan:
Contention resolution with constant expected delay.
J. ACM 47(6): 1048-1096 (2000) |
| 40 | | Suresh Chari,
Pankaj Rohatgi,
Aravind Srinivasan:
Improved Algorithms via Approximations of Probability Distributions.
J. Comput. Syst. Sci. 61(1): 81-107 (2000) |
| 39 | EE | Alok Baveja,
Aravind Srinivasan:
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems.
Math. Oper. Res. 25(2): 255-280 (2000) |
| 38 | EE | Ping Bai,
B. Prabhakaran,
Aravind Srinivasan:
Retrieval Scheduling for Collaborative Multimedia Presentations.
Multimedia Syst. 8(2): 146-155 (2000) |
| 37 | | Jaikumar Radhakrishnan,
Aravind Srinivasan:
Improved bounds and algorithms for hypergraph 2-coloring.
Random Struct. Algorithms 16(1): 4-32 (2000) |
| 36 | EE | 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) |
| 1999 |
|---|
| 35 | EE | Ping Bai,
B. Prabhakaran,
Aravind Srinivasan:
Application-layer broker for scalable Internet services with resource reservation.
ACM Multimedia (2) 1999: 103-106 |
| 34 | | Michael E. Saks,
Aravind Srinivasan,
Shiyu Zhou,
David Zuckerman:
Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families.
RANDOM-APPROX 1999: 11-15 |
| 33 | EE | Frank Thomson Leighton,
Satish Rao,
Aravind Srinivasan:
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.
SODA 1999: 643-652 |
| 32 | | Aravind Srinivasan,
David Zuckerman:
Computing with Very Weak Random Sources.
SIAM J. Comput. 28(4): 1433-1459 (1999) |
| 31 | | Aravind Srinivasan:
Improved Approximation Guarantees for Packing and Covering Integer Programs.
SIAM J. Comput. 29(2): 648-670 (1999) |
| 1998 |
|---|
| 30 | EE | Jaikumar Radhakrishnan,
Aravind Srinivasan:
Improved Bounds and Algorithms for Hypergraph Two-Coloring.
FOCS 1998: 684-693 |
| 29 | EE | Doug Cook,
Vance Faber,
Madhav V. Marathe,
Aravind Srinivasan,
Yoram J. Sussmann:
Low-Bandwidth Routing and Electrical Power Networks.
ICALP 1998: 604-615 |
| 28 | EE | Michael E. Saks,
Aravind Srinivasan,
Shiyu Zhou:
Explicit OR-Dispersers with Polylogarithmic Degree.
J. ACM 45(1): 123-154 (1998) |
| 27 | | Peter Auer,
Philip M. Long,
Aravind Srinivasan:
Approximating Hyper-Rectangles: Learning and Pseudorandom Sets.
J. Comput. Syst. Sci. 57(3): 376-388 (1998) |
| 1997 |
|---|
| 26 | EE | Aravind Srinivasan:
Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problems.
FOCS 1997: 416-425 |
| 25 | EE | P. S. Giridharan,
Aravind Srinivasan:
Mechanism design for intellectual property rights protection.
ICIS 1997: 448 |
| 24 | | Leslie Ann Goldberg,
Mike Paterson,
Aravind Srinivasan,
Elizabeth Sweedyk:
Better Approximation Guarantees for Job-shop Scheduling.
SODA 1997: 599-608 |
| 23 | | Aravind Srinivasan:
Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.
SODA 1997: 692-701 |
| 22 | EE | Peter Auer,
Philip M. Long,
Aravind Srinivasan:
Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets.
STOC 1997: 314-323 |
| 21 | EE | Aravind Srinivasan,
Chung-Piaw Teo:
A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria.
STOC 1997: 636-643 |
| 20 | | Noga Alon,
Aravind Srinivasan:
Improved Parallel Approximation of a Class of Integer Programming Problems.
Algorithmica 17(4): 449-462 (1997) |
| 19 | | Alessandro Panconesi,
Aravind Srinivasan:
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds.
SIAM J. Comput. 26(2): 350-368 (1997) |
| 1996 |
|---|
| 18 | | Noga Alon,
Aravind Srinivasan:
Improved Parallel Approximation of a Class of Integer Programming Programming Problems.
ICALP 1996: 562-573 |
| 17 | | Aravind Srinivasan:
An Extension of the Lovász Local Lemma, and its Applications to Integer Programming.
SODA 1996: 6-15 |
| 16 | | Alessandro Panconesi,
Aravind Srinivasan:
On the Complexity of Distributed Network Decomposition.
J. Algorithms 20(2): 356-374 (1996) |
| 1995 |
|---|
| 15 | | Mike Paterson,
Aravind Srinivasan:
Contention Resolution with Bounded Delay.
FOCS 1995: 104-113 |
| 14 | | Moni Naor,
Leonard J. Schulman,
Aravind Srinivasan:
Splitters and Near-Optimal Derandomization.
FOCS 1995: 182-191 |
| 13 | EE | Aravind Srinivasan:
Improved approximations of packing and covering problems.
STOC 1995: 268-276 |
| 12 | EE | Michael E. Saks,
Aravind Srinivasan,
Shiyu Zhou:
Explicit dispersers with polylog degree.
STOC 1995: 479-488 |
| 11 | | Alessandro Panconesi,
Aravind Srinivasan:
The Local Natur of Delta-Coloring and its Algorithmic Applications.
Combinatorica 15(2): 255-280 (1995) |
| 10 | | 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) |
| 9 | EE | Jeanette P. Schmidt,
Alan Siegel,
Aravind Srinivasan:
Chernoff-Hoeffding Bounds for Applications with Limited Independence.
SIAM J. Discrete Math. 8(2): 223-250 (1995) |
| 1994 |
|---|
| 8 | | Aravind Srinivasan,
David Zuckerman:
Computing with Very Weak Random Sources
FOCS 1994: 264-275 |
| 7 | EE | Suresh Chari,
Pankaj Rohatgi,
Aravind Srinivasan:
Improved algorithms via approximations of probability distributions (extended abstract).
STOC 1994: 584-592 |
| 1993 |
|---|
| 6 | | Jeanette P. Schmidt,
Alan Siegel,
Aravind Srinivasan:
Chernoff-Hoeffding Bounds for Applications with Limited Independence.
SODA 1993: 331-340 |
| 5 | EE | Suresh Chari,
Pankaj Rohatgi,
Aravind Srinivasan:
Randomness-optimal unique element isolation, with applications to perfect matching and related problems.
STOC 1993: 458-467 |
| 1992 |
|---|
| 4 | | Alessandro Panconesi,
Aravind Srinivasan:
Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract).
PODC 1992: 251-262 |
| 3 | | Alessandro Panconesi,
Aravind Srinivasan:
Improved Distributed Algorithms for Coloring and Network Decomposition Problems
STOC 1992: 581-592 |
| 1991 |
|---|
| 2 | | R. Mahesh,
C. Pandu Rangan,
Aravind Srinivasan:
On Finding the Minimum Bandwidth of Interval Graphs
Inf. Comput. 95(2): 218-224 (1991) |
| 1 | | 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) |
