Search the dblp DataBase

Publications of Author

1. Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
   Approximation Algorithms for the Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP]
   APPROX, 2002, pp:51-66 [Conf]
   
2. Amit Chakrabarti, Subhash Khot, Xiaodong Sun
   Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2003, pp:107-117 [Conf]
   
3. Amit Chakrabarti, Oded Regev
   An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. [Citation Graph (0, 0)][DBLP]
   FOCS, 2004, pp:473-482 [Conf]
   
4. Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao
   Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. [Citation Graph (0, 0)][DBLP]
   FOCS, 2001, pp:270-278 [Conf]
   
5. Amit Chakrabarti, Subhash Khot
   Improved Lower Bounds on the Randomized Complexity of Graph Properties. [Citation Graph (0, 0)][DBLP]
   ICALP, 2001, pp:285-296 [Conf]
   
6. Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani
   Improved Approximation Algorithms for Resource Allocation. [Citation Graph (0, 0)][DBLP]
   IPCO, 2002, pp:401-414 [Conf]
   
7. Sheng Zhang, Amit Chakrabarti, James Ford, Fillia Makedon
   Attack detection in time series for recommender systems. [Citation Graph (0, 0)][DBLP]
   KDD, 2006, pp:809-814 [Conf]
   
8. Yuhang Wang, Fillia Makedon, Amit Chakrabarti
   R*-Histograms: efficient representation of spatial relations between objects of arbitrary topology. [Citation Graph (0, 0)][DBLP]
   ACM Multimedia, 2004, pp:356-359 [Conf]
   
9. Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
   Estimating Entropy and Entropy Norm on Data Streams. [Citation Graph (0, 0)][DBLP]
   STACS, 2006, pp:196-205 [Conf]
   
10. Amit Chakrabarti, Subhash Khot, Yaoyun Shi
    Evasiveness of Subgraph Containment and Related Properties. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:110-120 [Conf]
    
11. Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber
    A quasi-PTAS for unsplittable flow on line graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:721-729 [Conf]
    
12. Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov
    A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:305-311 [Conf]
    
13. Amit Chakrabarti, Oded Regev
    An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:070, pp:- [Journal]
    
14. Amit Chakrabarti, Subhash Khot, Yaoyun Shi
    Evasiveness of Subgraph Containment and Related Properties. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:866-875 [Journal]
    
15. Amit Chakrabarti
    Lower Bounds for Multi-Player Pointer Jumping. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:33-45 [Conf]
    
16. Amit Chakrabarti, Anna Shubina
    Nearly Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:383-393 [Conf]
    
17. Amit Chakrabarti, Graham Cormode, Andrew McGregor
    A near-optimal algorithm for computing the entropy of a stream. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:328-335 [Conf]
    
18. Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
    Approximation Algorithms for the Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:1, pp:53-78 [Journal]
    
19. 
    Better Gap-Hamming Lower Bounds via Better Round Elimination. [Citation Graph (, )][DBLP]
    
    
20. 
    A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences. [Citation Graph (, )][DBLP]
    
    
21. 
    Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums. [Citation Graph (, )][DBLP]
    
    
22. 
    Annotations in Data Streams. [Citation Graph (, )][DBLP]
    
    
23. 
    Functional Monitoring without Monotonicity. [Citation Graph (, )][DBLP]
    
    
24. 
    Tight lower bounds for selection in randomly ordered streams. [Citation Graph (, )][DBLP]
    
    
25. 
    Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound. [Citation Graph (, )][DBLP]
    
    
26. 
    Robust lower bounds for communication and stream computation. [Citation Graph (, )][DBLP]
    
    
27. 
    Special Issue "Conference on Computational Complexity 2008" Guest Editors' Foreword. [Citation Graph (, )][DBLP]
    
    
28. 
    Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound [Citation Graph (, )][DBLP]
    
    
29. 
    A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences [Citation Graph (, )][DBLP]
    
    
30. 
    Better Gap-Hamming Lower Bounds via Better Round Elimination [Citation Graph (, )][DBLP]
    
    
31. 
    Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition [Citation Graph (, )][DBLP]
    
    
32. 
    Lower Bounds for Multi-Player Pointer Jumping. [Citation Graph (, )][DBLP]