Travelled to:1 × Canada
2 × Greece
5 × USA
Collaborated with:G.Cormode A.McGregor O.Regev S.Khot L.Fleischer C.Weibel C.Arackaparambil J.Brody S.Zhang J.Ford F.Makedon N.Bansal A.Epstein B.Schieber B.Chazelle B.Gum A.Lvov
Talks about:lower (4) bound (4) complex (3) communic (2) stream (2) graph (2) seri (2) ham (2) recommend (1) multiflow (1)
Person: Amit Chakrabarti
DBLP: Chakrabarti:Amit
Contributed to:
20122011
20092008
2006200620011999Wrote 9 papers:
- STOC-2012-ChakrabartiFW #multi #network #problem
- When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks (AC, LF, CW), pp. 19–26.
- STOC-2011-ChakrabartiR #bound #communication #complexity
- An optimal lower bound on the communication complexity of gap-hamming-distance (AC, OR), pp. 51–60.
- ICALP-v1-2009-ArackaparambilBC #functional #monitoring
- Functional Monitoring without Monotonicity (CA, JB, AC), pp. 95–106.
- ICALP-v1-2009-ChakrabartiCM #data type
- Annotations in Data Streams (AC, GC, AM), pp. 222–234.
- STOC-2008-ChakrabartiCM #bound #communication #robust
- Robust lower bounds for communication and stream computation (AC, GC, AM), pp. 641–650.
- KDD-2006-ZhangCFM #detection #recommendation
- Attack detection in time series for recommender systems (SZ, AC, JF, FM), pp. 809–814.
- STOC-2006-BansalCES #graph
- A quasi-PTAS for unsplittable flow on line graphs (NB, AC, AE, BS), pp. 721–729.
- ICALP-2001-ChakrabartiK #bound #complexity #graph #random
- Improved Lower Bounds on the Randomized Complexity of Graph Properties (AC, SK), pp. 285–296.
- STOC-1999-ChakrabartiCGL #approximate #bound #complexity #nearest neighbour
- A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube (AC, BC, BG, AL), pp. 305–311.