Amit Chakrabarti

发表

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 for Sparse Data Streams

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

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.

Open Problems in Data Streams, Property Testing, and Related Topics

David P. Woodruff, T. S. Jayram, Michael W. Mahoney, 2011 .

Probabilistic Error Upper Bounds For Distributed Statistical Estimation

Amit Chakrabarti, M. Jin, 2017 .

Limitations of non-uniform computational models

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

Data Stream Algorithms Lecture Notes

Amit Chakrabarti, 2020 .

D R A FT CS 49 : Data Stream Algorithms Lecture Notes , Fall 2011

Amit Chakrabarti, 2014 .

Cs49: Data Stream Algorithms Lecture Notes, Fall 2011

Amit Chakrabarti, Zhenghui Wang, Amit Chakrabarti, 2012 .

Credibility of Social Media Postings: A Genetic Algorithmic Approach to Stock Market Contexts

Amit Chakrabarti, U. Sarkar, S. Seal, 2014 .

CS 85 : You Can ’ t Do That ( Lower Bounds in Computer Science ) Lecture Notes , Spring 2008

Amit Chakrabarti, 2008 .

The Information Complexity of Equality and Finding the Intersection

David P. Woodruff, Grigory Yaroslavtsev, Amit Chakrabarti, 2013 .

Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008: Preface

Yael Tauman Kalai, Osamu Watanabe, Yuval Ishai, 2008 .

Submodular maximization meets streaming: matchings, matroids, and more

Amit Chakrabarti, Sagar Kale, 2015, Mathematical Programming.

Improved lower bounds on the randomized complexity of graph properties

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

Lower Bounds on the Communication Complexity of Shifting

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

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

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

An Information Complexity Approach to the Inner Product Problem

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

Communication Complexity

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

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

Amit Chakrabarti, Amit Chakrabarti, 2009 .

C C ] 2 5 Ja n 20 18 Time-Space Tradeoffs for the Memory Game

Amit Chakrabarti, Yining Chen, 2018 .

Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms

Amit Chakrabarti, Sepehr Assadi, Manuel Stoeckl, 2022, ArXiv.

Annotations in Data Streams

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

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

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

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

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

Lecture Notes, Fall 2009

Amit Chakrabarti, Amit Chakrabarti, 2009 .

Tight lower bounds for selection in randomly ordered streams

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

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

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

Estimating Entropy and Entropy Norm on Data Streams

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

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).

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..

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, Subhash Khot, 2001, Random Struct. Algorithms.

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

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

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.

Verifiable Stream Computation and Arthur-Merlin Communication

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

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

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

Attack detection in time series for recommender systems

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

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

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

Everywhere-Tight Information Cost Tradeoffs for Augmented Index

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

Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches

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

Submodular maximization meets streaming: matchings, matroids, and more

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

Approximation Algorithms for the Unsplittable Flow Problem

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

Combinatorial theorems about embedding trees on the real line

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

Selection and sorting with limited storage

J. Ian Munro, Mike Paterson, J. I. Munro, 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

Time-Space Tradeoffs for the Memory Game pdf

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

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.

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.

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

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

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

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

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

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

Dartmouth Digital Commons Dartmouth Digital Commons Functional Monitoring Without Monotonicity Functional Monitoring Without Monotonicity

Amit Chakrabarti, Joshua Brody, Chrisil Arackaparambil, 2009 .

A Note on Randomized Streaming Space Bounds for the Longest A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem Increasing Subsequence Problem

Amit Chakrabarti, 2022 .

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

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

On Interactivity in Arthur-Merlin Communication and Stream Computation

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

Improved Approximation Algorithms for Resource Allocation

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

Vertex Ordering Problems in Directed Graph Streams

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

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

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

Lower Bounds for Multi-Player Pointer Jumping

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

A quasi-PTAS for unsplittable flow on line graphs

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