2009 |
25 | EE | Manish Bhide,
Venkatesan T. Chakaravarthy,
Krithi Ramamritham,
Prasan Roy:
Keyword Search over Dynamic Categorized Information.
ICDE 2009: 258-269 |
24 | EE | Venkatesan T. Chakaravarthy,
Vinayaka Pandit,
Yogish Sabharwal:
Analysis of sampling techniques for association rule mining.
ICDT 2009: 276-283 |
2008 |
23 | EE | Venkatesan T. Chakaravarthy,
Himanshu Gupta,
Prasan Roy,
Mukesh K. Mohania:
Efficient techniques for document sanitization.
CIKM 2008: 843-852 |
22 | EE | Venkatesan T. Chakaravarthy,
Sambuddha Roy:
Arthur and Merlin as Oracles.
MFCS 2008: 229-240 |
21 | EE | Venkatesan T. Chakaravarthy,
Sambuddha Roy:
Finding Irrefutable Certificates for S2p via Arthur and Merlin.
STACS 2008: 157-168 |
2007 |
20 | EE | Venkatesan T. Chakaravarthy,
Vinayaka Pandit,
Sambuddha Roy,
Pranjal Awasthi,
Mukesh K. Mohania:
Decision trees for entity identification: approximation algorithms and hardness results.
PODS 2007: 53-62 |
2006 |
19 | EE | Venkatesan T. Chakaravarthy,
Sambuddha Roy:
Oblivious Symmetric Alternation.
STACS 2006: 230-241 |
18 | EE | Venkatesan T. Chakaravarthy,
Himanshu Gupta,
Prasan Roy,
Mukesh K. Mohania:
Efficiently Linking Text Documents with Relevant Structured Information.
VLDB 2006: 667-678 |
17 | EE | Jin-yi Cai,
Venkatesan T. Chakaravarthy:
On zero error algorithms having oracle access to one query.
J. Comb. Optim. 11(2): 189-202 (2006) |
16 | EE | Jin-yi Cai,
Venkatesan T. Chakaravarthy,
Dieter van Melkebeek:
Time-Space Tradeoff in Derandomizing Probabilistic Logspace.
Theory Comput. Syst. 39(1): 189-208 (2006) |
2005 |
15 | EE | Jin-yi Cai,
Venkatesan T. Chakaravarthy:
A Note on Zero Error Algorithms Having Oracle Access to One NP Query.
COCOON 2005: 339-348 |
14 | EE | Raghav Kaushik,
Jeffrey F. Naughton,
Raghu Ramakrishnan,
Venkatesan T. Chakaravarthy:
Synopses for query optimization: A space-complexity perspective.
ACM Trans. Database Syst. 30(4): 1102-1127 (2005) |
13 | EE | Jin-yi Cai,
Venkatesan T. Chakaravarthy,
Lane A. Hemaspaandra,
Mitsunori Ogihara:
Competing provers yield improved Karp-Lipton collapse results.
Inf. Comput. 198(1): 1-23 (2005) |
2004 |
12 | EE | Rajasekar Krishnamurthy,
Venkatesan T. Chakaravarthy,
Raghav Kaushik,
Jeffrey F. Naughton:
Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation.
ICDE 2004: 42-53 |
11 | EE | Raghav Kaushik,
Raghu Ramakrishnan,
Venkatesan T. Chakaravarthy:
Synopses for Query Optimization: A Space-Complexity Perspective.
PODS 2004: 201-209 |
10 | EE | Jin-yi Cai,
Venkatesan T. Chakaravarthy,
Dieter van Melkebeek:
Time-Space Tradeoff in Derandomizing Probabilistic Logspace.
STACS 2004: 571-583 |
2003 |
9 | EE | Rajasekar Krishnamurthy,
Venkatesan T. Chakaravarthy,
Jeffrey F. Naughton:
On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective.
ICDT 2003: 267-281 |
8 | EE | Venkatesan T. Chakaravarthy:
New results on the computability and complexity of points - to analysis.
POPL 2003: 115-125 |
7 | EE | Jin-yi Cai,
Venkatesan T. Chakaravarthy,
Lane A. Hemaspaandra,
Mitsunori Ogihara:
Competing Provers Yield Improved Karp-Lipton Collapse Results.
STACS 2003: 535-546 |
2002 |
6 | EE | Venkatesan T. Chakaravarthy,
Rajasekar Krishnamurthy:
The Problem of Context Sensitive String Matching.
CPM 2002: 64-75 |
5 | EE | Venkatesan T. Chakaravarthy,
Susan Horwitz:
On the non-approximability of points-to analysis.
Acta Inf. 38(8): 587-598 (2002) |
2001 |
4 | EE | Jin-yi Cai,
Venkatesan T. Chakaravarthy,
Raghav Kaushik,
Jeffrey F. Naughton:
On the Complexity of Join Predicates.
PODS 2001 |
1998 |
3 | | Viswanathan Radhakrishnan,
Venkatesan T. Chakaravarthy,
Kamala Krithivasan:
Pattern Matching in Matrix Grammars.
Journal of Automata, Languages and Combinatorics 3(1): 59-76 (1998) |
1997 |
2 | | Kamala Krithivasan,
Venkatesan T. Chakaravarthy,
Raghavan Rama:
Array Splicing Systems.
New Trends in Formal Languages 1997: 346-365 |
1 | | Venkatesan T. Chakaravarthy,
Kamala Krithivasan:
A Note on Extended H Systems with Permitting/Forbidding Contexts of Radius One.
Bulletin of the EATCS 62: (1997) |