The SCEAS System
| |||||||

## Search the dblp DataBase
Aravind Srinivasan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Eran Halperin, Aravind Srinivasan
**Improved Approximation Algorithms for the Partial Vertex Cover Problem.**[Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:161-174 [Conf] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:146-157 [Conf] - Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan
**Wavelength rerouting in optical networks, or the Venetian routing problem.**[Citation Graph (0, 0)][DBLP] APPROX, 2000, pp:72-83 [Conf] - Anupam Gupta, Aravind Srinivasan, Éva Tardos
**Cost-Sharing Mechanisms for Network Design.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2004, pp:139-150 [Conf] - Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Dependent Rounding in Bipartite Graphs.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:323-332 [Conf] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Approximation Algorithms for Scheduling on Multiple Machines.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:254-263 [Conf] - Moni Naor, Leonard J. Schulman, Aravind Srinivasan
**Splitters and Near-Optimal Derandomization.**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:182-191 [Conf] - Mike Paterson, Aravind Srinivasan
**Contention Resolution with Bounded Delay.**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:104-113 [Conf] - Jaikumar Radhakrishnan, Aravind Srinivasan
**Improved Bounds and Algorithms for Hypergraph Two-Coloring.**[Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:684-693 [Conf] - Aravind Srinivasan
**Distributions on Level-Sets with Applications to Approximation Algorithms.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:588-597 [Conf] - Aravind Srinivasan
**Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problems.**[Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:416-425 [Conf] - Aravind Srinivasan, David Zuckerman
**Computing with Very Weak Random Sources**[Citation Graph (0, 0)][DBLP] FOCS, 1994, pp:264-275 [Conf] - Anupam Gupta, Aravind Srinivasan
**On the Covering Steiner Problem.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2003, pp:244-251 [Conf] - Kalyanmoy Deb, Aravind Srinivasan
**Innovization: innovating design principles through optimization.**[Citation Graph (0, 0)][DBLP] GECCO, 2006, pp:1629-1636 [Conf] - Noga Alon, Aravind Srinivasan
**Improved Parallel Approximation of a Class of Integer Programming Programming Problems.**[Citation Graph (0, 0)][DBLP] ICALP, 1996, pp:562-573 [Conf] - Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann
**Low-Bandwidth Routing and Electrical Power Networks.**[Citation Graph (0, 0)][DBLP] ICALP, 1998, pp:604-615 [Conf] - Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
**An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:164-175 [Conf] - Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
**Approximation Algorithms for Partial Covering Problems.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:225-236 [Conf] - P. S. Giridharan, Aravind Srinivasan
**Mechanism design for intellectual property rights protection.**[Citation Graph (0, 0)][DBLP] ICIS, 1997, pp:448- [Conf] - Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane
**Clustering and Server Selection using Passive Monitoring.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2002, pp:- [Conf] - Aravind Srinivasan, K. G. Ramakrishnan, Krishnan Kumaran, Murali Aravamudan, Shamim A. Naqvi
**Optimal Design of Signaling Networks for Internet Telephony.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2000, pp:707-716 [Conf] - V. S. Anil Kumar, Srinivasan Parthasarathy 0002, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust
**Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes.**[Citation Graph (0, 0)][DBLP] IPDPS, 2005, pp:- [Conf] - Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis
**Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:628-637 [Conf] - Ping Bai, B. Prabhakaran, Aravind Srinivasan
**Application-layer broker for scalable Internet services with resource reservation.**[Citation Graph (0, 0)][DBLP] ACM Multimedia (2), 1999, pp:103-106 [Conf] - Suman Banerjee, Seungjoon Lee, Ryan Braud, Bobby Bhattacharjee, Aravind Srinivasan
**Scalable resilient media streaming.**[Citation Graph (0, 0)][DBLP] NOSSDAV, 2004, pp:4-9 [Conf] - Ruggero Morselli, Bobby Bhattacharjee, Aravind Srinivasan, Michael A. Marsh
**Efficient lookup on unstructured topologies.**[Citation Graph (0, 0)][DBLP] PODC, 2005, pp:77-86 [Conf] - Alessandro Panconesi, Aravind Srinivasan
**Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract).**[Citation Graph (0, 0)][DBLP] PODC, 1992, pp:251-262 [Conf] - Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang
**Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:47-58 [Conf] - Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
**Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 1999, pp:11-15 [Conf] - Suman Banerjee, Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan
**Resilient multicast using overlays.**[Citation Graph (0, 0)][DBLP] SIGMETRICS, 2003, pp:102-113 [Conf] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Algorithmic aspects of capacity in wireless networks.**[Citation Graph (0, 0)][DBLP] SIGMETRICS, 2005, pp:133-144 [Conf] - Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
**Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:717-724 [Conf] - Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang
**Structural and algorithmic aspects of massive social networks.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:718-727 [Conf] - Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk
**Better Approximation Guarantees for Job-shop Scheduling.**[Citation Graph (0, 0)][DBLP] SODA, 1997, pp:599-608 [Conf] - Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang
**Integrality ratio for group Steiner trees and directed steiner trees.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:275-284 [Conf] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**End-to-end packet-scheduling in wireless ad-hoc networks.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1021-1030 [Conf] - Frank Thomson Leighton, Satish Rao, Aravind Srinivasan
**New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:643-652 [Conf] - Yi Li, Philip M. Long, Aravind Srinivasan
**Improved bounds on the sample complexity of learning.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:309-318 [Conf] - Aravind Srinivasan
**Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.**[Citation Graph (0, 0)][DBLP] SODA, 1997, pp:692-701 [Conf] - Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
**Chernoff-Hoeffding Bounds for Applications with Limited Independence.**[Citation Graph (0, 0)][DBLP] SODA, 1993, pp:331-340 [Conf] - Aravind Srinivasan
**New approaches to covering and packing problems.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:567-576 [Conf] - Aravind Srinivasan
**Domatic partitions and the Lovász local lemma.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:922-923 [Conf] - Aravind Srinivasan
**An Extension of the Lovász Local Lemma, and its Applications to Integer Programming.**[Citation Graph (0, 0)][DBLP] SODA, 1996, pp:6-15 [Conf] - Rob Sherwood, Bobby Bhattacharjee, Aravind Srinivasan
**P5: A Protocol for Scalable Anonymous Communication.**[Citation Graph (0, 0)][DBLP] IEEE Symposium on Security and Privacy, 2002, pp:58-0 [Conf] - Hadas Shachnai, Aravind Srinivasan
**Finding large independent sets of hypergraphs in parallel.**[Citation Graph (0, 0)][DBLP] SPAA, 2001, pp:163-168 [Conf] - Peter Auer, Philip M. Long, Aravind Srinivasan
**Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets.**[Citation Graph (0, 0)][DBLP] STOC, 1997, pp:314-323 [Conf] - Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan
**Randomness-optimal unique element isolation, with applications to perfect matching and related problems.**[Citation Graph (0, 0)][DBLP] STOC, 1993, pp:458-467 [Conf] - Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan
**Improved algorithms via approximations of probability distributions (extended abstract).**[Citation Graph (0, 0)][DBLP] STOC, 1994, pp:584-592 [Conf] - Alessandro Panconesi, Aravind Srinivasan
**Improved Distributed Algorithms for Coloring and Network Decomposition Problems**[Citation Graph (0, 0)][DBLP] STOC, 1992, pp:581-592 [Conf] - Michael E. Saks, Aravind Srinivasan, Shiyu Zhou
**Explicit dispersers with polylog degree.**[Citation Graph (0, 0)][DBLP] STOC, 1995, pp:479-488 [Conf] - Aravind Srinivasan
**The value of strong inapproximability results for clique.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:144-152 [Conf] - Aravind Srinivasan
**Improved approximations of packing and covering problems.**[Citation Graph (0, 0)][DBLP] STOC, 1995, pp:268-276 [Conf] - Aravind Srinivasan, Chung-Piaw Teo
**A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria.**[Citation Graph (0, 0)][DBLP] STOC, 1997, pp:636-643 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Algorithm Engineering, 2001, pp:172-184 [Conf] - Noga Alon, Aravind Srinivasan
**Improved Parallel Approximation of a Class of Integer Programming Problems.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:17, n:4, pp:449-462 [Journal] - Alessandro Panconesi, Aravind Srinivasan
**The Local Natur of Delta-Coloring and its Algorithmic Applications.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1995, v:15, n:2, pp:255-280 [Journal] - Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis
**Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance**[Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal] - Aravind Srinivasan
**An Extension of the Lovasz Local Lemma, and its Applications to Integer Programming**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Peter Auer, Philip M. Long, Aravind Srinivasan
**Approximating Hyper-Rectangles: Learning and Pseudo-random Sets**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:72, pp:- [Journal] - Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis
**Lower bounds on the Deterministic and Quantum Communication Complexity of HAM**[Citation Graph (0, 0)][DBLP]_{n}^{a} Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:120, pp:- [Journal] - R. Mahesh, C. Pandu Rangan, Aravind Srinivasan
**On Finding the Minimum Bandwidth of Interval Graphs**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1991, v:95, n:2, pp:218-224 [Journal] - Alok Baveja, Aravind Srinivasan
**Approximating low-congestion routing and column-restricted packing problems.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:74, n:1-2, pp:19-25 [Journal] - Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
**Low discrepancy sets yield approximate min-wise independent permutation families.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:73, n:1-2, pp:29-32 [Journal] - Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan
**Contention resolution with constant expected delay.**[Citation Graph (0, 0)][DBLP] J. ACM, 2000, v:47, n:6, pp:1048-1096 [Journal] - Michael E. Saks, Aravind Srinivasan, Shiyu Zhou
**Explicit OR-Dispersers with Polylogarithmic Degree.**[Citation Graph (0, 0)][DBLP] J. ACM, 1998, v:45, n:1, pp:123-154 [Journal] - Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Dependent rounding and its applications to approximation algorithms.**[Citation Graph (0, 0)][DBLP] J. ACM, 2006, v:53, n:3, pp:324-360 [Journal] - Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan
**Wavelength rerouting in optical networks, or the Venetian Routing problem.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2002, v:45, n:2, pp:93-125 [Journal] - Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
**Approximation algorithms for partial covering problems.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:53, n:1, pp:55-84 [Journal] - Alessandro Panconesi, Aravind Srinivasan
**On the Complexity of Distributed Network Decomposition.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:2, pp:356-374 [Journal] - Rob Sherwood, Bobby Bhattacharjee, Aravind Srinivasan
**P**[Citation Graph (0, 0)][DBLP]^{5}: A protocol for scalable anonymous communication. Journal of Computer Security, 2005, v:13, n:6, pp:839-876 [Journal] - Peter Auer, Philip M. Long, Aravind Srinivasan
**Approximating Hyper-Rectangles: Learning and Pseudorandom Sets.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1998, v:57, n:3, pp:376-388 [Journal] - Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan
**Improved Algorithms via Approximations of Probability Distributions.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2000, v:61, n:1, pp:81-107 [Journal] - Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
**Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:71, n:4, pp:467-479 [Journal] - Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
**An improved approximation algorithm for vertex cover with hard capacities.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:16-33 [Journal] - Sanjeev Khanna, Aravind Srinivasan
**Special issue: 35th Annual ACM Symposium on Theory of Computing.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:3, pp:305-0 [Journal] - Yi Li, Philip M. Long, Aravind Srinivasan
**Improved Bounds on the Sample Complexity of Learning.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:62, n:3, pp:516-527 [Journal] - Aravind Srinivasan
**On the approximability of clique and related maximization problems.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:3, pp:633-651 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] J. Graph Algorithms Appl., 2003, v:7, n:1, pp:3-31 [Journal] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan, Sibylle Zust
**Provable algorithms for parallel generalized sweep scheduling.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2006, v:66, n:6, pp:807-821 [Journal] - Ping Bai, B. Prabhakaran, Aravind Srinivasan
**Retrieval Scheduling for Collaborative Multimedia Presentations.**[Citation Graph (0, 0)][DBLP] Multimedia Syst., 2000, v:8, n:2, pp:146-155 [Journal] - Alok Baveja, Aravind Srinivasan
**Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems.**[Citation Graph (0, 0)][DBLP] Math. Oper. Res., 2000, v:25, n:2, pp:255-280 [Journal] - Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang
**Approximation algorithms for channel allocation problems in broadcast networks.**[Citation Graph (0, 0)][DBLP] Networks, 2006, v:47, n:4, pp:225-236 [Journal] - Goran Konjevod, R. Ravi, Aravind Srinivasan
**Approximation algorithms for the covering Steiner problem.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2002, v:20, n:3, pp:465-482 [Journal] - Jaikumar Radhakrishnan, Aravind Srinivasan
**Improved bounds and algorithms for hypergraph 2-coloring.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2000, v:16, n:1, pp:4-32 [Journal] - Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan
**Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1995, v:24, n:5, pp:1036-1050 [Journal] - Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan
**Approximating the Domatic Number.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:32, n:1, pp:172-195 [Journal] - Frank Thomson Leighton, Chi-Jen Lu, Satish Rao, Aravind Srinivasan
**New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2001, v:31, n:2, pp:626-641 [Journal] - Alessandro Panconesi, Aravind Srinivasan
**Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1997, v:26, n:2, pp:350-368 [Journal] - Aravind Srinivasan
**Improved Approximation Guarantees for Packing and Covering Integer Programs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:29, n:2, pp:648-670 [Journal] - Aravind Srinivasan, Chung-Piaw Teo
**A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:6, pp:2051-2068 [Journal] - Aravind Srinivasan, David Zuckerman
**Computing with Very Weak Random Sources.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:28, n:4, pp:1433-1459 [Journal] - Aravind Srinivasan
**An Extension of the Lovász Local Lemma, and its Applications to Integer Programming.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:3, pp:609-634 [Journal] - Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang
**Integrality Ratio for Group Steiner Trees and Directed Steiner Trees.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:36, n:5, pp:1494-1511 [Journal] - Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk
**Better Approximation Guarantees for Job-Shop Scheduling.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2001, v:14, n:1, pp:67-92 [Journal] - Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
**Chernoff-Hoeffding Bounds for Applications with Limited Independence.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1995, v:8, n:2, pp:223-250 [Journal] - Hadas Shachnai, Aravind Srinivasan
**Finding Large Independent Sets in Graphs and Hypergraphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2004, v:18, n:3, pp:488-500 [Journal] - Arunesh Mishra, Vladimir Brik, Suman Banerjee, Aravind Srinivasan, William A. Arbaugh
**Client-driven channel management for wireless LANs.**[Citation Graph (0, 0)][DBLP] Mobile Computing and Communications Review, 2006, v:10, n:4, pp:8-10 [Journal] - William I. Gasarch, Evan Golub, Aravind Srinivasan
**When does a random Robin Hood win?**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:304, pp:477-484 [Journal] - Aravind Srinivasan, C. Pandu Rangan
**Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1991, v:91, n:1, pp:1-21 [Journal] - Yi Li, Philip M. Long, Aravind Srinivasan
**The one-inclusion graph algorithm is near-optimal for the prediction model of learning.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:3, pp:1257-1261 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] HCI (4), 2007, pp:1150-1159 [Conf] - Arunesh Mishra, Vladimir Brik, Suman Banerjee, Aravind Srinivasan, William A. Arbaugh
**A Client-Driven Approach for Channel Management in Wireless LANs.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2006, pp:- [Conf] - Aravind Srinivasan
**Randomized Algorithms and Probabilistic Analysis in Wireless Networking.**[Citation Graph (0, 0)][DBLP] SAGA, 2007, pp:54-57 [Conf] - Aravind Srinivasan
**Approximation algorithms for stochastic and risk-averse optimization.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:1305-1313 [Conf] - Peter Sanders, Aravind Srinivasan, Berthold Vöcking
**Foreword.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:6, pp:785- [Journal] **Budgeted Allocations in the Full-Information Setting.**[Citation Graph (, )][DBLP]**Distributed Ranked Search.**[Citation Graph (, )][DBLP]**The Randomized Coloring Procedure with Symmetry-Breaking.**[Citation Graph (, )][DBLP]**Maximum Bipartite Flow in Networks with Adaptive Channel Width.**[Citation Graph (, )][DBLP]**Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints.**[Citation Graph (, )][DBLP]**Capacity of Asynchronous Random-Access Scheduling in Wireless Networks.**[Citation Graph (, )][DBLP]**Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks.**[Citation Graph (, )][DBLP]**Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm.**[Citation Graph (, )][DBLP]**On**[Citation Graph (, )][DBLP]*k*-Column Sparse Packing Programs.**Cross-layer latency minimization in wireless networks with SINR constraints.**[Citation Graph (, )][DBLP]**On random sampling auctions for digital goods.**[Citation Graph (, )][DBLP]**Improved algorithmic versions of the Lovász Local Lemma.**[Citation Graph (, )][DBLP]**Rigorous Probabilistic Trust-Inference with Applications to Clustering.**[Citation Graph (, )][DBLP]**A New Approximation Technique for Resource-Allocation Problems.**[Citation Graph (, )][DBLP]**Cost-Sharing Mechanisms for Network Design.**[Citation Graph (, )][DBLP]**Scheduling on Unrelated Machines under Tree-Like Precedence Constraints.**[Citation Graph (, )][DBLP]**New Constructive Aspects of the Lovasz Local Lemma**[Citation Graph (, )][DBLP]**A New Approximation Technique for Resource-Allocation Problems**[Citation Graph (, )][DBLP]**Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm**[Citation Graph (, )][DBLP]**LP-rounding algorithms for facility-location problems**[Citation Graph (, )][DBLP]
Search in 0.021secs, Finished in 0.025secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |