![]() | ![]() |
| 2011 | ||
|---|---|---|
| 44 | Venkatesan T. Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal: Scheduling Resources for Throughput Maximization. APPROX-RANDOM 2011: 111-122 | |
| 43 | Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal: Resource Allocation for Covering Time Varying Demands. ESA 2011: 543-554 | |
| 42 | Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal, Neha Sengupta: Maximizing throughput of jobs with multiple resource requirements. HiPC 2011: 1-9 | |
| 41 | Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Vijay K. Garg, Yogish Sabharwal: An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem. ICDCN 2011: 53-64 | |
| 40 | Venkatesan T. Chakaravarthy, Gyana R. Parija, Sambuddha Roy, Yogish Sabharwal, Amit Kumar: Minimum Cost Resource Allocation for Meeting Job Requirements. IPDPS 2011: 14-23 | |
| 39 | Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal: Improved Algorithms for the Distributed Trigger Counting Problem. IPDPS 2011: 515-523 | |
| 38 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania: Decision trees for entity identification: Approximation algorithms and hardness results. ACM Transactions on Algorithms 7(2): 15 (2011) | |
| 37 | Venkatesan T. Chakaravarthy, Sambuddha Roy: Arthur and Merlin as Oracles. Computational Complexity 20(3): 505-558 (2011) | |
| 2010 | ||
| 36 | Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Vijay K. Garg, Yogish Sabharwal: Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting. DISC 2010: 398-400 | |
| 35 | Venkatesan T. Chakaravarthy, Nikhil Jain, Yogish Sabharwal: Optimizing Matrix Transpose on Torus Interconnects. Euro-Par (2) 2010: 440-451 | |
| 34 | Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal: A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints. FSTTCS 2010: 181-191 | |
| 33 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal: Finding Independent Sets in Unions of Perfect Graphs. FSTTCS 2010: 251-259 | |
| 32 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal, Deva P. Seetharam: Varying bandwidth resource allocation problem with bag constraints. IPDPS 2010: 1-10 | |
| 31 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal: On the Complexity of the $k$-Anonymization Problem CoRR abs/1004.4729: (2010) | |
| 2009 | ||
| 30 | Govind Kothari, Sumit Negi, Tanveer A. Faruquie, Venkatesan T. Chakaravarthy, L. Venkata Subramaniam: SMS based Interface for FAQ Retrieval. ACL/AFNLP 2009: 852-860 | |
| 29 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal: Approximating Decision Trees with Multiway Branches. ICALP (1) 2009: 210-221 | |
| 28 | Manish Bhide, Venkatesan T. Chakaravarthy, Krithi Ramamritham, Prasan Roy: Keyword Search over Dynamic Categorized Information. ICDE 2009: 258-269 | |
| 27 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal: Analysis of sampling techniques for association rule mining. ICDT 2009: 276-283 | |
| 26 | Venkatesan T. Chakaravarthy, Sambuddha Roy: Arthur and Merlin as Oracles. Electronic Colloquium on Computational Complexity (ECCC) 16: 55 (2009) | |
| 25 | Venkatesan T. Chakaravarthy, Sambuddha Roy: Approximating maximum weight K-colorable subgraphs in chordal graphs. Inf. Process. Lett. 109(7): 365-368 (2009) | |
| 24 | Mukesh K. Mohania, Manish Bhide, Prasan Roy, Venkatesan T. Chakaravarthy, Himanshu Gupta: Context Oriented Information Integration. T. Large-Scale Data- and Knowledge-Centered Systems 1: 289-326 (2009) | |
| 2008 | ||
| 23 | Venkatesan T. Chakaravarthy, Himanshu Gupta, Prasan Roy, Mukesh K. Mohania: Efficient techniques for document sanitization. CIKM 2008: 843-852 | |
| 22 | Venkatesan T. Chakaravarthy, Sambuddha Roy: Arthur and Merlin as Oracles. MFCS 2008: 229-240 | |
| 21 | Venkatesan T. Chakaravarthy, Sambuddha Roy: Finding Irrefutable Certificates for S2p via Arthur and Merlin. STACS 2008: 157-168 | |
| 2007 | ||
| 20 | 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 | Venkatesan T. Chakaravarthy, Sambuddha Roy: Oblivious Symmetric Alternation. STACS 2006: 230-241 | |
| 18 | Venkatesan T. Chakaravarthy, Himanshu Gupta, Prasan Roy, Mukesh K. Mohania: Efficiently Linking Text Documents with Relevant Structured Information. VLDB 2006: 667-678 | |
| 17 | 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 | 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 | Jin-yi Cai, Venkatesan T. Chakaravarthy: A Note on Zero Error Algorithms Having Oracle Access to One NP Query. COCOON 2005: 339-348 | |
| 14 | 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 | 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 | 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 | Raghav Kaushik, Raghu Ramakrishnan, Venkatesan T. Chakaravarthy: Synopses for Query Optimization: A Space-Complexity Perspective. PODS 2004: 201-209 | |
| 10 | Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek: Time-Space Tradeoff in Derandomizing Probabilistic Logspace. STACS 2004: 571-583 | |
| 2003 | ||
| 9 | 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 | Venkatesan T. Chakaravarthy: New results on the computability and complexity of points - to analysis. POPL 2003: 115-125 | |
| 7 | 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 | Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy: The Problem of Context Sensitive String Matching. CPM 2002: 64-75 | |
| 5 | Venkatesan T. Chakaravarthy, Susan Horwitz: On the non-approximability of points-to analysis. Acta Inf. 38(8): 587-598 (2002) | |
| 2001 | ||
| 4 | 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) | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page