The SCEAS System
| |||||||

## Search the dblp DataBase
Amit Chakrabarti:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - Amit Chakrabarti, Subhash Khot, Yaoyun Shi
**Evasiveness of Subgraph Containment and Related Properties.**[Citation Graph (0, 0)][DBLP] STACS, 2001, pp:110-120 [Conf] - 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] - 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] - 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] - 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] - Amit Chakrabarti
**Lower Bounds for Multi-Player Pointer Jumping.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2007, pp:33-45 [Conf] - Amit Chakrabarti, Anna Shubina
**Nearly Private Information Retrieval.**[Citation Graph (0, 0)][DBLP] MFCS, 2007, pp:383-393 [Conf] - 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] - 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] **Better Gap-Hamming Lower Bounds via Better Round Elimination.**[Citation Graph (, )][DBLP]**A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences.**[Citation Graph (, )][DBLP]**Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums.**[Citation Graph (, )][DBLP]**Annotations in Data Streams.**[Citation Graph (, )][DBLP]**Functional Monitoring without Monotonicity.**[Citation Graph (, )][DBLP]**Tight lower bounds for selection in randomly ordered streams.**[Citation Graph (, )][DBLP]**Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound.**[Citation Graph (, )][DBLP]**Robust lower bounds for communication and stream computation.**[Citation Graph (, )][DBLP]**Special Issue "Conference on Computational Complexity 2008" Guest Editors' Foreword.**[Citation Graph (, )][DBLP]**Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound**[Citation Graph (, )][DBLP]**A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences**[Citation Graph (, )][DBLP]**Better Gap-Hamming Lower Bounds via Better Round Elimination**[Citation Graph (, )][DBLP]**Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition**[Citation Graph (, )][DBLP]**Lower Bounds for Multi-Player Pointer Jumping.**[Citation Graph (, )][DBLP]
Search in 0.044secs, Finished in 0.046secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |