2009 |
46 | EE | Shiva Kintali,
Laura J. Poplawski,
Rajmohan Rajaraman,
Ravi Sundaram,
Shang-Hua Teng:
Reducibility Among Fractional Stability Problems
CoRR abs/0904.1435: (2009) |
2008 |
45 | EE | Nikolaos 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 |
44 | EE | Nikolaos 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) |
43 | EE | Laura 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 |
42 | EE | Xin Liu,
Guevara Noubir,
Ravi Sundaram,
San Tan:
SPREAD: Foiling Smart Jammers Using Multi-Layer Agility.
INFOCOM 2007: 2536-2540 |
41 | EE | Mark E. Snyder,
Ravi Sundaram,
Mayur Thakur:
A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses.
LCN 2007: 556-566 |
40 | EE | Iman Hajirasouliha,
Hossein Jowhari,
Ravi Kumar,
Ravi Sundaram:
On Completing Latin Squares.
STACS 2007: 524-535 |
39 | EE | Nikolaos Laoutaris,
Rajmohan Rajaraman,
Ravi Sundaram,
Shang-Hua Teng:
A bounded-degree network formation game
CoRR abs/cs/0701071: (2007) |
38 | EE | 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.
J. ACM 54(4): (2007) |
2006 |
37 | EE | Lujun Jia,
Guevara Noubir,
Rajmohan Rajaraman,
Ravi Sundaram:
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks.
DCOSS 2006: 282-304 |
36 | EE | Jiangzhuo Chen,
Ravi Sundaram,
Madhav V. Marathe,
Rajmohan Rajaraman:
The Confluent Capacity of the Internet: Congestion vs. Dilation.
ICDCS 2006: 5 |
35 | EE | R. C. Chakinala,
Abishek Kumarasubramanian,
R. Manokaran,
Guevara Noubir,
C. Pandu Rangan,
Ravi Sundaram:
Steganographic Communication in Ordered Channels.
Information Hiding 2006: 42-57 |
34 | EE | Jiangzhuo Chen,
Rajmohan Rajaraman,
Ravi Sundaram:
Meet and merge: Approximation algorithms for confluent flows.
J. Comput. Syst. Sci. 72(3): 468-489 (2006) |
2005 |
33 | EE | Jiangzhuo Chen,
Lujun Jia,
Xin Liu,
Guevara Noubir,
Ravi Sundaram:
Minimum energy accumulative routing in wireless networks.
INFOCOM 2005: 1875-1886 |
32 | EE | Ramanathan V. Guha,
Ravi Kumar,
D. Sivakumar,
Ravi Sundaram:
Unweaving a web of documents.
KDD 2005: 574-579 |
31 | EE | Lujun Jia,
Guolong Lin,
Guevara Noubir,
Rajmohan Rajaraman,
Ravi Sundaram:
Universal approximations for TSP, Steiner tree, and set cover.
STOC 2005: 386-395 |
2004 |
30 | EE | Rosario 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 |
29 | EE | Anja 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 |
28 | EE | Daria Antonova,
Arvind Krishnamurthy,
Zheng Ma,
Ravi Sundaram:
Managing a portfolio of overlay paths.
NOSSDAV 2004: 30-35 |
27 | EE | Jiangzhuo 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 |
26 | EE | Jiangzhuo Chen,
Rajmohan Rajaraman,
Ravi Sundaram:
Meet and merge: approximation algorithms for confluent flows.
STOC 2003: 373-382 |
2000 |
25 | EE | Marcos A. Kiwi,
Carsten Lund,
Daniel A. Spielman,
Alexander Russell,
Ravi Sundaram:
Alternation in interaction.
Computational Complexity 9(3-4): 202-246 (2000) |
1999 |
24 | EE | Ravi 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) |
22 | EE | Sven 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 |
21 | EE | Madhav 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) |
19 | EE | Michael Klugerman,
Alexander Russell,
Ravi Sundaram:
On embedding complete graphs into hypercubes.
Discrete Mathematics 186(1-3): 289-293 (1998) |
18 | EE | Alexander 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 |
14 | EE | Ravi 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) |
10 | EE | R. 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 |
8 | EE | Alexander 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) |
4 | EE | Ravi 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 |