Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Submodular Maximization Meets Streaming: Matchings, Matroids, and More
- Amit Chakrabarti, Sagar Kale
- Mathematics, Computer Science
- IPCO
- 8 September 2013
TLDR
Near-optimal lower bounds on the multi-party communication complexity of set disjointness
- Amit Chakrabarti, S. Khot, X. Sun
- Mathematics, Computer Science
- 18th IEEE Annual Conference on Computational…
- 7 July 2003
TLDR
Improved Approximation Algorithms for Resource Allocation
- G. Calinescu, Amit Chakrabarti, H. Karloff, Y. Rabani
- Computer Science
- IPCO
- 27 May 2002
TLDR
A quasi-PTAS for unsplittable flow on line graphs
- N. Bansal, Amit Chakrabarti, A. Epstein, B. Schieber
- Computer Science, Mathematics
- STOC '06
- 21 May 2006
TLDR
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
- Amit Chakrabarti, O. Regev
- Mathematics, Computer Science
- SIAM J. Comput.
- 17 September 2010
TLDR
Approximation Algorithms for the Unsplittable Flow Problem
- Amit Chakrabarti, C. Chekuri, A. Gupta, A. Kumar
- Mathematics, Computer Science
- Algorithmica
- 2006
TLDR
Informational complexity and the direct sum problem for simultaneous message complexity
- Amit Chakrabarti, Y. Shi, A. Wirth, A. Yao
- Mathematics, Computer Science
- Proceedings IEEE International Conference on…
- 14 October 2001
TLDR
A near-optimal algorithm for computing the entropy of a stream
- Amit Chakrabarti, Graham Cormode, A. Mcgregor
- Mathematics, Computer Science
- SODA '07
- 7 January 2007
TLDR
Functional Monitoring without Monotonicity
- Chrisil Arackaparambil, J. Brody, Amit Chakrabarti
- Computer Science, Mathematics
- ICALP
- 6 July 2009
TLDR
An optimal randomised cell probe lower bound for approximate nearest neighbour searching
- Amit Chakrabarti, O. Regev
- Mathematics, Computer Science
- 45th Annual IEEE Symposium on Foundations of…
- 17 October 2004
TLDR