Amit Chakrabarti

Cited by

	All	Since 2017
Citations	2799	1068
h-index	29	18
i10-index	42	30

220

110

165

20022003200420052006200720082009201020112012201320142015201620172018201920202021202218 15 26 21 46 83 122 145 142 125 150 188 218 196 181 185 202 218 169 182 112

Public access

View all

12 articles

1 article

available

not available

Based on funding mandates

Co-authors

Graham CormodeMeta AI, University of WarwickVerified email at warwick.ac.uk
Andrew McGregorUniversity of Massachusetts, AmherstVerified email at cs.umass.edu
Joshua BrodyAssociate Professor, Swarthmore CollegeVerified email at cs.swarthmore.edu
Anthony WirthProfessor, School of Computing and Information Systems, The University of MelbourneVerified email at unimelb.edu.au
Yaoyun Shi 施尧耘Alibaba Quantum LaboratoryVerified email at alibaba-inc.com
Justin ThalerGeorgetown UniversityVerified email at georgetown.edu
Oded RegevProfessor of Computer ScienceVerified email at cims.nyu.edu
Yuval RabaniThe Hebrew University of JerusalemVerified email at cs.huji.ac.il
Howard KarloffGoldman SachsVerified email at cc.gatech.edu
Prantar GhoshPh.D. Student, Dartmouth CollegeVerified email at cs.dartmouth.edu
Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-ChampaignVerified email at illinois.edu
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Suman Kalyan BeraKatana GraphVerified email at katanagraph.com
Sagar KalePostdoc at University of ViennaVerified email at univie.ac.at
Grigory YaroslavtsevAssistant Professor, George Mason UniversityVerified email at grigory.us
Suresh VenkatasubramanianBrown UniversityVerified email at brown.edu
Bernard ChazellePrinceton UniversityVerified email at cs.princeton.edu
T.S. JayramIBM Almaden ResearchVerified email at us.ibm.com
Nikhil BansalUniversity of MichiganVerified email at umich.edu
Amir EpsteinIBM Research - HaifaVerified email at il.ibm.com

Amit Chakrabarti

Professor of Computer Science, Dartmouth College

Verified email at cs.dartmouth.edu - Homepage

Complexity Theory Algorithms Graph Theory Discrete Mathematics


Title Sort by citations Sort by year Sort by 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	282	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	228	2003
A near-optimal algorithm for computing the entropy of a stream A Chakrabarti, G Cormode, A McGregor SODA 7, 328-335, 2007	189*	2007
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	165	2012
Improved approximation algorithms for resource allocation G Calinescu, A Chakrabarti, H Karloff, Y Rabani International Conference on Integer Programming and Combinatorial …, 2002	147*	2002
Submodular maximization meets streaming: matchings, matroids, and more A Chakrabarti, S Kale Mathematical Programming 154 (1), 225-247, 2015	117	2015
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	112	2006
Approximation algorithms for the unsplittable flow problem A Chakrabarti, C Chekuri, A Gupta, A Kumar Algorithmica 47 (1), 53-78, 2007	106	2007
Approximation algorithms for the unsplittable flow problem A Chakrabarti, C Chekuri, A Gupta, A Kumar Algorithmica 47 (1), 53-78, 2007	106	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	103	2006
Estimating entropy and entropy norm on data streams A Chakrabarti, K Do Ba, S Muthukrishnan Internet Mathematics 3 (1), 63-78, 2006	100	2006
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	99	2010
Functional monitoring without monotonicity C Arackaparambil, J Brody, A Chakrabarti International Colloquium on Automata, Languages, and Programming, 95-106, 2009	98	2009
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	78	2008
Approximation algorithms for the unsplittable flow problem A Chakrabarti, C Chekuri, A Gupta, A Kumar International Workshop on Approximation Algorithms for Combinatorial …, 2002	73	2002
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	62*	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	55	2008
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, 2017	49	2017
Annotations in data streams A Chakrabarti, G Cormode, A Mcgregor International Colloquium on Automata, Languages, and Programming, 222-234, 2009	46	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	42	2013

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors