|
Search the dblp DataBase
Ravi Sundaram:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Rosario Gennaro, Darren Leigh, Ravi Sundaram, William S. Yerazunis
Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices. [Citation Graph (0, 0)][DBLP] ASIACRYPT, 2004, pp:276-292 [Conf]
- Marcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram
Alternation in Interaction. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1994, pp:294-303 [Conf]
- Ravi Kumar, Alexander Russell, Ravi Sundaram
Approximating Latin Square Extensions. [Citation Graph (0, 0)][DBLP] COCOON, 1996, pp:280-289 [Conf]
- Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks. [Citation Graph (0, 0)][DBLP] DCOSS, 2006, pp:282-304 [Conf]
- Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP] ICALP, 1997, pp:281-291 [Conf]
- Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
Bicriteria Network Design Problems. [Citation Graph (0, 0)][DBLP] ICALP, 1995, pp:487-498 [Conf]
- Ravi Kumar, Alexander Russell, Ravi Sundaram
Faster Algorithms for Optical Switch Configuration. [Citation Graph (0, 0)][DBLP] ICC (3), 1997, pp:1320-1324 [Conf]
- Jiangzhuo Chen, Ravi Sundaram, Madhav V. Marathe, Rajmohan Rajaraman
The Confluent Capacity of the Internet: Congestion vs. Dilation. [Citation Graph (0, 0)][DBLP] ICDCS, 2006, pp:5- [Conf]
- Anja Feldmann, Nils Kammenhuber, Olaf Maennel, Bruce M. Maggs, Roberto De Prisco, Ravi Sundaram
A methodology for estimating interdomain web traffic demand. [Citation Graph (0, 0)][DBLP] Internet Measurement Conference, 2004, pp:322-335 [Conf]
- Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir, Ravi Sundaram
Minimum energy accumulative routing in wireless networks. [Citation Graph (0, 0)][DBLP] INFOCOM, 2005, pp:1875-1886 [Conf]
- Ahmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar
A Parallel Algorithm for Recognizing the Shuffle of Two Strings. [Citation Graph (0, 0)][DBLP] IPPS, 1992, pp:112-115 [Conf]
- Ramanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram
Unweaving a web of documents. [Citation Graph (0, 0)][DBLP] KDD, 2005, pp:574-579 [Conf]
- Daria Antonova, Arvind Krishnamurthy, Zheng Ma, Ravi Sundaram
Managing a portfolio of overlay paths. [Citation Graph (0, 0)][DBLP] NOSSDAV, 2004, pp:30-35 [Conf]
- R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
Spanning Trees Short or Small. [Citation Graph (0, 0)][DBLP] SODA, 1994, pp:546-555 [Conf]
- Iman Hajirasouliha, Hossein Jowhari, Ravi Kumar, Ravi Sundaram
On Completing Latin Squares. [Citation Graph (0, 0)][DBLP] STACS, 2007, pp:524-535 [Conf]
- Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
(Almost) tight bounds and existence theorems for confluent flows. [Citation Graph (0, 0)][DBLP] STOC, 2004, pp:529-538 [Conf]
- Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram
Meet and merge: approximation algorithms for confluent flows. [Citation Graph (0, 0)][DBLP] STOC, 2003, pp:373-382 [Conf]
- Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram
Universal approximations for TSP, Steiner tree, and set cover. [Citation Graph (0, 0)][DBLP] STOC, 2005, pp:386-395 [Conf]
- Madhav V. Marathe, R. Ravi, Ravi Sundaram
Service-Constrained Network Design Problems. [Citation Graph (0, 0)][DBLP] SWAT, 1996, pp:28-40 [Conf]
- Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
Treewidth of Circular-Arc Graphs (Abstract). [Citation Graph (0, 0)][DBLP] WADS, 1991, pp:41- [Conf]
- Ravi Kumar, Alexander Russell, Ravi Sundaram
Approximating Latin Square Extensions. [Citation Graph (0, 0)][DBLP] Algorithmica, 1999, v:24, n:2, pp:128-138 [Journal]
- Marcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram
Alternation in interaction. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2000, v:9, n:3-4, pp:202-246 [Journal]
- Alexander Russell, Ravi Sundaram
Symmetric Alternation Captures BPP. [Citation Graph (0, 0)][DBLP] Computational Complexity, 1998, v:7, n:2, pp:152-162 [Journal]
- Alexander Russell, Ravi Sundaram
A Note on the Asymptotics and Computational Complexity of Graph Distinguishability. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
- Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
Bicriteria Network Design Problems [Citation Graph (0, 0)][DBLP] CoRR, 1998, v:0, n:, pp:- [Journal]
- Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram
A Note on Optical Routing on Trees. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:62, n:6, pp:295-300 [Journal]
- Alexander Russell, Ravi Sundaram
The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:2, pp:61-68 [Journal]
- Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
Improving Minimum Cost Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:1, pp:92-111 [Journal]
- Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
Bicriteria Network Design Problems. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1998, v:28, n:1, pp:142-171 [Journal]
- Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram
Meet and merge: Approximation algorithms for confluent flows. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:3, pp:468-489 [Journal]
- Madhav V. Marathe, R. Ravi, Ravi Sundaram
Service-Constrained Network Design Problems. [Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1996, v:3, n:4, pp:367-387 [Journal]
- Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram
Efficient Parallel Shuffle Recognition. [Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1994, v:4, n:, pp:455-463 [Journal]
- R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
Spanning Trees - Short or Small. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1996, v:9, n:2, pp:178-200 [Journal]
- Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
Treewidth of Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1994, v:7, n:4, pp:647-655 [Journal]
- Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:221, n:1-2, pp:139-155 [Journal]
- R. Srikant, Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:115, n:2, pp:351-357 [Journal]
- R. C. Chakinala, A. Kumarasubramanian, R. Manokaran, G. Noubir, C. Pandu Rangan, Ravi Sundaram
Steganographic Communication in Ordered Channels. [Citation Graph (0, 0)][DBLP] Information Hiding, 2006, pp:42-57 [Conf]
- Xin Liu, Guevara Noubir, Ravi Sundaram, San Tan
SPREAD: Foiling Smart Jammers Using Multi-Layer Agility. [Citation Graph (0, 0)][DBLP] INFOCOM, 2007, pp:2536-2540 [Conf]
- Nikolaos Laoutaris, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
A bounded-degree network formation game [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Michael Klugerman, Alexander Russell, Ravi Sundaram
On embedding complete graphs into hypercubes. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:186, n:1-3, pp:289-293 [Journal]
- Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
(Almost) Tight bounds and existence theorems for single-commodity confluent flows. [Citation Graph (0, 0)][DBLP] J. ACM, 2007, v:54, n:4, pp:- [Journal]
Reducibility among Fractional Stability Problems. [Citation Graph (, )][DBLP]
Preprocessing DNS Log Data for Effective Data Mining. [Citation Graph (, )][DBLP]
Existence Theorems and Approximation Algorithms for Generalized Network Security Games. [Citation Graph (, )][DBLP]
A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses. [Citation Graph (, )][DBLP]
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. [Citation Graph (, )][DBLP]
Delay tolerant bulk data transfers on the internet. [Citation Graph (, )][DBLP]
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget [Citation Graph (, )][DBLP]
Preference Games and Personalized Equilibria, with Applications to Fractional BGP [Citation Graph (, )][DBLP]
Reducibility Among Fractional Stability Problems [Citation Graph (, )][DBLP]
Capacitated Caching Games [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.008secs
|