Venkatesan T. Chakaravarthy
According to our database^{1},
Venkatesan T. Chakaravarthy
authored at least 64 papers
between 1997 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2019
On optimizing distributed nonnegative Tucker decomposition.
Proceedings of the ACM International Conference on Supercomputing, 2019
2018
Set Cover Problems with Small Neighborhood Covers.
Theory Comput. Syst., 2018
Highperformance dense tucker decomposition on GPU clusters.
Proceedings of the International Conference for High Performance Computing, 2018
On Optimizing Distributed Tucker Decomposition for Sparse Tensors.
Proceedings of the 32nd International Conference on Supercomputing, 2018
Improved Distributed Algorithm for Graph Truss Decomposition.
Proceedings of the EuroPar 2018: Parallel Processing, 2018
2017
Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems.
IEEE Trans. Parallel Distrib. Syst., 2017
Replica Placement on Bounded Treewidth Graphs.
Proceedings of the Algorithms and Data Structures  15th International Symposium, 2017
On Optimizing Distributed Tucker Decomposition for Dense Tensors.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017
2016
Reusable Resource Scheduling via Colored Interval Covering.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016
Subgraph Counting: Color Coding Beyond Trees.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016
2015
Fast Algorithms for Constrained Graph Density Problems.
Proceedings of the WALCOM: Algorithms and Computation  9th International Workshop, 2015
Analysis of Sampling Algorithms for Twitter.
Proceedings of the TwentyFourth International Joint Conference on Artificial Intelligence, 2015
2014
Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014
Algorithms for poweraware resource activation.
Proceedings of the 21st International Conference on High Performance Computing, 2014
Replica Placement on Directed Acyclic Graphs.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014
Improved Algorithms for Resource Allocation under Varying Capacity.
Proceedings of the Algorithms  ESA 2014, 2014
2013
Distributed Algorithms for Scheduling on Line and Tree Networks with Nonuniform Bandwidths.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013
Knapsack Cover Subject to a Matroid Constraint.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013
Replica Placement via Capacitated Vertex Cover.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013
Scheduling Jobs with Multiple Nonuniform Tasks.
Proceedings of the EuroPar 2013 Parallel Processing, 2013
2012
Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem.
Theory Comput. Syst., 2012
Distributed algorithms for scheduling on line and tree networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012
Mapping strategies for the PERCS architecture.
Proceedings of the 19th International Conference on High Performance Computing, 2012
Scheduling Resources for Executing a Partial Set of Jobs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012
Density Functions subject to a CoMatroid Constraint.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012
2011
Minimum Cost Resource Allocation for Meeting Job Requirements.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011
Improved Algorithms for the Distributed Trigger Counting Problem.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011
An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem.
Proceedings of the Distributed Computing and Networking  12th International Conference, 2011
Maximizing throughput of jobs with multiple resource requirements.
Proceedings of the 18th International Conference on High Performance Computing, 2011
Resource Allocation for Covering Time Varying Demands.
Proceedings of the Algorithms  ESA 2011, 2011
Scheduling Resources for Throughput Maximization.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
2010
Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting.
Proceedings of the Distributed Computing, 24th International Symposium, 2010
Varying bandwidth resource allocation problem with bag constraints.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010
Finding Independent Sets in Unions of Perfect Graphs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010
A Nearlinear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010
Optimizing Matrix Transpose on Torus Interconnects.
Proceedings of the EuroPar 2010  Parallel Processing, 16th International EuroPar Conference, Ischia, Italy, August 31, 2010
2009
Context Oriented Information Integration.
Trans. LargeScale Data and KnowledgeCentered Systems, 2009
Approximating maximum weight Kcolorable subgraphs in chordal graphs.
Inf. Process. Lett., 2009
Analysis of sampling techniques for association rule mining.
Proceedings of the Database Theory, 2009
Keyword Search over Dynamic Categorized Information.
Proceedings of the 25th International Conference on Data Engineering, 2009
Approximating Decision Trees with Multiway Branches.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
SMS based Interface for FAQ Retrieval.
Proceedings of the ACL 2009, 2009
2008
Finding Irrefutable Certificates for S_{2}^{p} via Arthur and Merlin.
Proceedings of the STACS 2008, 2008
Arthur and Merlin as Oracles.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008
Efficient techniques for document sanitization.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008
2007
Decision trees for entity identification: approximation algorithms and hardness results.
Proceedings of the TwentySixth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2007
2006
On zero error algorithms having oracle access to one query.
J. Comb. Optim., 2006
Efficiently Linking Text Documents with Relevant Structured Information.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006
Oblivious Symmetric Alternation.
Proceedings of the STACS 2006, 2006
2005
Synopses for query optimization: A spacecomplexity perspective.
ACM Trans. Database Syst., 2005
A Note on Zero Error Algorithms Having Oracle Access to One NP Query.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2004
TimeSpace Tradeoff in Derandomizing Probabilistic Logspace.
Proceedings of the STACS 2004, 2004
Synopses for Query Optimization: A SpaceComplexity Perspective.
Proceedings of the Twentythird ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2004
Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XMLtoSQL Query Translation.
Proceedings of the 20th International Conference on Data Engineering, 2004
2003
Competing Provers Yield Improved KarpLipton Collapse Results.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
New results on the computability and complexity of points  to analysis.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLANSIGACT Symposium on Principles of Programming Languages, 2003
On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective.
Proceedings of the Database Theory, 2003
2002
On the nonapproximability of pointsto analysis.
Acta Inf., 2002
The Problem of Context Sensitive String Matching.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002
2001
On the Complexity of Join Predicates.
Proceedings of the Twentieth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2001
1998
Pattern Matching in Matrix Grammars.
Journal of Automata, Languages and Combinatorics, 1998
1997
A Note on Extended H Systems with Permitting/Forbidding Contexts of Radius One.
Bulletin of the EATCS, 1997
Array Splicing Systems.
Proceedings of the New Trends in Formal Languages, 1997