Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Arkadev Chattopadhyay
Observed names:
Arkadev Chattopadhyay A,
Chattopadhyay, Arkadev
Institution:
Tata Institute of Fundamental Research
Observed institutions:
Tata Institute of Fundamental Research,
Centrum Wiskunde & Informatica,
University of Toronto,
Institute for Advanced Study,
QuSoft,
Max Planck Institute for Informatics,
TIFR Centre for Interdisciplinary Sciences,
Microsoft Research (India),
McGill University
show all 9
ORCID:
0009-0005-3110-3584
Observed ORCID:
0009-0005-3110-3584
OpenAlex ID:
A5088854880
Works
93
Awards
3
Multiparty Communication Complexity of Disjointness
2008
·
Chattopadhyay, Arkadev
, Ada, Anil
·
arXiv (Cornell University)
·
90
PDF
The story of set disjointness
2010
·
Arkadev Chattopadhyay
, Toniann Pitassi
·
ACM SIGACT News
·
72
The Log-Approximate-Rank Conjecture Is False
2019
·
Arkadev Chattopadhyay
, Nikhil S. Mande
, et al.
·
Journal of the ACM
·
49
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
2007
·
Arkadev Chattopadhyay
·
Annual Symposium on Foundations of Computer Science
·
47
Query-to-Communication Lifting Using Low-Discrepancy Gadgets
2021
·
Arkadev Chattopadhyay
, Yuval Filmus
, et al.
·
SIAM Journal on Computing
·
38
PDF
Simulation Theorems via Pseudo-random Properties
2019
·
Arkadev Chattopadhyay
, Michal Koucký
, et al.
·
Computational Complexity
·
35
PDF
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
2013
·
Arkadev Chattopadhyay
, Jacobo Torán
, et al.
·
ACM Transactions on Computation Theory
·
35
PDF
Equality Alone Does not Simulate Randomness
2019
·
Chattopadhyay, Arkadev
, Lovett, Shachar
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
34
PDF
Topology Matters in Communication
2014
·
Arkadev Chattopadhyay
, Jaikumar Radhakrishnan
, et al.
·
Annual Symposium on Foundations of Computer Science
·
34
Lower bounds for circuits with MOD_m gates
2006
·
Arkadev Chattopadhyay
, Navin Goyal
, et al.
·
Annual Symposium on Foundations of Computer Science
·
31
Simulation beats richness: new data-structure lower bounds
2018
·
Arkadev Chattopadhyay
, Michal Koucký
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
25
Query-To-Communication Lifting for BPP Using Inner Product
2019
·
Chattopadhyay, Arkadev
, Filmus, Yuval
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
23
PDF
Lifting to Parity Decision Trees via Stifling
2022
·
Chattopadhyay, Arkadev
, Mande, Nikhil S.
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
22
PDF
The NOF Multiparty Communication Complexity of Composed Functions
2014
·
Anil Ada
, Arkadev Chattopadhyay
, et al.
·
Computational Complexity
·
20
Circuits, communication and polynomials
2008
·
Chattopadhyay, Arkadev
·
19
Lower Bounds for Circuits with Few Modular and Symmetric Gates
2005
·
Arkadev Chattopadhyay
, Kristoffer Arnsfelt Hansen
·
Lecture notes in computer science
·
17
Linear Systems over Composite Moduli
2009
·
Arkadev Chattopadhyay
, Avi Wigderson
·
Annual Symposium on Foundations of Computer Science
·
16
Lower bounds for monotone arithmetic circuits via communication complexity
2021
·
Arkadev Chattopadhyay
, Rajit Datta
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
15
The Hardness of Being Private
2012
·
Anil Ada
, Arkadev Chattopadhyay
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
15
A Little Advice Can Be Very Helpful
2012
·
Arkadev Chattopadhyay
, Jeff Edmonds
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
15
Exponential Separation Between Powers of Regular and General Resolution Over Parities
2024
·
Bhattacharya, Sreejata Kishor
, Chattopadhyay, Arkadev
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
14
PDF
A Short List of Equalities Induces Large Sign Rank
2018
·
Arkadev Chattopadhyay
, Nikhil Mande
·
Annual Symposium on Foundations of Computer Science
·
14
Factoring bivariate lacunary polynomials without heights
2013
·
Arkadev Chattopadhyay
, Bruno Grenet
, et al.
·
International Symposium on Symbolic and Algebraic Computation
·
14
PDF
The Range of Topological Effects on Communication
2015
·
Arkadev Chattopadhyay
, Atri Rudra
·
Lecture notes in computer science
·
13
Randomized versus Deterministic Decision Tree Size
2023
·
Arkadev Chattopadhyay
, Yogesh Dahiya
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
12
PDF
Show more works
View as search
Works count:
93
Citation count:
943
H-index:
16
I10-index:
30
Year
Topic
Type