| 2025 | ICLR | Streaming Algorithms For ℓp Flows and ℓp Regression. | Amit Chakrabarti, Jeffrey Jiang, David P. Woodruff, Taisuke Yasuda |
| 2024 | ESA | Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams. | Amit Chakrabarti, Andrew McGregor, Anthony Wirth |
| 2023 | PODS | Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. | Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl |
| 2022 | ESA | Counting Simplices in Hypergraph Streams. | Amit Chakrabarti, Themistoklis Haris |
| 2020 | ICALP | Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. | Suman K. Bera, Amit Chakrabarti, Prantar Ghosh |
| 2020 | SODA | Vertex Ordering Problems in Directed Graph Streams. | Amit Chakrabarti, Prantar Ghosh, Andrew McGregor, Sofya Vorotnikova |
| 2017 | STACS | Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. | Suman K. Bera, Amit Chakrabarti |
| 2016 | FOCS | Strong Fooling Sets for Multi-player Communication with Applications to Deterministic Estimation of Stream Statistics. | Amit Chakrabarti, Sagar Kale |
| 2016 | SODA | Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover. | Amit Chakrabarti, Anthony Wirth |
| 2014 | IPCO | Submodular Maximization Meets Streaming: Matchings, Matroids, and More. | Amit Chakrabarti, Sagar Kale |
| 2014 | PODC | Beyond set disjointness: the communication complexity of finding the intersection. | Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev |
| 2014 | SODA | Annotations for Sparse Data Streams. | Amit Chakrabarti, Graham Cormode, Navin Goyal, Justin Thaler |
| 2013 | IROS | A fast streaming spanner algorithm for incrementally constructing sparse roadmaps. | Weifu Wang, Devin J. Balkcom, Amit Chakrabarti |
| 2012 | STOC | When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks. | Amit Chakrabarti, Lisa Fleischer, Christophe Weibel |
| 2011 | STOC | An optimal lower bound on the communication complexity of gap-hamming-distance. | Amit Chakrabarti, Oded Regev |
| 2010 | FOCS | Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition. | Amit Chakrabarti, Graham Cormode, Ranganath Kondapally, Andrew McGregor |
| 2009 | ICALP | Functional Monitoring without Monotonicity. | Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti |
| 2009 | ICALP | Annotations in Data Streams. | Amit Chakrabarti, Graham Cormode, Andrew McGregor |
| 2008 | FOCS | Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums. | Amit Chakrabarti, Alexander Jaffe, James R. Lee, Justin Vincent |
| 2008 | SODA | Tight lower bounds for selection in randomly ordered streams. | Amit Chakrabarti, T. S. Jayram, Mihai Patrascu |
| 2008 | STOC | Robust lower bounds for communication and stream computation. | Amit Chakrabarti, Graham Cormode, Andrew McGregor |
| 2008 | STACS | Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound. | Joshua Brody, Amit Chakrabarti |
| 2007 | MFCS | Nearly Private Information Retrieval. | Amit Chakrabarti, Anna Shubina |
| 2007 | SODA | A near-optimal algorithm for computing the entropy of a stream. | Amit Chakrabarti, Graham Cormode, Andrew McGregor |
| 2006 | KDD | Attack detection in time series for recommender systems. | Sheng Zhang, Amit Chakrabarti, James Ford, Fillia Makedon |
| 2006 | STOC | A quasi-PTAS for unsplittable flow on line graphs. | Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber |
| 2006 | STACS | Estimating Entropy and Entropy Norm on Data Streams. | Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan |
| 2004 | FOCS | An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. | Amit Chakrabarti, Oded Regev |
| 2002 | IPCO | Improved Approximation Algorithms for Resource Allocation. | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani |
| 2001 | FOCS | Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. | Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao |
| 2001 | ICALP | Improved Lower Bounds on the Randomized Complexity of Graph Properties. | Amit Chakrabarti, Subhash Khot |
| 2001 | STACS | Evasiveness of Subgraph Containment and Related Properties. | Amit Chakrabarti, Subhash Khot, Yaoyun Shi |
| 1999 | STOC | A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube. | Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov |