default search action
Venkatesan T. Chakaravarthy
Person information
- affiliation: University of Wisconsin-Madison, Madison, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [c58]Rishabh Ranjan, Siddharth Grover, Sourav Medya, Venkatesan T. Chakaravarthy, Yogish Sabharwal, Sayan Ranu:
GREED: A Neural Framework for Learning Graph Distance Functions. NeurIPS 2022 - 2021
- [c57]Venkatesan T. Chakaravarthy, Padmanabha Venkatagiri Seshadri, Pooja Aggarwal, Anamitra R. Choudhury, Ashok Pon Kumar, Yogish Sabharwal, Amith Singhee:
Rightsizing Clusters for Time-Limited Tasks. CLOUD 2021: 619-624 - [c56]Venkatesan T. Chakaravarthy, Shivmaran S. Pandian, Saurabh Raje, Yogish Sabharwal, Toyotaro Suzumura, Shashanka Ubaru:
Efficient scaling of dynamic graph neural networks. SC 2021: 77 - [i15]Venkatesan T. Chakaravarthy, Shivmaran S. Pandian, Saurabh Raje, Yogish Sabharwal, Toyotaro Suzumura, Shashanka Ubaru:
Efficient Scaling of Dynamic Graph Neural Networks. CoRR abs/2109.07893 (2021) - [i14]Venkatesan T. Chakaravarthy, Padmanabha Venkatagiri Seshadri, Pooja Aggarwal, Anamitra R. Choudhury, Ashok Pon Kumar, Yogish Sabharwal, Amith Singhee:
Rightsizing Clusters for Time-Limited Tasks. CoRR abs/2112.11597 (2021) - [i13]Rishabh Ranjan, Siddharth Grover, Sourav Medya, Venkatesan T. Chakaravarthy, Yogish Sabharwal, Sayan Ranu:
A Neural Framework for Learning Subgraph and Graph Similarity Measures. CoRR abs/2112.13143 (2021) - 2020
- [j16]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Scheduling split intervals with non-uniform demands. Discret. Optim. 38: 100611 (2020) - [c55]Saurabh Goyal, Anamitra Roy Choudhury, Saurabh Raje, Venkatesan T. Chakaravarthy, Yogish Sabharwal, Ashish Verma:
PoWER-BERT: Accelerating BERT Inference via Progressive Word-vector Elimination. ICML 2020: 3690-3699 - [i12]Saurabh Goyal, Anamitra Roy Choudhury, Venkatesan T. Chakaravarthy, Saurabh ManishRaje, Yogish Sabharwal, Ashish Verma:
PoWER-BERT: Accelerating BERT inference for Classification Tasks. CoRR abs/2001.08950 (2020)
2010 – 2019
- 2019
- [c54]Venkatesan T. Chakaravarthy, Shivmaran S. Pandian, Saurabh Raje, Yogish Sabharwal:
On optimizing distributed non-negative Tucker decomposition. ICS 2019: 238-249 - 2018
- [j15]Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambudha Roy, Yogish Sabharwal:
Set Cover Problems with Small Neighborhood Covers. Theory Comput. Syst. 62(8): 1763-1797 (2018) - [j14]Venkatesan T. Chakaravarthy
, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal:
Improved algorithms for resource allocation under varying capacity. J. Sched. 21(3): 313-325 (2018) - [c53]Venkatesan T. Chakaravarthy, Aashish Goyal, Prakash Murali, Shivmaran S. Pandian, Yogish Sabharwal:
Improved Distributed Algorithm for Graph Truss Decomposition. Euro-Par 2018: 703-717 - [c52]Venkatesan T. Chakaravarthy, Jee W. Choi, Douglas J. Joseph, Prakash Murali, Shivmaran S. Pandian, Yogish Sabharwal, Dheeraj Sreedhar:
On Optimizing Distributed Tucker Decomposition for Sparse Tensors. ICS 2018: 374-384 - [c51]Jee W. Choi, Xing Liu, Venkatesan T. Chakaravarthy:
High-performance dense tucker decomposition on GPU clusters. SC 2018: 42:1-42:11 - [i11]Venkatesan T. Chakaravarthy, Jee W. Choi, Douglas J. Joseph, Prakash Murali, Yogish Sabharwal, Shivmaran S. Pandian, Dheeraj Sreedhar:
On Optimizing Distributed Tucker Decomposition for Sparse Tensors. CoRR abs/1804.09494 (2018) - 2017
- [j13]Venkatesan T. Chakaravarthy, Fabio Checconi, Prakash Murali, Fabrizio Petrini, Yogish Sabharwal:
Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems. IEEE Trans. Parallel Distributed Syst. 28(7): 2031-2045 (2017) - [c50]Venkatesan T. Chakaravarthy, Jee W. Choi, Douglas J. Joseph, Xing Liu, Prakash Murali, Yogish Sabharwal, Dheeraj Sreedhar:
On Optimizing Distributed Tucker Decomposition for Dense Tensors. IPDPS 2017: 1038-1047 - [c49]Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral:
Replica Placement on Bounded Treewidth Graphs. WADS 2017: 13-24 - [i10]Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral:
Replica Placement on Bounded Treewidth Graphs. CoRR abs/1705.00145 (2017) - [i9]Venkatesan T. Chakaravarthy, Jee W. Choi, Douglas J. Joseph, Xing Liu, Prakash Murali, Yogish Sabharwal, Dheeraj Sreedhar:
On Optimizing Distributed Tucker Decomposition for Dense Tensors. CoRR abs/1707.05594 (2017) - 2016
- [c48]Venkatesan T. Chakaravarthy, Michael Kapralov
Subgraph Counting: Color Coding Beyond Trees. IPDPS 2016: 2-11 - [c47]Venkatesan T. Chakaravarthy, Sreyash Kenkre, Sakib A. Mondal
Reusable Resource Scheduling via Colored Interval Covering. IPDPS 2016: 1003-1012 - [i8]Venkatesan T. Chakaravarthy, Michael Kapralov, Prakash Murali, Fabrizio Petrini, Xinyu Que, Yogish Sabharwal, Baruch Schieber:
Subgraph Counting: Color Coding Beyond Trees. CoRR abs/1602.04478 (2016) - 2015
- [c46]Deepan Subrahmanian Palguna, Vikas Joshi, Venkatesan T. Chakaravarthy, Ravi Kothari, L. Venkata Subramaniam:
Analysis of Sampling Algorithms for Twitter. IJCAI 2015: 967-973 - [c45]Venkatesan T. Chakaravarthy, Neelima Gupta, Aditya Pancholi, Sambuddha Roy:
Fast Algorithms for Constrained Graph Density Problems. WALCOM 2015: 8-19 - 2014
- [c44]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal:
Improved Algorithms for Resource Allocation under Varying Capacity. ESA 2014: 222-234 - [c43]Sonika Arora, Venkatesan T. Chakaravarthy, Kanika Gupta, Neelima Gupta, Yogish Sabharwal:
Replica Placement on Directed Acyclic Graphs. FSTTCS 2014: 213-225 - [c42]Sonika Arora, Archita Agarwal, Venkatesan T. Chakaravarthy, Yogish Sabharwal:
Algorithms for power-aware resource activation. HiPC 2014: 1-10 - [c41]Venkatesan T. Chakaravarthy, Fabio Checconi, Fabrizio Petrini, Yogish Sabharwal:
Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems. IPDPS 2014: 889-901 - 2013
- [c40]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Scheduling Jobs with Multiple Non-uniform Tasks. Euro-Par 2013: 90-101 - [c39]Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers. FSTTCS 2013: 249-261 - [c38]Sonika Arora, Venkatesan T. Chakaravarthy, Neelima Gupta, Koyel Mukherjee, Yogish Sabharwal:
Replica Placement via Capacitated Vertex Cover. FSTTCS 2013: 263-274 - [c37]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sivaramakrishnan R. Natarajan, Sambuddha Roy:
Knapsack Cover Subject to a Matroid Constraint. FSTTCS 2013: 275-286 - [c36]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths. IPDPS 2013: 973-984 - [i7]Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers. CoRR abs/1312.7217 (2013) - 2012
- [j12]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Vijay K. Garg, Yogish Sabharwal:
Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem. Theory Comput. Syst. 51(4): 447-473 (2012) - [c35]Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal:
Scheduling Resources for Executing a Partial Set of Jobs. FSTTCS 2012: 199-210 - [c34]Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal:
Density Functions subject to a Co-Matroid Constraint. FSTTCS 2012: 236-248 - [c33]Venkatesan T. Chakaravarthy, Monu Kedia, Yogish Sabharwal, Naga Praveen Kumar Katta, Ramakrishnan Rajamony, Aruna Ramanan:
Mapping strategies for the PERCS architecture. HiPC 2012: 1-10 - [c32]Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal:
Distributed algorithms for scheduling on line and tree networks. PODC 2012: 345-354 - [i6]Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal:
Distributed Algorithms for Scheduling on Line and Tree Networks. CoRR abs/1205.1924 (2012) - [i5]Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal:
Density Functions subject to a Co-Matroid Constraint. CoRR abs/1207.5215 (2012) - [i4]Venkatesan T. Chakaravarthy, Naga Praveen Kumar Katta, Monu Kedia, Ramakrishnan Rajamony, Aruna Ramanan, Yogish Sabharwal:
Mapping Strategies for the PERCS Architecture. CoRR abs/1208.2849 (2012) - [i3]Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal:
Scheduling Resources for Executing a Partial Set of Jobs. CoRR abs/1210.2906 (2012) - 2011
- [j11]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Arthur and Merlin as Oracles. Comput. Complex. 20(3): 505-558 (2011) - [j10]Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania:
Decision trees for entity identification: Approximation algorithms and hardness results. ACM Trans. Algorithms 7(2): 15:1-15:22 (2011) - [c31]Venkatesan T. Chakaravarthy, Amit Kumar
Scheduling Resources for Throughput Maximization. APPROX-RANDOM 2011: 111-122 - [c30]Venkatesan T. Chakaravarthy, Amit Kumar
Resource Allocation for Covering Time Varying Demands. ESA 2011: 543-554 - [c29]Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal, Neha Sengupta:
Maximizing throughput of jobs with multiple resource requirements. HiPC 2011: 1-9 - [c28]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 - [c27]Venkatesan T. Chakaravarthy, Gyana R. Parija, Sambuddha Roy, Yogish Sabharwal, Amit Kumar
Minimum Cost Resource Allocation for Meeting Job Requirements. IPDPS 2011: 14-23 - [c26]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal:
Improved Algorithms for the Distributed Trigger Counting Problem. IPDPS 2011: 515-523 - 2010
- [c25]Venkatesan T. Chakaravarthy, Nikhil Jain, Yogish Sabharwal:
Optimizing Matrix Transpose on Torus Interconnects. Euro-Par (2) 2010: 440-451 - [c24]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 - [c23]Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal:
Finding Independent Sets in Unions of Perfect Graphs. FSTTCS 2010: 251-259 - [c22]Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal, Deva P. Seetharam:
Varying bandwidth resource allocation problem with bag constraints. IPDPS 2010: 1-10 - [c21]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Vijay K. Garg, Yogish Sabharwal:
Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting. DISC 2010: 398-400 - [i2]Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal:
On the Complexity of the $k$-Anonymization Problem. CoRR abs/1004.4729 (2010)
2000 – 2009
- 2009
- [j9]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Approximating maximum weight K-colorable subgraphs in chordal graphs. Inf. Process. Lett. 109(7): 365-368 (2009) - [j8]Mukesh K. Mohania, Manish Bhide, Prasan Roy, Venkatesan T. Chakaravarthy, Himanshu Gupta:
Context Oriented Information Integration. Trans. Large Scale Data Knowl. Centered Syst. 1: 289-326 (2009) - [c20]Govind Kothari, Sumit Negi, Tanveer A. Faruquie, Venkatesan T. Chakaravarthy, L. Venkata Subramaniam:
SMS based Interface for FAQ Retrieval. ACL/IJCNLP 2009: 852-860 - [c19]Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal:
Approximating Decision Trees with Multiway Branches. ICALP (1) 2009: 210-221 - [c18]Manish Bhide, Venkatesan T. Chakaravarthy, Krithi Ramamritham, Prasan Roy:
Keyword Search over Dynamic Categorized Information. ICDE 2009: 258-269 - [c17]Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal:
Analysis of sampling techniques for association rule mining. ICDT 2009: 276-283 - [i1]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Arthur and Merlin as Oracles. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c16]Venkatesan T. Chakaravarthy, Himanshu Gupta, Prasan Roy, Mukesh K. Mohania:
Efficient techniques for document sanitization. CIKM 2008: 843-852 - [c15]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Arthur and Merlin as Oracles. MFCS 2008: 229-240 - [c14]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Finding Irrefutable Certificates for S2p via Arthur and Merlin. STACS 2008: 157-168 - 2007
- [c13]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
- [j7]Jin-yi Cai, Venkatesan T. Chakaravarthy:
On zero error algorithms having oracle access to one query. J. Comb. Optim. 11(2): 189-202 (2006) - [j6]Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek:
Time-Space Tradeoff in Derandomizing Probabilistic Logspace. Theory Comput. Syst. 39(1): 189-208 (2006) - [c12]Venkatesan T. Chakaravarthy, Sambuddha Roy:
Oblivious Symmetric Alternation. STACS 2006: 230-241 - [c11]Venkatesan T. Chakaravarthy, Himanshu Gupta, Prasan Roy, Mukesh K. Mohania:
Efficiently Linking Text Documents with Relevant Structured Information. VLDB 2006: 667-678 - 2005
- [j5]Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra
Competing provers yield improved Karp-Lipton collapse results. Inf. Comput. 198(1): 1-23 (2005) - [j4]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) - [c10]Jin-yi Cai, Venkatesan T. Chakaravarthy:
A Note on Zero Error Algorithms Having Oracle Access to One NP Query. COCOON 2005: 339-348 - 2004
- [c9]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 - [c8]Raghav Kaushik, Raghu Ramakrishnan, Venkatesan T. Chakaravarthy:
Synopses for Query Optimization: A Space-Complexity Perspective. PODS 2004: 201-209 - [c7]Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek:
Time-Space Tradeoff in Derandomizing Probabilistic Logspace. STACS 2004: 571-583 - 2003
- [c6]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 - [c5]Venkatesan T. Chakaravarthy:
New results on the computability and complexity of points - to analysis. POPL 2003: 115-125 - [c4]Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra
Competing Provers Yield Improved Karp-Lipton Collapse Results. STACS 2003: 535-546 - 2002
- [j3]Venkatesan T. Chakaravarthy, Susan Horwitz:
On the non-approximability of points-to analysis. Acta Informatica 38(8): 587-598 (2002) - [c3]Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy:
The Problem of Context Sensitive String Matching. CPM 2002: 64-75 - 2001
- [c2]Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton:
On the Complexity of Join Predicates. PODS 2001
1990 – 1999
- 1998
- [j2]Viswanathan Radhakrishnan, Venkatesan T. Chakaravarthy, Kamala Krithivasan:
Pattern Matching in Matrix Grammars. J. Autom. Lang. Comb. 3(1): 59-72 (1998) - 1997
- [j1]Venkatesan T. Chakaravarthy, Kamala Krithivasan:
A Note on Extended H Systems with Permitting/Forbidding Contexts of Radius One. Bull. EATCS 62 (1997) - [c1]Kamala Krithivasan, Venkatesan T. Chakaravarthy, Raghavan Rama:
Array Splicing Systems. New Trends in Formal Languages 1997: 346-365
Coauthor Index
Anamitra R. Choudhury
aka: Anamitra Roy Choudhury
aka: Anamitra Roy Choudhury
Sambuddha Roy
aka: Sambudha Roy
aka: Sambudha Roy
[c58] [c57] [c56] [i15] [i14] [i13] [j16] [c55] [i12] [c54] [j15] [j14] [c53] [c52] [i11] [j13] [c50] [c49] [i10] [i9] [c48] [c47] [i8] [c44] [c43] [c42] [c41] [c40] [c39] [c38] [c36] [i7] [j12] [c35] [c34] [c33] [c32] [i6] [i5] [i4] [i3] [c31] [c30] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [i2] [c19] [c17]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: