Amit Chakrabarti
Amit Chakrabarti
Professor of Computer Science, Dartmouth College
Verified email at cs.dartmouth.edu - Homepage
Title
Cited by
Cited by
Year
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
2772001
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
2232003
A near-optimal algorithm for computing the entropy of a stream
A Chakrabarti, G Cormode, A McGregor
SODA 7, 328-335, 2007
178*2007
Improved approximation algorithms for resource allocation
G Calinescu, A Chakrabarti, H Karloff, Y Rabani
International Conference on Integer Programming and Combinatorial …, 2002
141*2002
An optimal lower bound on the communication complexity of gap-hamming-distance
A Chakrabarti, O Regev
SIAM Journal on Computing 41 (5), 1299-1317, 2012
1402012
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
1012006
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
972010
Estimating entropy and entropy norm on data streams
A Chakrabarti, K Do Ba, S Muthukrishnan
Internet Mathematics 3 (1), 63-78, 2006
972006
Functional monitoring without monotonicity
C Arackaparambil, J Brody, A Chakrabarti
International Colloquium on Automata, Languages, and Programming, 95-106, 2009
942009
Approximation algorithms for the unsplittable flow problem
A Chakrabarti, C Chekuri, A Gupta, A Kumar
Algorithmica 47 (1), 53-78, 2007
932007
Approximation algorithms for the unsplittable flow problem
A Chakrabarti, C Chekuri, A Gupta, A Kumar
Algorithmica 47 (1), 53-78, 2007
932007
Submodular maximization meets streaming: Matchings, matroids, and more
A Chakrabarti, S Kale
Mathematical Programming 154 (1), 225-247, 2015
922015
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
852006
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
722008
Approximation algorithms for the unsplittable flow problem
A Chakrabarti, C Chekuri, A Gupta, A Kumar
International Workshop on Approximation Algorithms for Combinatorial …, 2002
702002
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, 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
512008
Annotations in data streams
A Chakrabarti, G Cormode, A Mcgregor
International Colloquium on Automata, Languages, and Programming, 222-234, 2009
442009
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
412013
A fast online spanner for roadmap construction
W Wang, D Balkcom, A Chakrabarti
The International Journal of Robotics Research 34 (11), 1418-1432, 2015
36*2015
The system can't perform the operation now. Try again later.
Articles 1–20