dblp.uni-trier.dewww.uni-trier.de

Ravi Sundaram

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
46EEShiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Reducibility Among Fractional Stability Problems CoRR abs/0904.1435: (2009)
2008
45EENikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. PODC 2008: 165-174
44EENikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget CoRR abs/0806.1727: (2008)
43EELaura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Preference Games and Personalized Equilibria, with Applications to Fractional BGP CoRR abs/0812.0598: (2008)
2007
42EEXin Liu, Guevara Noubir, Ravi Sundaram, San Tan: SPREAD: Foiling Smart Jammers Using Multi-Layer Agility. INFOCOM 2007: 2536-2540
41EEMark E. Snyder, Ravi Sundaram, Mayur Thakur: A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses. LCN 2007: 556-566
40EEIman Hajirasouliha, Hossein Jowhari, Ravi Kumar, Ravi Sundaram: On Completing Latin Squares. STACS 2007: 524-535
39EENikolaos Laoutaris, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: A bounded-degree network formation game CoRR abs/cs/0701071: (2007)
38EEJiangzhuo 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. J. ACM 54(4): (2007)
2006
37EELujun Jia, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram: GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks. DCOSS 2006: 282-304
36EEJiangzhuo Chen, Ravi Sundaram, Madhav V. Marathe, Rajmohan Rajaraman: The Confluent Capacity of the Internet: Congestion vs. Dilation. ICDCS 2006: 5
35EER. C. Chakinala, Abishek Kumarasubramanian, R. Manokaran, Guevara Noubir, C. Pandu Rangan, Ravi Sundaram: Steganographic Communication in Ordered Channels. Information Hiding 2006: 42-57
34EEJiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram: Meet and merge: Approximation algorithms for confluent flows. J. Comput. Syst. Sci. 72(3): 468-489 (2006)
2005
33EEJiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir, Ravi Sundaram: Minimum energy accumulative routing in wireless networks. INFOCOM 2005: 1875-1886
32EERamanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram: Unweaving a web of documents. KDD 2005: 574-579
31EELujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram: Universal approximations for TSP, Steiner tree, and set cover. STOC 2005: 386-395
2004
30EERosario Gennaro, Darren Leigh, Ravi Sundaram, William S. Yerazunis: Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices. ASIACRYPT 2004: 276-292
29EEAnja Feldmann, Nils Kammenhuber, Olaf Maennel, Bruce M. Maggs, Roberto De Prisco, Ravi Sundaram: A methodology for estimating interdomain web traffic demand. Internet Measurement Conference 2004: 322-335
28EEDaria Antonova, Arvind Krishnamurthy, Zheng Ma, Ravi Sundaram: Managing a portfolio of overlay paths. NOSSDAV 2004: 30-35
27EEJiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta: (Almost) tight bounds and existence theorems for confluent flows. STOC 2004: 529-538
2003
26EEJiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram: Meet and merge: approximation algorithms for confluent flows. STOC 2003: 373-382
2000
25EEMarcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram: Alternation in interaction. Computational Complexity 9(3-4): 202-246 (2000)
1999
24EERavi Kumar, Alexander Russell, Ravi Sundaram: Approximating Latin Square Extensions. Algorithmica 24(2): 128-138 (1999)
23 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. J. Algorithms 33(1): 92-111 (1999)
22EESven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth: Improving Spanning Trees by Upgrading Nodes. Theor. Comput. Sci. 221(1-2): 139-155 (1999)
1998
21EEMadhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III: Bicriteria Network Design Problems CoRR cs.CC/9809103: (1998)
20 Alexander Russell, Ravi Sundaram: Symmetric Alternation Captures BPP. Computational Complexity 7(2): 152-162 (1998)
19EEMichael Klugerman, Alexander Russell, Ravi Sundaram: On embedding complete graphs into hypercubes. Discrete Mathematics 186(1-3): 289-293 (1998)
18EEAlexander Russell, Ravi Sundaram: A Note on the Asymptotics and Computational Complexity of Graph Distinguishability. Electr. J. Comb. 5: (1998)
17 Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III: Bicriteria Network Design Problems. J. Algorithms 28(1): 142-171 (1998)
1997
16 Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth: Improving Spanning Trees by Upgrading Nodes. ICALP 1997: 281-291
15 Ravi Kumar, Alexander Russell, Ravi Sundaram: Faster Algorithms for Optical Switch Configuration. ICC (3) 1997: 1320-1324
14EERavi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram: A Note on Optical Routing on Trees. Inf. Process. Lett. 62(6): 295-300 (1997)
1996
13 Ravi Kumar, Alexander Russell, Ravi Sundaram: Approximating Latin Square Extensions. COCOON 1996: 280-289
12 Madhav V. Marathe, R. Ravi, Ravi Sundaram: Service-Constrained Network Design Problems. SWAT 1996: 28-40
11 Madhav V. Marathe, R. Ravi, Ravi Sundaram: Service-Constrained Network Design Problems. Nord. J. Comput. 3(4): 367-387 (1996)
10EER. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi: Spanning Trees - Short or Small. SIAM J. Discrete Math. 9(2): 178-200 (1996)
1995
9 Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III: Bicriteria Network Design Problems. ICALP 1995: 487-498
8EEAlexander Russell, Ravi Sundaram: The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE. Inf. Process. Lett. 53(2): 61-68 (1995)
1994
7 R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi: Spanning Trees Short or Small. SODA 1994: 546-555
6 Marcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram: Alternation in Interaction. Structure in Complexity Theory Conference 1994: 294-303
5 Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram: Efficient Parallel Shuffle Recognition. Parallel Processing Letters 4: 455-463 (1994)
4EERavi Sundaram, Karan Sher Singh, C. Pandu Rangan: Treewidth of Circular-Arc Graphs. SIAM J. Discrete Math. 7(4): 647-655 (1994)
1993
3 R. Srikant, Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan: Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs. Theor. Comput. Sci. 115(2): 351-357 (1993)
1992
2 Ahmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar: A Parallel Algorithm for Recognizing the Shuffle of Two Strings. IPPS 1992: 112-115
1991
1 Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan: Treewidth of Circular-Arc Graphs (Abstract). WADS 1991: 41

Coauthor Index

1Daria Antonova [28]
2R. C. Chakinala [35]
3Jiangzhuo Chen [26] [27] [33] [34] [36] [38]
4Anja Feldmann [29]
5Rosario Gennaro [30]
6Ramanathan V. Guha [32]
7Iman Hajirasouliha [40]
8Harry B. Hunt III [9] [17] [21]
9Lujun Jia [31] [33] [37]
10Hossein Jowhari [40]
11Nils Kammenhuber [29]
12Shiva Kintali (Shiva Prasad Kintali) [46]
13Marcos A. Kiwi [6] [25]
14Robert D. Kleinberg (Robert Kleinberg) [27] [38]
15Michael Klugerman [19]
16Arvind Krishnamurthy [28]
17Sven Oliver Krumke [16] [22] [23]
18Ravi Kumar (S. Ravi Kumar) [13] [14] [15] [24] [32] [40]
19Abishek Kumarasubramanian [35]
20Nikolaos Laoutaris [39] [44] [45]
21Darren Leigh [30]
22Guolong Lin [31]
23Xin Liu [33] [42]
24László Lovász [27] [38]
25Carsten Lund [6] [25]
26Zheng Ma [28]
27Olaf Maennel [29]
28Bruce M. Maggs [29]
29R. Manokaran [35]
30Madhav V. Marathe [7] [9] [10] [11] [12] [16] [17] [21] [22] [23] [36]
31Maurice Nivat [2] [5]
32Hartmut Noltemeier [16] [22] [23]
33Guevara Noubir [31] [33] [35] [37] [42]
34Rina Panigrahy [14]
35Laura J. Poplawski [43] [44] [45] [46]
36Roberto De Prisco [29]
37Rajmohan Rajaraman [26] [27] [31] [34] [36] [37] [38] [39] [43] [44] [45] [46]
38G. D. S. Ramkumar [2] [5]
39C. Pandu Rangan (Chanrasekharan Pandu Rangan) [1] [2] [3] [4] [5] [35]
40R. Ravi [7] [9] [10] [11] [12] [16] [17] [21] [22] [23]
41S. S. Ravi [7] [9] [10] [16] [17] [21] [22] [23]
42Daniel J. Rosenkrantz [7] [9] [10] [17] [21]
43Alexander Russell [6] [8] [13] [14] [15] [18] [19] [20] [24] [25]
44Ahmed Saoudi [2] [5]
45Karan Sher Singh [1] [3] [4]
46D. Sivakumar [32]
47Mark E. Snyder [41]
48Daniel A. Spielman [6] [25]
49R. Srikant (Rayadurgam Srikant) [3]
50San Tan [42]
51Shang-Hua Teng [39] [43] [44] [45] [46]
52Mayur Thakur [41]
53Adrian Vetta [27] [38]
54Hans-Christoph Wirth [16] [22] [23]
55William S. Yerazunis [30]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)