| 2008 |
|---|
| 24 | EE | Amit Chakrabarti,
T. S. Jayram,
Mihai Patrascu:
Tight lower bounds for selection in randomly ordered streams.
SODA 2008: 720-729 |
| 23 | EE | Joshua Brody,
Amit Chakrabarti:
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound.
STACS 2008: 145-156 |
| 22 | EE | Amit Chakrabarti,
Graham Cormode,
Andrew McGregor:
Robust lower bounds for communication and stream computation.
STOC 2008: 641-650 |
| 21 | EE | Joshua Brody,
Amit Chakrabarti:
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
CoRR abs/0802.2843: (2008) |
| 2007 |
|---|
| 20 | EE | Amit Chakrabarti:
Lower Bounds for Multi-Player Pointer Jumping.
IEEE Conference on Computational Complexity 2007: 33-45 |
| 19 | EE | Amit Chakrabarti,
Anna Shubina:
Nearly Private Information Retrieval.
MFCS 2007: 383-393 |
| 18 | EE | Amit Chakrabarti,
Graham Cormode,
Andrew McGregor:
A near-optimal algorithm for computing the entropy of a stream.
SODA 2007: 328-335 |
| 17 | EE | Amit Chakrabarti,
Chandra Chekuri,
Anupam Gupta,
Amit Kumar:
Approximation Algorithms for the Unsplittable Flow Problem.
Algorithmica 47(1): 53-78 (2007) |
| 16 | EE | Amit Chakrabarti,
Subhash Khot:
Improved lower bounds on the randomized complexity of graph properties.
Random Struct. Algorithms 30(3): 427-440 (2007) |
| 2006 |
|---|
| 15 | EE | Sheng Zhang,
Amit Chakrabarti,
James Ford,
Fillia Makedon:
Attack detection in time series for recommender systems.
KDD 2006: 809-814 |
| 14 | EE | Amit Chakrabarti,
Khanh Do Ba,
S. Muthukrishnan:
Estimating Entropy and Entropy Norm on Data Streams.
STACS 2006: 196-205 |
| 13 | EE | Nikhil Bansal,
Amit Chakrabarti,
Amir Epstein,
Baruch Schieber:
A quasi-PTAS for unsplittable flow on line graphs.
STOC 2006: 721-729 |
| 12 | | Amit Chakrabarti,
Khanh Do Ba,
S. Muthukrishnan:
Estimating Entropy and Entropy Norm on Data Streams.
Internet Mathematics 3(1): (2006) |
| 2004 |
|---|
| 11 | EE | Yuhang Wang,
Fillia Makedon,
Amit Chakrabarti:
R*-Histograms: efficient representation of spatial relations between objects of arbitrary topology.
ACM Multimedia 2004: 356-359 |
| 10 | EE | Amit Chakrabarti,
Oded Regev:
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching.
FOCS 2004: 473-482 |
| 2003 |
|---|
| 9 | EE | Amit Chakrabarti,
Subhash Khot,
Xiaodong Sun:
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness.
IEEE Conference on Computational Complexity 2003: 107-117 |
| 8 | EE | Amit Chakrabarti,
Oded Regev:
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
Electronic Colloquium on Computational Complexity (ECCC)(070): (2003) |
| 2002 |
|---|
| 7 | EE | Amit Chakrabarti,
Chandra Chekuri,
Anupam Gupta,
Amit Kumar:
Approximation Algorithms for the Unsplittable Flow Problem.
APPROX 2002: 51-66 |
| 6 | EE | Gruia Calinescu,
Amit Chakrabarti,
Howard J. Karloff,
Yuval Rabani:
Improved Approximation Algorithms for Resource Allocation.
IPCO 2002: 401-414 |
| 2001 |
|---|
| 5 | | Amit Chakrabarti,
Yaoyun Shi,
Anthony Wirth,
Andrew Chi-Chih Yao:
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity.
FOCS 2001: 270-278 |
| 4 | EE | Amit Chakrabarti,
Subhash Khot:
Improved Lower Bounds on the Randomized Complexity of Graph Properties.
ICALP 2001: 285-296 |
| 3 | EE | Amit Chakrabarti,
Subhash Khot,
Yaoyun Shi:
Evasiveness of Subgraph Containment and Related Properties.
STACS 2001: 110-120 |
| 2 | EE | Amit Chakrabarti,
Subhash Khot,
Yaoyun Shi:
Evasiveness of Subgraph Containment and Related Properties.
SIAM J. Comput. 31(3): 866-875 (2001) |
| 1999 |
|---|
| 1 | EE | Amit Chakrabarti,
Bernard Chazelle,
Benjamin Gum,
Alexey Lvov:
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube.
STOC 1999: 305-311 |
