Amit Chakrabarti

发表

Certifying Equality With Limited Interaction

Joshua Brody, David P. Woodruff, Amit Chakrabarti, 2016, Algorithmica.

Lower Bounds for Multi-Player Pointer Jumping

Amit Chakrabarti, Amit Chakrabarti, 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

Beyond set disjointness: the communication complexity of finding the intersection

Joshua Brody, David P. Woodruff, Amit Chakrabarti, 2014, PODC '14.

A quasi-PTAS for unsplittable flow on line graphs

Baruch Schieber, Nikhil Bansal, Amit Chakrabarti, 2006, STOC '06.

A note on randomized streaming space bounds for the longest increasing subsequence problem

Amit Chakrabarti, Amit Chakrabarti, 2012, Inf. Process. Lett..

When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks pdf

Amit Chakrabarti, Lisa Fleischer, Christophe Weibel, 2012, STOC '12.

Verifiable Stream Computation and Arthur-Merlin Communication

Suresh Venkatasubramanian, Graham Cormode, Andrew McGregor, 2015, CCC.

Estimating Entropy and Entropy Norm on Data Streams

S. Muthukrishnan, Amit Chakrabarti, Khanh Do Ba, 2006, Internet Math..

Communication Complexity

Amit Chakrabarti, Amit Chakrabarti, 2016, Encyclopedia of Algorithms.

Approximation Algorithms for the Unsplittable Flow Problem

Amit Kumar, Amit Chakrabarti, Anupam Gupta, 2002, APPROX.

Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming pdf

Amit Chakrabarti, Ranganath Kondapally, Zhenghui Wang, 2012, APPROX-RANDOM.

On Interactivity in Arthur-Merlin Communication and Stream Computation

Suresh Venkatasubramanian, Graham Cormode, Andrew McGregor, 2013, Electron. Colloquium Comput. Complex..

Time-Space Tradeoffs for the Memory Game pdf

Yining Chen, Amit Chakrabarti, Amit Chakrabarti, 2017, ArXiv.

Combinatorial theorems about embedding trees on the real line

Subhash Khot, Amit Chakrabarti, Subhash Khot, 2011, J. Graph Theory.

Submodular maximization meets streaming: matchings, matroids, and more

Amit Chakrabarti, Sagar Kale, 2015, Math. Program..

A fast online spanner for roadmap construction

Devin J. Balkcom, Amit Chakrabarti, Weifu Wang, 2015, Int. J. Robotics Res..

An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching

Amit Chakrabarti, Oded Regev, 2010, SIAM J. Comput..

Everywhere-Tight Information Cost Tradeoffs for Augmented Index

Amit Chakrabarti, Ranganath Kondapally, Amit Chakrabarti, 2011, APPROX-RANDOM.

Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound pdf

Joshua Brody, Amit Chakrabarti, Amit Chakrabarti, 2008, STACS.

A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences

Joshua Brody, Amit Chakrabarti, Amit Chakrabarti, 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

The query complexity of estimating weighted averages

Venkatesan Guruswami, Andrew Wirth, Amit Chakrabarti, 2011, Acta Informatica.

Approximation Algorithms for the Unsplittable Flow Problem

Amit Kumar, Amit Chakrabarti, Anupam Gupta, 2002, Algorithmica.

Lower Bounds on the Communication Complexity of Shifting

Amit Chakrabarti, Marco D. Adelfio, Amit Chakrabarti, 2005 .

Submodular maximization meets streaming: matchings, matroids, and more

Amit Chakrabarti, Sagar Kale, Amit Chakrabarti, 2013, Math. Program..

Evasiveness of Subgraph Containment and Related Properties

Subhash Khot, Amit Chakrabarti, Yaoyun Shi, 2001, STACS.

An improved approximation algorithm for resource allocation

Yuval Rabani, Amit Chakrabarti, Gruia Calinescu, 2011, TALG.

Near-optimal lower bounds on the multi-party communication complexity of set disjointness

Subhash Khot, Amit Chakrabarti, Xiaodong Sun, 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches

Amit Chakrabarti, Justin Thaler, Prantar Ghosh, 2020, Electron. Colloquium Comput. Complex..

Strong Fooling Sets for Multi-player Communication with Applications to Deterministic Estimation of Stream Statistics

Amit Chakrabarti, Sagar Kale, Amit Chakrabarti, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

An optimal lower bound on the communication complexity of gap-hamming-distance

Amit Chakrabarti, Oded Regev, O. Regev, 2010, STOC '11.

Attack detection in time series for recommender systems

Fillia Makedon, Amit Chakrabarti, Sheng Zhang, 2006, KDD '06.

Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition

Graham Cormode, Andrew McGregor, Amit Chakrabarti, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

A near-optimal algorithm for computing the entropy of a stream

Graham Cormode, Andrew McGregor, Amit Chakrabarti, 2007, SODA '07.

R*-Histograms: efficient representation of spatial relations between objects of arbitrary topology

Fillia Makedon, Amit Chakrabarti, Yuhang Wang, 2004, MULTIMEDIA '04.

Improved Approximation Algorithms for Resource Allocation

Yuval Rabani, Amit Chakrabarti, Gruia Calinescu, 2002, IPCO.

Nearly Private Information Retrieval

Anna Shubina, Amit Chakrabarti, 2007, MFCS.

Annotations in Data Streams

Graham Cormode, Andrew McGregor, Amit Chakrabarti, 2009, ICALP.

Better Gap-Hamming Lower Bounds via Better Round Elimination

Joshua Brody, Ronald de Wolf, Amit Chakrabarti, 2010, APPROX-RANDOM.

Improved lower bounds on the randomized complexity of graph properties

Subhash Khot, Amit Chakrabarti, Subhash Khot, 2001, Random Struct. Algorithms.

Robust lower bounds for communication and stream computation

Graham Cormode, Andrew McGregor, Amit Chakrabarti, 2008, Theory Comput..

A Depth-Five Lower Bound for Iterated Matrix Multiplication

Amit Chakrabarti, Suman K. Bera, 2015, Computational Complexity Conference.

A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube

Bernard Chazelle, Amit Chakrabarti, Alexey Lvov, 1999, STOC '99.

Lower Bounds for Four-player Pointer Jumping

Amit Chakrabarti, David Blinn, 2006 .

A near-optimal algorithm for estimating the entropy of a stream

Graham Cormode, Andrew McGregor, Amit Chakrabarti, 2010, TALG.

Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition

Graham Cormode, Andrew McGregor, Amit Chakrabarti, 2010, FOCS.

An Information Complexity Approach to the Inner Product Problem

Amit Chakrabarti, William Henderson-Frost, Amit Chakrabarti, 2009 .

Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams

Amit Chakrabarti, Suman K. Bera, Suman Kalyan Bera, 2017, STACS.

Settling for limited privacy: how much does it help?

Anna Shubina, Amit Chakrabarti, 2008 .

Special Issue “Conference on Computational Complexity 2008” Guest Editors’ Foreword

Amit Chakrabarti, Paul Beame, P. Beame, 2009, computational complexity.

Estimating Entropy and Entropy Norm on Data Streams

S. Muthukrishnan, Amit Chakrabarti, Khanh Do Ba, 2006, STACS.

An optimal randomised cell probe lower bound for approximate nearest neighbour searching

Amit Chakrabarti, Oded Regev, O. Regev, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Tight lower bounds for selection in randomly ordered streams

T. S. Jayram, Amit Chakrabarti, Mihai Patrascu, 2008, SODA '08.

On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model

Amit Chakrabarti, Subhas C. Nandy, Arijit Bishnu, 2015, FSTTCS.

Improved lower bounds on the randomized complexity of graph properties

Subhash Khot, Amit Chakrabarti, Subhash Khot, 2001, Random Struct. Algorithms.

Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover

Amit Chakrabarti, Anthony Wirth, A. Wirth, 2015, SODA.

Certifying Equality With Limited Interaction

Joshua Brody, David P. Woodruff, Amit Chakrabarti, 2014, APPROX-RANDOM.

Annotations for Sparse Data Streams

Graham Cormode, Amit Chakrabarti, Justin Thaler, 2013, SODA.

Evasiveness of Subgraph Containment and Related Properties

Subhash Khot, Amit Chakrabarti, Yaoyun Shi, 2001, SIAM J. Comput..

An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance

Amit Chakrabarti, Oded Regev, 2012, SIAM J. Comput..

Anomaly Detection in Network Streams Through a Distributional Lens

Chrisil Arackaparambil, Amit Chakrabarti, Chrisil Arackaparambil, 2011 .

Functional Monitoring without Monotonicity

Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti, 2009, ICALP.

A fast streaming spanner algorithm for incrementally constructing sparse roadmaps

Devin J. Balkcom, Amit Chakrabarti, Weifu Wang, 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models pdf

Amit Chakrabarti, Suman K. Bera, Prantar Ghosh, 2019, ICALP.

Vertex Ordering Problems in Directed Graph Streams

Andrew McGregor, Sofya Vorotnikova, Amit Chakrabarti, 2020, SODA.

Informational complexity and the direct sum problem for simultaneous message complexity

Andrew Chi-Chih Yao, Amit Chakrabarti, Anthony Wirth, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Robust lower bounds for communication and stream computation

Graham Cormode, Andrew McGregor, Amit Chakrabarti, 2008, Theory Comput..

Annotations in Data Streams

Graham Cormode, Andrew McGregor, Amit Chakrabarti, 2009, ICALP.

Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums

James R. Lee, Amit Chakrabarti, Alexander Jaffe, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Counting Simplices in Hypergraph Streams pdf

Amit Chakrabarti, Themistoklis Haris, 2021, ArXiv.

Adversarially Robust Coloring for Graph Streams

Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl, 2022, ITCS.

The Element Extraction Problem and the Cost of Determinism and Limited Adaptivity in Linear Queries pdf

Amit Chakrabarti, Manuel Stoeckl, Amit Chakrabarti, 2021, ArXiv.

Improved lower bounds on the randomized complexity of graph properties

Subhash Khot, Amit Chakrabarti, 2007 .

Cs85: Data Stream Algorithms Lecture Notes, Fall 2009 Contents 0 Preliminaries: the Data Stream Model 4

Amit Chakrabarti, Amit Chakrabarti, 2009 .

Attack Detection in Time Series for Recommendation Systems

Fillia Makedon, Amit Chakrabarti, James Ford, 2006 .

Cs49: Data Stream Algorithms Lecture Notes, Fall 2011

Amit Chakrabarti, Zhenghui Wang, Amit Chakrabarti, 2012 .

Limitations of non-uniform computational models

Bernard Chazelle, Amit Chakrabarti, B. Chazelle, 2002 .