| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Venkatesan T. Chakaravarthy 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 Raghav Kaushik , Raghu Ramakrishnan , Venkatesan T. Chakaravarthy: Synopses for Query Optimization: A Space-Complexity Perspective. PODS 2004 : 201-209 Jin-yi Cai , Venkatesan T. Chakaravarthy, Dieter van Melkebeek : Time-Space Tradeoff in Derandomizing Probabilistic Logspace. STACS 2004 : 571-583 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 : 270-284 Venkatesan T. Chakaravarthy: New results on the computability and complexity of points - to analysis. POPL 2003 : 115-125 Jin-yi Cai , Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra , Mitsunori Ogihara : Competing Provers Yield Improved Karp-Lipton Collapse Results. STACS 2003 : 535-546 Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy : The Problem of Context Sensitive String Matching. CPM 2002 : 64-75 Venkatesan T. Chakaravarthy, Susan Horwitz : On the non-approximability of points-to analysis. Acta Inf. 38 (8): 587-598 (2002) Jin-yi Cai , Venkatesan T. Chakaravarthy, Raghav Kaushik , Jeffrey F. Naughton : On the Complexity of Join Predicates. PODS 2001 Viswanathan Radhakrishnan , Venkatesan T. Chakaravarthy, Kamala Krithivasan : Pattern Matching in Matrix Grammars. Journal of Automata, Languages and Combinatorics 3 (1): 59-76 (1998) Kamala Krithivasan , Venkatesan T. Chakaravarthy, Raghavan Rama : Array Splicing Systems. New Trends in Formal Languages 1997 : 346-365 Venkatesan T. Chakaravarthy, Kamala Krithivasan : A Note on Extended H Systems with Permitting/Forbidding Contexts of Radius One. Bulletin of the EATCS 62 : (1997) 1 [ 4 ] [ 7 ] [ 10 ] 2 [ 7 ] 3 [ 5 ] 4 [ 4 ] [ 11 ] [ 12 ] 5 [ 6 ] [ 9 ] [ 12 ] 6 [ 1 ] [ 2 ] [ 3 ] 7 [ 10 ] 8 [ 4 ] [ 9 ] [ 12 ] 9 [ 7 ] 10 [ 3 ] 11 [ 2 ] 12 [ 11 ]  ©2005 Association for Computing Machinery |
