Прати
Amit Chakrabarti
Amit Chakrabarti
Professor of Computer Science, Dartmouth College
Верификована је имејл адреса на cs.dartmouth.edu - Почетна страница
Наслов
Навело
Навело
Година
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
3132001
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
2492003
A near-optimal algorithm for computing the entropy of a stream
A Chakrabarti, G Cormode, A McGregor
SODA 7, 328-335, 2007
199*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
1902011
Submodular maximization meets streaming: matchings, matroids, and more
A Chakrabarti, S Kale
Mathematical Programming 154, 225-247, 2015
1612015
Improved approximation algorithms for resource allocation
G Calinescu, A Chakrabarti, H Karloff, Y Rabani
Integer Programming and Combinatorial Optimization: 9th International IPCO …, 2002
157*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
1222006
Approximation algorithms for the unsplittable flow problem
A Chakrabarti, C Chekuri, A Gupta, A Kumar
Algorithmica 47 (1), 53-78, 2007
1182007
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
1092006
Estimating entropy and entropy norm on data streams
A Chakrabarti, K Do Ba, S Muthukrishnan
Internet Mathematics 3 (1), 63-78, 2006
1022006
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
1002008
Functional monitoring without monotonicity
C Arackaparambil, J Brody, A Chakrabarti
Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009
982009
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
Approximation algorithms for the unsplittable flow problem
A Chakrabarti, C Chekuri, A Gupta, A Kumar
Approximation Algorithms for Combinatorial Optimization: 5th International …, 2002
822002
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
682017
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
60*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
582008
Annotations in data streams
A Chakrabarti, G Cormode, A Mcgregor
Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009
492009
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
482013
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
462016
Систем тренутно не може да изврши ову радњу. Пробајте поново касније.
Чланци 1–20