Arkadev Chattopadhyay
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
26
Venues
8
Active years
2003–2026
Best venue rank
A*
Where they publish
Papers
26 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STOC | Lower Bounds for Near-Quadratic-Depth Resolution over Parities. | Sreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay, Russell Impagliazzo |
| 2026 | STOC | Restriction Trees for Sparsity and Applications. | Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett |
| 2023 | MFCS | Query Complexity of Search Problems. | Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan |
| 2023 | STOC | Randomized versus Deterministic Decision Tree Size. | Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal |
| 2022 | STACS | Symmetry and Quantum Query-To-Communication Simulation. | Sourav Chakraborty, Arkadev Chattopadhyay, Peter Hyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf |
| 2021 | STOC | Lower bounds for monotone arithmetic circuits via communication complexity. | Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay |
| 2019 | ICALP | Query-To-Communication Lifting for BPP Using Inner Product. | Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi |
| 2019 | STOC | The log-approximate-rank conjecture is false. | Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif |
| 2018 | FOCS | A Short List of Equalities Induces Large Sign Rank. | Arkadev Chattopadhyay, Nikhil S. Mande |
| 2018 | STOC | Simulation beats richness: new data-structure lower bounds. | Arkadev Chattopadhyay, Michal Kouck, Bruno Loff, Sagnik Mukhopadhyay |
| 2017 | SODA | Tight Network Topology Dependent Bounds on Rounds of Communication. | Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra |
| 2017 | STACS | Lower Bounds for Elimination via Weak Regularity. | Arkadev Chattopadhyay, Pavel Dvork, Michal Kouck, Bruno Loff, Sagnik Mukhopadhyay |
| 2015 | ICALP | The Range of Topological Effects on Communication. | Arkadev Chattopadhyay, Atri Rudra |
| 2015 | STACS | Tribes Is Hard in the Message Passing Model. | Arkadev Chattopadhyay, Sagnik Mukhopadhyay |
| 2014 | FOCS | Topology Matters in Communication. | Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra |
| 2013 | ISSAC | Factoring bivariate lacunary polynomials without heights. | Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki |
| 2012 | FOCS | Lower Bounds on Interactive Compressibility by Constant-Depth Circuits. | Arkadev Chattopadhyay, Rahul Santhanam |
| 2012 | ICALP | The NOF Multiparty Communication Complexity of Composed Functions. | Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen |
| 2012 | SODA | A little advice can be very helpful. | Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi |
| 2011 | CSR | Learning Read-Constant Polynomials of Constant Degree Modulo Composites. | Arkadev Chattopadhyay, Ricard Gavald, Kristoffer Arnsfelt Hansen, Denis Thrien |
| 2009 | FOCS | Linear Systems over Composite Moduli. | Arkadev Chattopadhyay, Avi Wigderson |
| 2007 | FOCS | Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits. | Arkadev Chattopadhyay |
| 2007 | STACS | Languages with Bounded Multiparty Communication Complexity. | Arkadev Chattopadhyay, Andreas Krebs, Michal Kouck, Mario Szegedy, Pascal Tesson, Denis Thrien |
| 2006 | FOCS | Lower bounds for circuits with MOD_m gates. | Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlk, Denis Thrien |
| 2005 | ICALP | Lower Bounds for Circuits with Few Modular and Symmetric Gates. | Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen |
| 2003 | ICALP | Locally Commutative Categories. | Arkadev Chattopadhyay, Denis Thrien |