Year |
Citation |
Score |
2016 |
Brody J, Chakrabarti A, Kondapally R, Woodruff DP, Yaroslavtsev G. Certifying Equality With Limited Interaction Algorithmica. 1-50. DOI: 10.1007/S00453-016-0163-6 |
0.327 |
|
2015 |
Chakrabarti A, Kale S. Submodular maximization meets streaming: matchings, matroids, and more Mathematical Programming. 154: 225-247. DOI: 10.1007/S10107-015-0900-7 |
0.35 |
|
2014 |
Chakrabarti A, Cormode G, McGregor A, Thaler J. Annotations in data streams Acm Transactions On Algorithms. 11. DOI: 10.1145/2636924 |
0.347 |
|
2013 |
Chakrabarti A, Cormode G, Kondapally R, McGregor A. Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition Siam Journal On Computing. 42: 61-83. DOI: 10.1137/100816481 |
0.314 |
|
2012 |
Chakrabarti A, Regev O. An optimal lower bound on the communication complexity of gap-hamming-distance Siam Journal On Computing. 41: 1299-1317. DOI: 10.1137/120861072 |
0.334 |
|
2012 |
Chakrabarti A. A note on randomized streaming space bounds for the longest increasing subsequence problem Information Processing Letters. 112: 261-263. DOI: 10.1016/J.Ipl.2011.12.008 |
0.341 |
|
2011 |
Calinescu G, Chakrabarti A, Karloff H, Rabani Y. An improved approximation algorithm for RESOURCE ALLOCATION Acm Transactions On Algorithms. 7. DOI: 10.1145/2000807.2000816 |
0.308 |
|
2011 |
Chakrabarti A, Khot S. Combinatorial theorems about embedding trees on the real line Journal of Graph Theory. 67: 153-168. DOI: 10.1002/Jgt.20608 |
0.325 |
|
2010 |
Chakrabarti A, Cormode G, Mcgregor A. A near-optimal algorithm for estimating the entropy of a stream Acm Transactions On Algorithms. 6: 51. DOI: 10.1145/1798596.1798604 |
0.34 |
|
2007 |
Chakrabarti A, Khot S. Improved lower bounds on the randomized complexity of graph properties Random Structures and Algorithms. 30: 427-440. DOI: 10.1002/Rsa.V30:3 |
0.338 |
|
2002 |
Chakrabarti A, Khot S, Shi Y. Evasiveness of Subgraph Containment and Related Properties Siam Journal On Computing. 31: 866-875. DOI: 10.1137/S0097539700382005 |
0.313 |
|
2002 |
Chakrabarti A, Chekuri C, Gupta A, Kumar A. Approximation algorithms for the unsplittable flow problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2462: 51-67. DOI: 10.1007/S00453-006-1210-5 |
0.36 |
|
2002 |
Chakrabarti A, Chekuri C, Gupta A, Kumar A. Approximation Algorithms for the Unsplittable Flow Problem Lecture Notes in Computer Science. 51-66. DOI: 10.1007/3-540-45753-4_7 |
0.36 |
|
Show low-probability matches. |