Amit Chakrabarti

	2009
30		Amit Chakrabarti, Graham Cormode, Andrew McGregor: Annotations in Data Streams. ICALP (1) 2009: 222-234
29		Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti: Functional Monitoring without Monotonicity. ICALP (1) 2009: 95-106
28		Joshua Brody, Amit Chakrabarti: A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences CoRR abs/0902.2399: (2009)
27		Paul Beame, Amit Chakrabarti: Special Issue "Conference on Computational Complexity 2008" Guest Editors' Foreword. Computational Complexity 18(2): 169-170 (2009)
	2008
26		Amit Chakrabarti, Alexander Jaffe, James R. Lee, Justin Vincent: Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums. FOCS 2008: 761-770
25		Amit Chakrabarti, T. S. Jayram, Mihai Patrascu: Tight lower bounds for selection in randomly ordered streams. SODA 2008: 720-729
24		Joshua Brody, Amit Chakrabarti: Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound. STACS 2008: 145-156
23		Amit Chakrabarti, Graham Cormode, Andrew McGregor: Robust lower bounds for communication and stream computation. STOC 2008: 641-650
22		Joshua Brody, Amit Chakrabarti: Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound CoRR abs/0802.2843: (2008)
	2007
21		Amit Chakrabarti: Lower Bounds for Multi-Player Pointer Jumping. IEEE Conference on Computational Complexity 2007: 33-45
20		Amit Chakrabarti, Anna Shubina: Nearly Private Information Retrieval. MFCS 2007: 383-393
19		Amit Chakrabarti, Graham Cormode, Andrew McGregor: A near-optimal algorithm for computing the entropy of a stream. SODA 2007: 328-335
18		Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica 47(1): 53-78 (2007)
17		Amit Chakrabarti: Lower Bounds for Multi-Player Pointer Jumping. Electronic Colloquium on Computational Complexity (ECCC) 14(014): (2007)
16		Amit Chakrabarti, Subhash Khot: Improved lower bounds on the randomized complexity of graph properties. Random Struct. Algorithms 30(3): 427-440 (2007)
	2006
15		Sheng Zhang, Amit Chakrabarti, James Ford, Fillia Makedon: Attack detection in time series for recommender systems. KDD 2006: 809-814
14		Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan: Estimating Entropy and Entropy Norm on Data Streams. STACS 2006: 196-205
13		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		Yuhang Wang, Fillia Makedon, Amit Chakrabarti: R*-Histograms: efficient representation of spatial relations between objects of arbitrary topology. ACM Multimedia 2004: 356-359
10		Amit Chakrabarti, Oded Regev: An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. FOCS 2004: 473-482
	2003
9		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		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		Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. APPROX 2002: 51-66
6		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		Amit Chakrabarti, Subhash Khot: Improved Lower Bounds on the Randomized Complexity of Graph Properties. ICALP 2001: 285-296
3		Amit Chakrabarti, Subhash Khot, Yaoyun Shi: Evasiveness of Subgraph Containment and Related Properties. STACS 2001: 110-120
2		Amit Chakrabarti, Subhash Khot, Yaoyun Shi: Evasiveness of Subgraph Containment and Related Properties. SIAM J. Comput. 31(3): 866-875 (2001)
	1999
1		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

Coauthor Index

1	Chrisil Arackaparambil	[29]
2	Khanh Do Ba	[12] [14]
3	Nikhil Bansal	[13]
4	Paul Beame	[27]
5	Joshua Brody	[22] [24] [28] [29]
6	Gruia Calinescu	[6]
7	Bernard Chazelle	[1]
8	Chandra Chekuri	[7] [18]
9	Graham Cormode	[19] [23] [30]
10	Amir Epstein	[13]
11	James Ford	[15]
12	Benjamin Gum	[1]
13	Anupam Gupta	[7] [18]
14	Alexander Jaffe	[26]
15	T. S. Jayram (Jayram S. Thathachar)	[25]
16	Howard J. Karloff	[6]
17	Subhash Khot	[2] [3] [4] [9] [16]
18	Amit Kumar	[7] [18]
19	James R. Lee	[26]
20	Alexey Lvov	[1]
21	Fillia Makedon	[11] [15]
22	Andrew McGregor	[19] [23] [30]
23	S. Muthukrishnan (S. Muthu Muthukrishnan)	[12] [14]
24	Mihai Patrascu	[25]
25	Yuval Rabani	[6]
26	Oded Regev	[8] [10]
27	Baruch Schieber	[13]
28	Yaoyun Shi	[2] [3] [5]
29	Anna Shubina	[20]
30	Xiaodong Sun	[9]
31	Justin Vincent	[26]
32	Yuhang Wang	[11]
33	Anthony Wirth	[5]
34	Andrew Chi-Chih Yao	[5]
35	Sheng Zhang	[15]

Colors in the list of coauthors