Filter Results:
- Full text PDF available (45)
Publication Year
1999
2017
- This year (0)
- Last 5 years (26)
- Last 10 years (59)
Publication Type
Co-author
Journals and Conferences
Learn More
- Amit Chakrabarti, Subhash Khot, Xiaodong Sun
- IEEE Conference on Computational Complexity
- 2003
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of sizen, we establish a near-optimal lower… (More)
- Amit Chakrabarti, Oded Regev
- SIAM J. Comput.
- 2012
Givenm copies of the same problem, does it take m times the amount of resources to solve these m problems? This is the direct sum problem, a fundamental question that has been studied in many… (More)
We study the problem of finding a most profitable subset of n given tasks, each with a given start and finish time as well as profit and resource requirement, that at no time exceeds the quantity B… (More)
- Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
- STACS
- 2006
- Amit Chakrabarti, Graham Cormode, Andrew McGregor
- SODA
- 2007
We describe a simple algorithm for approximating the empirical entropy of a stream of <i>m</i> values in a single pass, using <i>O</i>(ε<sup>-2</sup> log(Δ<sup>-1</sup>) log <i>m</i>) words of space.… (More)
- Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
- APPROX
- 2002
We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum… (More)
- Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber
- STOC
- 2006
We study the Unsplittable Flow Problem (UFP) on line graphs and cycles, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-polynomial… (More)
- Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti
- ICALP
- 2009
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [4] to initiate a formal study of the communication cost of certain fundamental problems… (More)
- Amit Chakrabarti, Oded Regev
- 45th Annual IEEE Symposium on Foundations of…
- 2003
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1 }/sup d/. We show that a randomised cell probe algorithm that uses polynomial storage and word size d/sup O(1)/… (More)