Name
Papers
Collaborators
VENKATESAN T. CHAKARAVARTHY
61
81
Citations 
PageRank 
Referers 
421
34.76
936
Referees 
References 
1153
692
Search Limit
1001000
Title
Citations
PageRank
Year
Efficient scaling of dynamic graph neural networks10.352021
PoWER-BERT - Accelerating BERT Inference via Progressive Word-vector Elimination.00.342020
Scheduling split intervals with non-uniform demands00.342020
On optimizing distributed non-negative Tucker decomposition10.362019
High-performance dense tucker decomposition on GPU clusters.40.402018
Set Cover Problems with Small Neighborhood Covers.00.342018
On Optimizing Distributed Tucker Decomposition for Sparse Tensors.30.372018
Improved Distributed Algorithm for Graph Truss Decomposition.00.342018
On Optimizing Distributed Tucker Decomposition For Dense Tensors30.382017
Replica Placement on Bounded Treewidth Graphs.00.342017
Subgraph Counting: Color Coding Beyond Trees70.442016
Fast Algorithms for Constrained Graph Density Problems.00.342015
Analysis of sampling algorithms for twitter00.342015
Replica Placement on Directed Acyclic Graphs.10.372014
Improved Algorithms for Resource Allocation under Varying Capacity.20.382014
Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems130.552014
Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths10.352013
Replica Placement via Capacitated Vertex Cover.20.412013
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers.10.372013
Knapsack Cover Subject to a Matroid Constraint.20.402013
Scheduling jobs with multiple non-uniform tasks30.402013
Distributed algorithms for scheduling on line and tree networks20.372012
Scheduling Resources for Executing a Partial Set of Jobs10.352012
Density Functions subject to a Co-Matroid Constraint10.392012
Mapping Strategies for the PERCS Architecture30.422012
Scheduling resources for throughput maximization00.342011
Minimum Cost Resource Allocation for Meeting Job Requirements70.562011
Maximizing throughput of jobs with multiple resource requirements00.342011
Improved Algorithms for the Distributed Trigger Counting Problem50.482011
Resource allocation for covering time varying demands80.592011
Decision trees for entity identification: Approximation algorithms and hardness results351.812011
An efficient decentralized algorithm for the distributed trigger counting problem30.422011
Finding Independent Sets in Unions of Perfect Graphs00.342010
A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints40.432010
Varying bandwidth resource allocation problem with bag constraints150.802010
Brief announcement: a decentralized algorithm for distributed trigger counting40.472010
On the Complexity of the $k$-Anonymization Problem40.432010
Keyword Search over Dynamic Categorized Information40.552009
Context Oriented Information Integration00.342009
Approximating maximum weight K-colorable subgraphs in chordal graphs30.412009
SMS based interface for FAQ retrieval311.752009
Approximating Decision Trees with Multiway Branches110.722009
Analysis of sampling techniques for association rule mining240.852009
Efficient techniques for document sanitization200.892008
Finding Irrefutable Certificates for S2p via Arthur and Merlin40.402008
Oblivious Symmetric Alternation90.462006
Time-Space Tradeoff in Derandomizing Probabilistic Logspace50.542006
Efficiently linking text documents with relevant structured information472.142006
On zero error algorithms having oracle access to one query30.382006
Synopses for query optimization: a space-complexity perspective60.412005
  • 1
  • 2