dblp.uni-trier.dewww.uni-trier.de

Amit Chakrabarti Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)