Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Chakrabarti, Amit"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Submodular maximization meets streaming: Matchings, matroids, and more
Amit Chakrabarti
,
Sagar Kale
Lecture Notes in Computer Science
8494
, 2014, pp. 210-221
Information cost tradeoffs for augmented index and streaming language recognition
Amit Chakrabarti
,
Graham Cormode
,
Ranganath Kondapally
,
Andrew McGregor
SIAM Journal on Computing
42
(1), 2013, pp. 61-83
When the cut condition is enough: A complete characterization for multiflow problems in series-parallel networks
Amit Chakrabarti
,
Lisa Fleischer
,
Christophe Weibel
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 19-26
An optimal lower bound on the communication complexity of Gap-Hamming-Distance
Amit Chakrabarti
,
Oded Regev
SIAM Journal on Computing
41
(5), 2012, pp. 1299-1317
A note on randomized streaming space bounds for the longest increasing subsequence problem
Amit Chakrabarti
Information Processing Letters
112
(7), 2012, pp. 261-263
The query complexity of estimating weighted averages
Amit Chakrabarti
,
Venkatesan Guruswami
,
Andrew Wirth
,
Anthony Wirth
Acta Informatica
48
(7-8), 2011, pp. 417-426
Combinatorial theorems about embedding trees on the real line
Amit Chakrabarti
,
Subhash Khot
Journal of Graph Theory
67
(2), 2011, pp. 153-168
An optimal lower bound on the communication complexity of Gap-Hamming-Distance
Amit Chakrabarti
,
Oded Regev
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 51-60
An optimal randomized cell probe lower bound for approximate nearest neighbor searching
Amit Chakrabarti
,
Oded Regev
SIAM Journal on Computing
39
(5), 2010, pp. 1919-1940
Functional monitoring without monotonicity
Chrisil Arackaparambil
,
Joshua Brody
,
Amit Chakrabarti
Lecture Notes in Computer Science
5555
, 2009, pp. 95-106
Annotations in data streams
Amit Chakrabarti
,
Graham Cormode
,
Andrew McGregor
Lecture Notes in Computer Science
5555
, 2009, pp. 222-234
Sublinear communication protocols for multi-party pointer jumping and a related lower bound
Joshua Brody
,
Amit Chakrabarti
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 145-156
Robust lower bounds for communication and stream computation
Amit Chakrabarti
,
Graham Cormode
,
Andrew McGregor
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 641-649
Approximation algorithms for the unsplittable flow problem
Amit Chakrabarti
,
Chandra Chekuri
,
Anupam Gupta
,
Amit Kumar
Algorithmica
47
(1), 2007, pp. 53-78
Nearly private information retrieval
Amit Chakrabarti
,
Anna Shubina
Lecture Notes in Computer Science
4708
, 2007, pp. 383-393
A quasi-PTAS for unsplittable flow on line graphs
Nikhil Bansal
,
Amit Chakrabarti
,
Amir Epstein
,
Baruch Schieber
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 721-729
Estimating entropy and entropy norm on data streams
Amit Chakrabarti
,
Khanh Do Ba
,
S. Muthukrishnan
Lecture Notes in Computer Science
3884
, 2006, pp. 196-205
Improved approximation algorithms for resource allocation
Gruia Calinescu
,
Amit Chakrabarti
,
Howard Karloff
,
Yuval Rabani
Lecture Notes in Computer Science
2337
, 2002, pp. 401-414
Evasiveness of subgraph containment and related properties
Amit Chakrabarti
,
Subhash Khot
,
Yaoyun Shi
Lecture Notes in Computer Science
2010
, 2001, pp. 110-120
Evasiveness of subgraph containment and related properties
Amit Chakrabarti
,
Subhash Khot
,
Yaoyun Shi
SIAM Journal on Computing
31
(3), 2001-2002, pp. 866-875
Improved lower bounds on the randomized complexity of graph properties
Amit Chakrabarti
,
Subhash Khot
Lecture Notes in Computer Science
2076
, 2001, pp. 285-296
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
Amit Chakrabarti
,
Bernard Chazelle
,
Benjamin Gum
,
Alexey Lvov
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 305-311