# Venkatesan Chakaravarthy

## contact information

Researcher

IBM Research, New Delhi, India

+919312168699

IBM Research, New Delhi, India

+919312168699

## links

**2013**

Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths

Venkatesan Chakaravarthy, Anamitra Choudhury, Sambuddha Roy, Yogish Sabharwal

Venkatesan Chakaravarthy, Anamitra Choudhury, Sambuddha Roy, Yogish Sabharwal

*27th IEEE Parallel and Distributed Processing Symposium (IPDPS)*,*pp. 973-984*, 2013
Scheduling Jobs with Multiple Non-uniform Tasks

Venkatesan Chakaravarthy, Anamitra Choudhury, Sambuddha Roy, Yogish Sabharwal

Venkatesan Chakaravarthy, Anamitra Choudhury, Sambuddha Roy, Yogish Sabharwal

*19th European Conference on Parallel Processing (Euro-Par)*, 2013**2012**

Density Functions subject to a Co-Matroid Constraint

Venkatesan Chakaravarthy, Natwar Modani, Sivaramakrishnan Natarajan, Sambuddha Roy, Yogish Sabharwal

Venkatesan Chakaravarthy, Natwar Modani, Sivaramakrishnan Natarajan, Sambuddha Roy, Yogish Sabharwal

*31st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)*, 2012
Scheduling Resources for Executing a Partial Set of Jobs

Venkatesan Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal

Venkatesan Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal

*31st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)*,*pp. 199-210*, 2012
Mapping strategies for the PERCS architecture

Venkatesan Chakaravarthy, Monu Kedia, Yogish Sabharwal, Naga Praveen Kumar Katta, Ramakrishnan Rajamony, Aruna Ramanan

Venkatesan Chakaravarthy, Monu Kedia, Yogish Sabharwal, Naga Praveen Kumar Katta, Ramakrishnan Rajamony, Aruna Ramanan

*19th International Conference on High Performance Computing (HiPC)*,*pp. 1--10*, 2012
Distributed algorithms for scheduling on line and tree networks

Venkatesan Chakaravarthy, Sambuddha Roy, Yogish Sabharwal

Venkatesan Chakaravarthy, Sambuddha Roy, Yogish Sabharwal

*31st ACM Symposium on Principles of Distributed Computing (PODC)*, 2012
Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem

Venkatesan Chakaravarthy, Anamitra Choudhury, Vijay Garg, Yogish Sabharwal

Venkatesan Chakaravarthy, Anamitra Choudhury, Vijay Garg, Yogish Sabharwal

*Theory of Computing Systems**51*(*4*), 447--473, 2012**2011**

Decision trees for entity identification: Approximation algorithms and hardness results

Venkatesan Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania

Venkatesan Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania

*ACM Transactions on Algorithms**7*(*2*), 2011
Scheduling Resources for Throughput Maximization

Venkatesan Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal

Venkatesan Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal

*14th International Workshop on Approximation Algorithms (APPROX)*,*pp. 111-122*, 2011
Resource Allocation for Covering Time Varying Demands

Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal

Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal

*19th Annual European Symposium on Algorithms (ESA)*,*pp. 543-554*, 2011
Maximizing throughput of jobs with multiple resource requirements

Venkatesan Chakaravarthy, Sambuddha Roy, Yogish Sabharwal, Neha Sengupta

Venkatesan Chakaravarthy, Sambuddha Roy, Yogish Sabharwal, Neha Sengupta

*18th International Conference on High Performance Computing (HiPC)*,*pp. 1-9*, 2011
Improved Algorithms for the Distributed Trigger Counting Problem

Venkatesan Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal

Venkatesan Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal

*25th International Symposium on Parallel and Distributed Processing (IPDPS)*,*pp. 515-523*, 2011
Minimum Cost Resource Allocation for Meeting Job Requirements

Venkatesan Chakaravarthy, Gyana Parija, Sambuddha Roy, Yogish Sabharwal, Amit Kumar

Venkatesan Chakaravarthy, Gyana Parija, Sambuddha Roy, Yogish Sabharwal, Amit Kumar

*25th International Symposium on Parallel and Distributed Processing (IPDPS)*,*pp. 14--23*, 2011**2010**

Optimizing matrix transpose on torus interconnects

Venkatesan Chakaravarthy, Nikhil Jain, Yogish Sabharwal

Venkatesan Chakaravarthy, Nikhil Jain, Yogish Sabharwal

*16th European Conference on Parallel Processing (Euro-Par)*,*pp. 440--451*, 2010
Finding Independent Sets in Unions of Perfect Graphs$\$$\$

Venkatesan Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal,

Venkatesan Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal,

*30th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)*,*pp. 251--259*, 2010
A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints$\$$\$

Venkatesan Chakaravarthy, Anamitra Choudhury, Yogish Sabharwal,

Venkatesan Chakaravarthy, Anamitra Choudhury, Yogish Sabharwal,

*30th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)*,*pp. 181--191*, 2010
Varying bandwidth resource allocation problem with bag constraints

Venkatesan Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal, Deva P Seetharam

Venkatesan Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal, Deva P Seetharam

*24th IEEE International Parallel and Distributed Processing Symposium (IPDPS)*,*pp. 1--10*, 2010**2009**

Keyword search over dynamic categorized information

Manish Bhide, Venkatesan Chakaravarthy, Krithi Ramamritham, Prasan Roy

Manish Bhide, Venkatesan Chakaravarthy, Krithi Ramamritham, Prasan Roy

*25th IEEE International Conference on Data Engineering (ICDE)*, 2009
Approximating maximum weight< i> K-colorable subgraphs in chordal graphs

Venkatesan Chakaravarthy, Sambuddha Roy

Venkatesan Chakaravarthy, Sambuddha Roy

*Information Processing Letters**109*(*7*), 365--368, 2009
Approximating decision trees with multiway branches

Venkatesan Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal

Venkatesan Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal

*36th International Colloquium on Automata, Languages and Programming (ICALP)*, 2009
SMS based interface for FAQ retrieval

Govind Kothari, Sumit Negi, Tanveer Faruquie, Venkatesan Chakaravarthy, L. Venkata Subramaniam

Govind Kothari, Sumit Negi, Tanveer Faruquie, Venkatesan Chakaravarthy, L. Venkata Subramaniam

*47th Annual Meeting of the Association for Computational Linguistics (ACL)*,*pp. 852--860*, 2009
Analysis of sampling techniques for association rule mining

Venkatesan Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal

Venkatesan Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal

*12th International Conference on Database Theory (ICDT)*, 2009**2008**

Arthur and Merlin as oracles

Venkatesan T Chakaravarthy, Sambuddha Roy

Venkatesan T Chakaravarthy, Sambuddha Roy

*33rd International Symposium on Mathematical Foundations of Computer Science (MFCS)*, 2008
Finding Irrefutable Certificates for $ S\_2\^ p $ via Arthur and Merlin

Venkatesan Chakaravarthy, Sambuddha Roy,

Venkatesan Chakaravarthy, Sambuddha Roy,

*25th Annual Symposium on the Theoretical Aspects of Computer Science (STACS)*, 2008
Efficient techniques for document sanitization

Venkatesan Chakaravarthy, Himanshu Gupta, Prasan Roy, Mukesh Mohania

Venkatesan Chakaravarthy, Himanshu Gupta, Prasan Roy, Mukesh Mohania

*17th ACM Conference on Information and Knowledge Management (CIKM)*, 2008**2007**

Decision trees for entity identification: approximation algorithms and hardness results

Venkatesan T Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh Mohania

Venkatesan T Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh Mohania

*26th ACM Symposium on Principles of Database Systems (PODS)*, 2007**2006**

On zero error algorithms having oracle access to one query

Jin-Yi Cai, Venkatesan Chakaravarthy

Jin-Yi Cai, Venkatesan Chakaravarthy

*Journal of combinatorial optimization**11*(*2*), 189--202, 2006
Time-space tradeoff in derandomizing probabilistic logspace

Jin-Yi Cai, Venkatesan Chakaravarthy, Dieter van Melkebeek

Jin-Yi Cai, Venkatesan Chakaravarthy, Dieter van Melkebeek

*Theory of Computing Systems**39*(*1*), 189--208, 2006
Oblivious symmetric alternation

Venkatesan Chakaravarthy, Sambuddha Roy

Venkatesan Chakaravarthy, Sambuddha Roy

*23th Symposium on Theoretical Aspects of Computer Science (STACS)*, 2006
Efficiently linking text documents with relevant structured information

Venkatesan Chakaravarthy, Himanshu Gupta, Prasan Roy, Mukesh Mohania

Venkatesan Chakaravarthy, Himanshu Gupta, Prasan Roy, Mukesh Mohania

*32nd International Conference on Very Large Databases (VLDB)*, 2006**2005**

A note on zero error algorithms having oracle access to one NP query

Jin-Yi Cai, Venkatesan Chakaravarthy

Jin-Yi Cai, Venkatesan Chakaravarthy

*11th International Conference on Computing and Combinatorics (COCOON)*, 2005
Competing provers yield improved Karp--Lipton collapse results

Jin-Yi Cai, Venkatesan Chakaravarthy, Lane Hemaspaandra, Mitsunori Ogihara

Jin-Yi Cai, Venkatesan Chakaravarthy, Lane Hemaspaandra, Mitsunori Ogihara

*Information and Computation**198*(*1*), 1--23, 2005**2004**

Synopses for Query Optimization: A Space-Complexity Perspective

Raghav Kaushik, Raghu Ramakrishnan, Venkatesan Chakaravarthy

Raghav Kaushik, Raghu Ramakrishnan, Venkatesan Chakaravarthy

*23rd ACM Symposium on Principles of Database Systems (PODS)*, 2004
Recursive XML schemas, recursive XML queries, and relational storage: XML-to-SQL query translation

Rajasekar Krishnamurthy, Venkatesan Chakaravarthy, Raghav Kaushik, Jeffrey Naughton

Rajasekar Krishnamurthy, Venkatesan Chakaravarthy, Raghav Kaushik, Jeffrey Naughton

*20th IEEE Internationcal Conference on Data Engineering (ICDE)*, 2004**2003**

Competing provers yield improved karp-lipton collapse results

Jin-Yi Cai, Venkatesan Chakaravarthy, Lane Hemaspaandra, Mitsunori Ogihara

Jin-Yi Cai, Venkatesan Chakaravarthy, Lane Hemaspaandra, Mitsunori Ogihara

*20th Symposium on Theoretical Aspects of Computer Science (STACS)*,*pp. 535--546*, 2003
On the difficulty of finding optimal relational decompositions for xml workloads: A complexity theoretic perspective

Rajasekar Krishnamurthy, Venkatesan Chakaravarthy, Jeffrey Naughton

Rajasekar Krishnamurthy, Venkatesan Chakaravarthy, Jeffrey Naughton

*9th International Conference on Database Theory (ICDT)*,*pp. 270--284*, 2003**2002**

The problem of context sensitive string matching

Venkatesan Chakaravarthy, Rajasekar Krishnamurthy

Venkatesan Chakaravarthy, Rajasekar Krishnamurthy

*13th Annual Symposium on Combinatorial Pattern Matching (CPM)*,*pp. 64--75*, 2002
On the non-approximability of points-to analysis

Venkatesan Chakaravarthy, Susan Horwitz

Venkatesan Chakaravarthy, Susan Horwitz

*Acta Informatica**38*(*8*), 587--598, 2002**2001**

On the complexity of join predicates

Jin-Yi Cai, Venkatesan Chakaravarthy, Raghav Kaushik, Jeffrey Naughton

Jin-Yi Cai, Venkatesan Chakaravarthy, Raghav Kaushik, Jeffrey Naughton

*20th ACMSymposium on Principles of Database Systems (PODS)*, 2001**1998**

Pattern matching in matrix grammars

Viswanathan Radhakrishnan, Venkatesan Chakaravarthy, Kamala Krithivasan

Viswanathan Radhakrishnan, Venkatesan Chakaravarthy, Kamala Krithivasan

*Journal of Automata, Languages and Combinatorics**3*(*1*), 59--72, 1998