Amit Chakrabarti

Artificial Intelligence · 2010–2016

A researcher in the Science corpus: 3 papers; trusts 4 researchers and is trusted by 35 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 8 citations into it; #5,005 of 35,345 by trust here, #14,181 by citations
• Computational Theory and Mathematics — 6 citations into it; #911 of 12,182 by trust here, #2,689 by citations

Whom Amit Chakrabarti trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. David P. Woodruff
2. Keith Ball
3. Alexander A. Razborov
4. Robert M. Gray
5. William T. Gowers
6. Ben Green
7. Li-Yang Tan

Who trusts Amit Chakrabarti overall

1. Thomas Watson
2. Sudipto Guha
3. Jayadev Acharya
4. Eric Balkanski
5. David P. Woodruff
6. Joan Feigenbaum
7. Alexandr Andoni
8. Atish Das Sarma
9. Leighton Pate Barnes
10. Andrew McGregor

Papers from Amit Chakrabarti's perspective

Ordered by how strongly the researchers Amit Chakrabarti trusts endorse each paper. Same corpus, a different order for every researcher.

1. Optimal space lower bounds for all frequency moments
2. Tight bounds for distributed functional monitoring
3. The communication requirements of efficient allocations and supporting prices (Journal of Economics Theory)
4. An Elementary Introduction to Modern Convex Geometry
5. Communication Complexity
6. Entropy and Information Theory
7. Quantum communication complexity of symmetric predicates
8. A theory of the learnable
9. The Probabilistic Method
10. Reductions in streaming algorithms, with an application to counting triangles in graphs (ACM-SIAM Symposium on Discrete Algorithms)

Their papers

• Communication Complexity (2016) — 1,331 citations
• An optimal lower bound on the communication complexity of gap-hamming-distance (2010) — 189 citations
• Beyond set disjointness: the communication complexity of finding the intersection (2014) — 35 citations