Amit Chakrabarti

Q: What Schools Are Affiliated With Amit Chakrabarti

Amit Chakrabarti is affiliated with the following schools: Kansas State University, University of Calcutta, University of Minnesota, Dartmouth College, Princeton University

Amit Chakrabarti's AcademicInfluence.com Rankings

Amit Chakrabarti

Physics

#7367

World Rank

#9392

Historical Rank

physics Degrees

Download Badge

Physics

Why Is Amit Chakrabarti Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Amit Chakrabarti is the former William and Joan Porter Chair in Physics at Kansas State University. He currently serves as the dean of the college of arts and sciences at Kansas State University. Chakrabarti is a theoretical physicist with interests in soft matter and statistical physics. He has worked on diverse soft matter systems, including liquid mixtures, polymers, liquid crystals, aerosols, colloids, nanoparticles, and most recently, self-assembly of proteins.

(See a Problem?)

Amit Chakrabarti's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Informational complexity and the direct sum problem for simultaneous message complexity (2001) (259)
Near-optimal lower bounds on the multi-party communication complexity of set disjointness (2003) (201)
An optimal lower bound on the communication complexity of gap-hamming-distance (2010) (169)
Approximation Algorithms for the Unsplittable Flow Problem (2002) (143)
A near-optimal algorithm for computing the entropy of a stream (2007) (135)
Submodular maximization meets streaming: matchings, matroids, and more (2013) (126)
A quasi-PTAS for unsplittable flow on line graphs (2006) (96)
Improved Approximation Algorithms for Resource Allocation (2002) (89)
Functional Monitoring without Monotonicity (2009) (85)
Estimating Entropy and Entropy Norm on Data Streams (2006) (83)
Attack detection in time series for recommender systems (2006) (80)
An optimal randomised cell probe lower bound for approximate nearest neighbour searching (2004) (68)
Annotations in Data Streams (2009) (62)
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube (1999) (57)
Robust lower bounds for communication and stream computation (2008) (51)
Tight lower bounds for selection in randomly ordered streams (2008) (50)
A near-optimal algorithm for estimating the entropy of a stream (2010) (46)
Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams (2017) (41)
An improved approximation algorithm for resource allocation (2011) (40)
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums (2008) (38)
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences (2009) (38)
Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover (2015) (36)
Lower Bounds for Multi-Player Pointer Jumping (2007) (32)
Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition (2010) (31)
Verifiable Stream Computation and Arthur-Merlin Communication (2015) (30)
Beyond set disjointness: the communication complexity of finding the intersection (2014) (27)
Improved lower bounds on the randomized complexity of graph properties (2001) (26)
Evasiveness of Subgraph Containment and Related Properties (2001) (25)
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models (2019) (22)
Open Problems in Data Streams, Property Testing, and Related Topics (2011) (21)
Better Gap-Hamming Lower Bounds via Better Round Elimination (2009) (21)
When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks (2012) (18)
Annotations for Sparse Data Streams (2013) (18)
Adversarially Robust Coloring for Graph Streams (2021) (17)
Certifying Equality With Limited Interaction (2016) (16)
Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming (2012) (16)
A fast streaming spanner algorithm for incrementally constructing sparse roadmaps (2013) (16)
A fast online spanner for roadmap construction (2015) (16)
An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching (2010) (15)
R*-Histograms: efficient representation of spatial relations between objects of arbitrary topology (2004) (15)
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound (2008) (13)
Strong Fooling Sets for Multi-player Communication with Applications to Deterministic Estimation of Stream Statistics (2016) (11)
Vertex Ordering Problems in Directed Graph Streams (2021) (10)
Data Stream Algorithms Lecture Notes (2020) (9)
Nearly Private Information Retrieval (2007) (9)
On Interactivity in Arthur-Merlin Communication and Stream Computation (2013) (8)
A Depth-Five Lower Bound for Iterated Matrix Multiplication (2015) (8)
Cs49: Data Stream Algorithms Lecture Notes, Fall 2011 (2012) (6)
A note on randomized streaming space bounds for the longest increasing subsequence problem (2012) (6)
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches (2020) (5)
Streaming Verification of Graph Computations via Graph Structure (2019) (4)
Everywhere-Tight Information Cost Tradeoffs for Augmented Index (2011) (4)
Attack Detection in Time Series for Recommendation Systems (2006) (4)
Time-Space Tradeoffs for the Memory Game (2017) (3)
Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms (2022) (3)
Cs85: Data Stream Algorithms Lecture Notes, Fall 2009 Contents 0 Preliminaries: the Data Stream Model 4 (2009) (2)
Limitations of non-uniform computational models (2002) (1)
On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model (2015) (1)
Submodular maximization meets streaming: matchings, matroids, and more (2015) (1)
Combinatorial theorems about embedding trees on the real line (2011) (1)
The Element Extraction Problem and the Cost of Determinism and Limited Adaptivity in Linear Queries (2021) (1)
Certifying Equality With Limited Interaction (2016) (1)
Improved Approximation Algorithms for Resour eAllo ationGruia (2002) (0)
Counting Simplices in Hypergraph Streams (2021) (0)
Lower Bounds for Four-player Pointer Jumping (2006) (0)
Special Issue “Conference on Computational Complexity 2008” Guest Editors’ Foreword (2009) (0)
C C ] 2 5 Ja n 20 18 Time-Space Tradeoffs for the Memory Game (2018) (0)
Probabilistic Error Upper Bounds For Distributed Statistical Estimation (2017) (0)
Credibility of Social Media Postings: A Genetic Algorithmic Approach to Stock Market Contexts (2014) (0)
CS 85 : You Can ’ t Do That ( Lower Bounds in Computer Science ) Lecture Notes , Spring 2008 (2008) (0)
The Information Complexity of Equality and Finding the Intersection (2013) (0)
The query complexity of estimating weighted averages (2011) (0)
Communication Complexity Notes (2019) (0)
Communication Complexity (2016) (0)
Lower Bounds on the Communication Complexity of Shifting (2005) (0)
D R A FT CS 49 : Data Stream Algorithms Lecture Notes , Fall 2011 (2014) (0)
Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008: Preface (2008) (0)
An Information Complexity Approach to the Inner Product Problem (2009) (0)
Lecture Notes, Fall 2009 (2009) (0)

This paper list is powered by the following services:

Other Resources About Amit Chakrabarti

en.wikipedia.org

What Schools Are Affiliated With Amit Chakrabarti?

Amit Chakrabarti is affiliated with the following schools: