The SCEAS System
| |||||||

## Search the dblp DataBase
Venkatesan T. Chakaravarthy:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kamala Krithivasan, Venkatesan T. Chakaravarthy, Raghavan Rama
**Array Splicing Systems.**[Citation Graph (0, 0)][DBLP] New Trends in Formal Languages, 1997, pp:346-365 [Conf] - Jin-yi Cai, Venkatesan T. Chakaravarthy
**A Note on Zero Error Algorithms Having Oracle Access to One NP Query.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:339-348 [Conf] - Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy
**The Problem of Context Sensitive String Matching.**[Citation Graph (0, 0)][DBLP] CPM, 2002, pp:64-75 [Conf] - Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton
**Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation.**[Citation Graph (0, 0)][DBLP] ICDE, 2004, pp:42-53 [Conf] - Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy, Jeffrey F. Naughton
**On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective.**[Citation Graph (0, 0)][DBLP] ICDT, 2003, pp:267-281 [Conf] - Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton
**On the Complexity of Join Predicates.**[Citation Graph (0, 0)][DBLP] PODS, 2001, pp:- [Conf] - Raghav Kaushik, Raghu Ramakrishnan, Venkatesan T. Chakaravarthy
**Synopses for Query Optimization: A Space-Complexity Perspective.**[Citation Graph (0, 0)][DBLP] PODS, 2004, pp:201-209 [Conf] - Venkatesan T. Chakaravarthy
**New results on the computability and complexity of points - to analysis.**[Citation Graph (0, 0)][DBLP] POPL, 2003, pp:115-125 [Conf] - Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara
**Competing Provers Yield Improved Karp-Lipton Collapse Results.**[Citation Graph (0, 0)][DBLP] STACS, 2003, pp:535-546 [Conf] - Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek
**Time-Space Tradeoff in Derandomizing Probabilistic Logspace.**[Citation Graph (0, 0)][DBLP] STACS, 2004, pp:571-583 [Conf] - Venkatesan T. Chakaravarthy, Sambuddha Roy
**Oblivious Symmetric Alternation.**[Citation Graph (0, 0)][DBLP] STACS, 2006, pp:230-241 [Conf] - Venkatesan T. Chakaravarthy, Himanshu Gupta, Prasan Roy, Mukesh K. Mohania
**Efficiently Linking Text Documents with Relevant Structured Information.**[Citation Graph (0, 0)][DBLP] VLDB, 2006, pp:667-678 [Conf] - Venkatesan T. Chakaravarthy, Susan Horwitz
**On the non-approximability of points-to analysis.**[Citation Graph (0, 0)][DBLP] Acta Inf., 2002, v:38, n:8, pp:587-598 [Journal] - Venkatesan T. Chakaravarthy, Kamala Krithivasan
**A Note on Extended H Systems with Permitting/Forbidding Contexts of Radius One.**[Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1997, v:62, n:, pp:- [Journal] - Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara
**Competing provers yield improved Karp-Lipton collapse results.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2005, v:198, n:1, pp:1-23 [Journal] - Viswanathan Radhakrishnan, Venkatesan T. Chakaravarthy, Kamala Krithivasan
**Pattern Matching in Matrix Grammars.**[Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 1998, v:3, n:1, pp:59-76 [Journal] - Jin-yi Cai, Venkatesan T. Chakaravarthy
**On zero error algorithms having oracle access to one query.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2006, v:11, n:2, pp:189-202 [Journal] - Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek
**Time-Space Tradeoff in Derandomizing Probabilistic Logspace.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:1, pp:189-208 [Journal] - Raghav Kaushik, Jeffrey F. Naughton, Raghu Ramakrishnan, Venkatesan T. Chakaravarthy
**Synopses for query optimization: A space-complexity perspective.**[Citation Graph (0, 0)][DBLP] ACM Trans. Database Syst., 2005, v:30, n:4, pp:1102-1127 [Journal] - Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania
**Decision trees for entity identification: approximation algorithms and hardness results.**[Citation Graph (0, 0)][DBLP] PODS, 2007, pp:53-62 [Conf] **Efficient techniques for document sanitization.**[Citation Graph (, )][DBLP]**Optimizing Matrix Transpose on Torus Interconnects.**[Citation Graph (, )][DBLP]**Approximating Decision Trees with Multiway Branches.**[Citation Graph (, )][DBLP]**Keyword Search over Dynamic Categorized Information.**[Citation Graph (, )][DBLP]**Analysis of sampling techniques for association rule mining.**[Citation Graph (, )][DBLP]**Arthur and Merlin as Oracles.**[Citation Graph (, )][DBLP]**Finding Irrefutable Certificates for S**[Citation Graph (, )][DBLP]_{2}^{p}via Arthur and Merlin.**Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting.**[Citation Graph (, )][DBLP]**On the Complexity of the $k$-Anonymization Problem**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |