| Year |
Citation |
Score |
| 2020 |
Chakaravarthy VT, Choudhury AR, Roy S, Sabharwal Y. Scheduling split intervals with non-uniform demands Discrete Optimization. 38: 100611. DOI: 10.1016/J.Disopt.2020.100611 |
0.335 |
|
| 2018 |
Chakaravarthy VT, Choudhury AR, Gupta S, Roy S, Sabharwal Y. Improved algorithms for resource allocation under varying capacity Journal of Scheduling. 21: 313-325. DOI: 10.1007/S10951-017-0515-3 |
0.387 |
|
| 2018 |
Agarwal A, Chakaravarthy VT, Choudhury AR, Roy S, Sabharwal Y. Set Cover Problems with Small Neighborhood Covers Theory of Computing Systems \/ Mathematical Systems Theory. 62: 1763-1797. DOI: 10.1007/S00224-017-9842-1 |
0.393 |
|
| 2014 |
Arora S, Chakaravarthy VT, Gupta K, Gupta N, Sabharwal Y. Replica placement on directed acyclic graphs Leibniz International Proceedings in Informatics, Lipics. 29: 213-225. DOI: 10.4230/LIPIcs.FSTTCS.2014.213 |
0.319 |
|
| 2014 |
Chakaravarthy VT, Checconi F, Petrini F, Sabharwal Y. Scalable single source shortest path algorithms for massively parallel systems Proceedings of the International Parallel and Distributed Processing Symposium, Ipdps. 889-901. DOI: 10.1109/Tpds.2016.2634535 |
0.391 |
|
| 2014 |
Chakaravarthy VT, Choudhury AR, Gupta S, Roy S, Sabharwal Y. Improved algorithms for resource allocation under varying capacity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8737: 222-234. DOI: 10.1007/978-3-662-44777-2_19 |
0.329 |
|
| 2013 |
Arora S, Chakaravarthy VT, Gupta N, Mukherjee K, Sabharwal Y. Replica placement via capacitated vertex cover Leibniz International Proceedings in Informatics, Lipics. 24: 263-274. DOI: 10.4230/LIPIcs.FSTTCS.2013.263 |
0.31 |
|
| 2013 |
Agarwal A, Chakaravarthy VT, Choudhury AR, Roy S, Sabharwal Y. Distributed and parallel algorithms for set cover problems with small neighborhood covers Leibniz International Proceedings in Informatics, Lipics. 24: 249-261. DOI: 10.4230/LIPIcs.FSTTCS.2013.249 |
0.327 |
|
| 2012 |
Chakaravarthy VT, Choudhury AR, Garg VK, Sabharwal Y. Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem Theory of Computing Systems. 51: 447-473. DOI: 10.1007/S00224-012-9405-4 |
0.435 |
|
| 2011 |
Chakaravarthy VT, Pandit V, Roy S, Awasthi P, Mohania MK. Decision trees for entity identification: Approximation algorithms and hardness results Acm Transactions On Algorithms. 7. DOI: 10.1145/1921659.1921661 |
0.416 |
|
| 2011 |
Chakaravarthy VT, Choudhury AR, Sabharwal Y. Improved algorithms for the distributed trigger counting problem Proceedings - 25th Ieee International Parallel and Distributed Processing Symposium, Ipdps 2011. 515-523. DOI: 10.1109/IPDPS.2011.56 |
0.352 |
|
| 2011 |
Chakaravarthy VT, Roy S. Arthur and Merlin as Oracles Computational Complexity. 20: 505-558. DOI: 10.1007/S00037-011-0015-3 |
0.456 |
|
| 2011 |
Chakaravarthy VT, Choudhury AR, Garg VK, Sabharwal Y. An efficient decentralized algorithm for the distributed trigger counting problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6522: 53-64. DOI: 10.1007/978-3-642-17679-1_5 |
0.349 |
|
| 2010 |
Chakaravarthy VT, Choudhury AR, Sabharwal Y. A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints Leibniz International Proceedings in Informatics, Lipics. 8: 181-191. DOI: 10.4230/LIPIcs.FSTTCS.2010.181 |
0.347 |
|
| 2010 |
Chakaravarthy VT, Choudhury AR, Garg VK, Sabharwal Y. Brief announcement: A decentralized algorithm for distributed trigger counting Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6343: 398-400. DOI: 10.1007/978-3-642-15763-9_38 |
0.322 |
|
| 2009 |
Chakaravarthy VT, Roy S. Approximating maximum weight K-colorable subgraphs in chordal graphs Information Processing Letters. 109: 365-368. DOI: 10.1016/J.Ipl.2008.12.007 |
0.363 |
|
| 2008 |
Chakaravarthy VT, Roy S. Arthur and Merlin as oracles Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5162: 229-240. DOI: 10.1007/978-3-540-85238-4_18 |
0.311 |
|
| 2006 |
Cai JY, Chakaravarthy VT. On zero error algorithms having oracle access to one query Journal of Combinatorial Optimization. 11: 189-202. DOI: 10.1007/S10878-006-7130-0 |
0.533 |
|
| 2005 |
Cai JY, Chakaravarthy VT, Hemaspaandra LA, Ogihara M. Competing provers yield improved Karp-Lipton collapse results Information and Computation. 198: 1-23. DOI: 10.1016/J.Ic.2005.01.002 |
0.487 |
|
| 2005 |
Cai JY, Chakaravarthy VT. A note on zero error algorithms having oracle access to one NP query Lecture Notes in Computer Science. 3595: 339-348. |
0.356 |
|
| 2004 |
Cai JY, Chakaravarthy VT, Van Melkebeek D. Time-space tradeoff in derandomizing probabilistic logspace Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2996: 571-583. DOI: 10.1007/S00224-005-1264-9 |
0.478 |
|
| 2003 |
Krishnamurthy R, Chakaravarthy VT, Naughton JF. On the difficulty of finding optimal relational decompositions for XML workloads: A complexity theoretic perspective Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2572: 270-284. |
0.303 |
|
| 2002 |
Chakaravarthy VT, Horwitz S. On the non-approximability of points-to analysis Acta Informatica. 38: 587-598. DOI: 10.1007/S00236-002-0081-8 |
0.35 |
|
| 2001 |
Cai JY, Chakaravarthy VT, Kaushik R, Naughton JF. On the complexity of join predicates Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 207-214. |
0.356 |
|
| Show low-probability matches. |