| Informational complexity and the direct sum problem for simultaneous message complexity A Chakrabarti, Y Shi, A Wirth, A Yao Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 270-278, 2001 | 312 | 2001 |
| Near-optimal lower bounds on the multi-party communication complexity of set disjointness A Chakrabarti, S Khot, X Sun 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings …, 2003 | 247 | 2003 |
| A near-optimal algorithm for computing the entropy of a stream A Chakrabarti, G Cormode, A McGregor SODA 7, 328-335, 2007 | 196* | 2007 |
| An optimal lower bound on the communication complexity of gap-hamming-distance A Chakrabarti, O Regev Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 190 | 2011 |
| Submodular maximization meets streaming: matchings, matroids, and more A Chakrabarti, S Kale Mathematical Programming 154, 225-247, 2015 | 153 | 2015 |
| Improved approximation algorithms for resource allocation G Calinescu, A Chakrabarti, H Karloff, Y Rabani Integer Programming and Combinatorial Optimization: 9th International IPCO …, 2002 | 147* | 2002 |
| A quasi-PTAS for unsplittable flow on line graphs N Bansal, A Chakrabarti, A Epstein, B Schieber Proceedings of the thirty-eighth annual ACM symposium on theory of computing …, 2006 | 120 | 2006 |
| Approximation algorithms for the unsplittable flow problem A Chakrabarti, C Chekuri, A Gupta, A Kumar Algorithmica 47 (1), 53-78, 2007 | 117 | 2007 |
| Attack detection in time series for recommender systems S Zhang, A Chakrabarti, J Ford, F Makedon Proceedings of the 12th ACM SIGKDD international conference on Knowledge …, 2006 | 113 | 2006 |
| Estimating entropy and entropy norm on data streams A Chakrabarti, K Do Ba, S Muthukrishnan Internet Mathematics 3 (1), 63-78, 2006 | 103 | 2006 |
| Robust lower bounds for communication and stream computation A Chakrabarti, G Cormode, A McGregor Proceedings of the fortieth annual ACM symposium on Theory of computing, 641-650, 2008 | 99 | 2008 |
| An optimal randomized cell probe lower bound for approximate nearest neighbor searching A Chakrabarti, O Regev SIAM Journal on Computing 39 (5), 1919-1940, 2010 | 98 | 2010 |
| Functional monitoring without monotonicity C Arackaparambil, J Brody, A Chakrabarti Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009 | 98 | 2009 |
| Approximation algorithms for the unsplittable flow problem A Chakrabarti, C Chekuri, A Gupta, A Kumar Approximation Algorithms for Combinatorial Optimization: 5th International …, 2002 | 77 | 2002 |
| Towards tighter space bounds for counting triangles and other substructures in graph streams SK Bera, A Chakrabarti 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 2017 | 65 | 2017 |
| A lower bound on the complexity of approximate nearest-neighbor searching on the hamming cube A Chakrabarti, B Chazelle, B Gum, A Lvov Discrete and Computational Geometry: The Goodman-Pollack Festschrift, 313-328, 2003 | 59* | 2003 |
| Tight lower bounds for selection in randomly ordered streams A Chakrabarti, TS Jayram, M Pǎtraşcu Proceedings of the nineteenth annual ACM-SIAM Symposium on Discrete …, 2008 | 58 | 2008 |
| Annotations in data streams A Chakrabarti, G Cormode, A Mcgregor Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009 | 49 | 2009 |
| Information cost tradeoffs for augmented index and streaming language recognition A Chakrabarti, G Cormode, R Kondapally, A McGregor SIAM Journal on Computing 42 (1), 61-83, 2013 | 48 | 2013 |
| Incidence geometries and the pass complexity of semi-streaming set cover A Chakrabarti, A Wirth Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 46 | 2016 |
Andrew McGregorUniversity of Massachusetts, Amherstcs.umass.edu의 이메일 확인됨
