default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArkadev Chattopadhyay
Person information
- affiliation: Tata Institute of Fundamental Research, School of Technology and Computer Science
- affiliation: University of Toronto, Department of Computer Science
- affiliation: Institute for Advanced Study, School of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c38]Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorák:
Exponential Separation Between Powers of Regular and General Resolution over Parities. CCC 2024: 23:1-23:32- [i49]Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorák:
Exponential Separation Between Powers of Regular and General Resolution Over Parities. CoRR abs/2402.04364 (2024) - [i48]Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorak:
Exponential Separation Between Powers of Regular and General Resolution Over Parities. Electron. Colloquium Comput. Complex. TR24 (2024) - [i47]Arkadev Chattopadhyay, Pavel Dvorak:
Super-critical Trade-offs in Resolution over Parities Via Lifting. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c37]Arkadev Chattopadhyay, Nikhil S. Mande
, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees via Stifling. ITCS 2023: 33:1-33:20 - [c36]Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan:
Query Complexity of Search Problems. MFCS 2023: 34:1-34:15 - [c35]Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal:
Randomized versus Deterministic Decision Tree Size. STOC 2023: 867-880 - [i46]Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan:
Query Complexity of Search Problems. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j16]Arkadev Chattopadhyay, Marek Cygan, Noga Ron-Zewi, Christian Wulff-Nilsen:
Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020). SIAM J. Comput. 51(3): 20- (2022) - [j15]Arkadev Chattopadhyay, Nikhil S. Mande:
A Short List of Equalities Induces Large Sign-Rank. SIAM J. Comput. 51(3): 820-848 (2022) - [c34]Arkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay:
Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product. FSTTCS 2022: 12:1-12:20 - [c33]Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay:
Monotone Complexity of Spanning Tree Polynomial Re-Visited. ITCS 2022: 39:1-39:21 - [c32]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf:
Symmetry and Quantum Query-To-Communication Simulation. STACS 2022: 20:1-20:23 - [i45]Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees Via Stifling. CoRR abs/2211.17214 (2022) - [i44]Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal:
Randomized versus Deterministic Decision Tree Size. Electron. Colloquium Comput. Complex. TR22 (2022) - [i43]Arkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay:
Robustly Separating the Arithmetic Monotone Hierarchy Via Graph Inner-Product. Electron. Colloquium Comput. Complex. TR22 (2022) - [i42]Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees Via Stifling. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j14]Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Computing the multilinear factors of lacunary polynomials without heights. J. Symb. Comput. 104: 183-206 (2021) - [j13]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-Communication Lifting Using Low-Discrepancy Gadgets. SIAM J. Comput. 50(1): 171-210 (2021) - [c31]Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif:
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. FSTTCS 2021: 13:1-13:16 - [c30]Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay:
Lower bounds for monotone arithmetic circuits via communication complexity. STOC 2021: 786-799 - [i41]Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay:
Monotone Complexity of Spanning Tree Polynomial Re-visited. CoRR abs/2109.06941 (2021) - 2020
- [j12]Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower bounds for linear decision lists. Chic. J. Theor. Comput. Sci. 2020 (2020) - [j11]Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif:
The Log-Approximate-Rank Conjecture Is False. J. ACM 67(4): 23:1-23:28 (2020) - [c29]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead. CCC 2020: 32:1-32:15 - [i40]Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif:
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. CoRR abs/2009.02717 (2020) - [i39]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf:
Symmetry and Quantum Query-to-Communication Simulation. CoRR abs/2012.05233 (2020) - [i38]Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay:
Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity. Electron. Colloquium Comput. Complex. TR20 (2020) - [i37]Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay:
Negations Provide Strongly Exponential Savings. Electron. Colloquium Comput. Complex. TR20 (2020) - [i36]Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif:
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j10]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Simulation Theorems via Pseudo-random Properties. Comput. Complex. 28(4): 617-659 (2019) - [c28]Arkadev Chattopadhyay, Shachar Lovett, Marc Vinyals:
Equality Alone Does not Simulate Randomness. CCC 2019: 14:1-14:11 - [c27]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-To-Communication Lifting for BPP Using Inner Product. ICALP 2019: 35:1-35:15 - [c26]Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif:
The log-approximate-rank conjecture is false. STOC 2019: 42-53 - [e1]Arkadev Chattopadhyay, Paul Gastin:
39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, December 11-13, 2019, Bombay, India. LIPIcs 150, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-131-3 [contents] - [i35]Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower Bounds for Linear Decision Lists. CoRR abs/1901.05911 (2019) - [i34]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-communication lifting for BPP using inner product. CoRR abs/1904.13056 (2019) - [i33]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. CoRR abs/1909.10428 (2019) - [i32]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. Electron. Colloquium Comput. Complex. TR19 (2019) - [i31]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-Communication Lifting Using Low-Discrepancy Gadgets. Electron. Colloquium Comput. Complex. TR19 (2019) - [i30]Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower Bounds for Linear Decision Lists. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j9]Arkadev Chattopadhyay, Nikhil S. Mande:
Separation of Unbounded-Error Models in Multi-Party Communication Complexity. Theory Comput. 14(1): 1-23 (2018) - [c25]Arkadev Chattopadhyay, Nikhil S. Mande:
A Short List of Equalities Induces Large Sign Rank. FOCS 2018: 47-58 - [c24]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Simulation beats richness: new data-structure lower bounds. STOC 2018: 1013-1020 - [i29]Arkadev Chattopadhyay, Shachar Lovett, Marc Vinyals:
Equality Alone Does Not Simulate Randomness. Electron. Colloquium Comput. Complex. TR18 (2018) - [i28]Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif:
The Log-Approximate-Rank Conjecture is False. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c23]Arkadev Chattopadhyay, Nikhil S. Mande:
A Lifting Theorem with Applications to Symmetric Functions. FSTTCS 2017: 23:1-23:14 - [c22]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. SODA 2017: 2524-2539 - [c21]Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Lower Bounds for Elimination via Weak Regularity. STACS 2017: 21:1-21:14 - [i27]Arkadev Chattopadhyay, Nikhil S. Mande:
Dual polynomials and communication complexity of XOR functions. CoRR abs/1704.02537 (2017) - [i26]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Simulation Theorems via Pseudorandom Properties. CoRR abs/1704.06807 (2017) - [i25]Arkadev Chattopadhyay, Nikhil S. Mande:
Weights at the Bottom Matter When the Top is Heavy. CoRR abs/1705.02397 (2017) - [i24]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Composition and Simulation Theorems via Pseudo-random Properties. Electron. Colloquium Comput. Complex. TR17 (2017) - [i23]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Simulation Beats Richness: New Data-Structure Lower Bounds. Electron. Colloquium Comput. Complex. TR17 (2017) - [i22]Arkadev Chattopadhyay, Nikhil S. Mande:
Dual polynomials and communication complexity of XOR functions. Electron. Colloquium Comput. Complex. TR17 (2017) - [i21]Arkadev Chattopadhyay, Nikhil S. Mande:
Weights at the Bottom Matter When the Top is Heavy. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j8]Arkadev Chattopadhyay, Frederic Green, Howard Straubing:
Circuit Complexity of Powering in Fields of Odd Characteristic. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j7]Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi:
Upper and Lower Bounds on the Power of Advice. SIAM J. Comput. 45(4): 1412-1432 (2016) - [i20]Arkadev Chattopadhyay, Sagnik Mukhopadhyay:
Tribes Is Hard in the Message Passing Model. CoRR abs/1602.06079 (2016) - [i19]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. CoRR abs/1608.03313 (2016) - [i18]Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Lower Bounds for Elimination via Weak Regularity. Electron. Colloquium Comput. Complex. TR16 (2016) - [i17]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. Electron. Colloquium Comput. Complex. TR16 (2016) - [i16]Arkadev Chattopadhyay, Nikhil S. Mande:
Small Error Versus Unbounded Error Protocols in the NOF Model. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j6]Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen:
The NOF Multiparty Communication Complexity of Composed Functions. Comput. Complex. 24(3): 645-694 (2015) - [c20]Arkadev Chattopadhyay, Atri Rudra:
The Range of Topological Effects on Communication. ICALP (2) 2015: 540-551 - [c19]Arkadev Chattopadhyay, Sagnik Mukhopadhyay:
Tribes Is Hard in the Message Passing Model. STACS 2015: 224-237 - [i15]Arkadev Chattopadhyay, Atri Rudra:
The Range of Topological Effects on Communication. CoRR abs/1504.06602 (2015) - 2014
- [j5]Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien:
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. Theory Comput. Syst. 55(2): 404-420 (2014) - [j4]Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi:
The Hardness of Being Private. ACM Trans. Comput. Theory 6(1): 1:1-1:24 (2014) - [c18]Arkadev Chattopadhyay, Michael E. Saks:
The Power of Super-logarithmic Number of Players. APPROX-RANDOM 2014: 596-603 - [c17]Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra:
Topology Matters in Communication. FOCS 2014: 631-640 - [i14]Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra:
Topology matters in communication. Electron. Colloquium Comput. Complex. TR14 (2014) - [i13]Arkadev Chattopadhyay, Michael E. Saks:
The Power of Super-logarithmic Number of Players. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j3]Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner:
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism. ACM Trans. Comput. Theory 5(4): 13:1-13:13 (2013) - [c16]Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Factoring bivariate lacunary polynomials without heights. ISSAC 2013: 141-148 - [c15]James Martens, Arkadev Chattopadhyay, Toniann Pitassi, Richard S. Zemel:
On the Expressive Power of Restricted Boltzmann Machines. NIPS 2013: 2877-2885 - [i12]Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Computing the multilinear factors of lacunary polynomials without heights. CoRR abs/1311.5694 (2013) - 2012
- [c14]Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi:
The Hardness of Being Private. CCC 2012: 192-202 - [c13]Arkadev Chattopadhyay, Rahul Santhanam:
Lower Bounds on Interactive Compressibility by Constant-Depth Circuits. FOCS 2012: 619-628 - [c12]Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen:
The NOF Multiparty Communication Complexity of Composed Functions. ICALP (1) 2012: 13-24 - [c11]Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi:
A little advice can be very helpful. SODA 2012: 615-625 - [i11]Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Factoring bivariate lacunary polynomials without heights. CoRR abs/1206.4224 (2012) - [i10]Arkadev Chattopadhyay, Rahul Santhanam:
Lower Bounds on Interactive Compressibility by Constant-Depth Circuits. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c10]Arkadev Chattopadhyay, Shachar Lovett:
Linear Systems over Finite Abelian Groups. CCC 2011: 300-308 - [c9]Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien:
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. CSR 2011: 29-42 - [i9]Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen:
The NOF Multiparty Communication Complexity of Composed Functions. Electron. Colloquium Comput. Complex. TR11 (2011) - [i8]Arkadev Chattopadhyay, Shachar Lovett:
Linear systems over abelian groups. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j2]Arkadev Chattopadhyay:
Multilinear Polynomials Modulo Composites. Bull. EATCS 100: 52-77 (2010) - [j1]Arkadev Chattopadhyay, Toniann Pitassi:
The story of set disjointness. SIGACT News 41(3): 59-85 (2010) - [c8]Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner:
Graph Isomorphism is not AC^0 reducible to Group Isomorphism. FSTTCS 2010: 317-326 - [i7]Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner:
Graph Isomorphism is not AC^0 reducible to Group Isomorphism. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c7]Arkadev Chattopadhyay, Avi Wigderson:
Linear Systems over Composite Moduli. FOCS 2009: 43-52 - [i6]Arkadev Chattopadhyay, Avi Wigderson:
Linear systems over composite moduli. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [i5]Arkadev Chattopadhyay, Anil Ada:
Multiparty Communication Complexity of Disjointness. CoRR abs/0801.3624 (2008) - [i4]Arkadev Chattopadhyay, Anil Ada:
Multiparty Communication Complexity of Disjointness. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c6]Arkadev Chattopadhyay, Bruce A. Reed:
Properly 2-Colouring Linear Hypergraphs. APPROX-RANDOM 2007: 395-408 - [c5]Arkadev Chattopadhyay:
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits. FOCS 2007: 449-458 - [c4]Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien:
Languages with Bounded Multiparty Communication Complexity. STACS 2007: 500-511 - [i3]Arkadev Chattopadhyay:
Discrepancy and the power of bottom fan-in in depth-three circuits. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c3]Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien:
Lower bounds for circuits with MOD_m gates. FOCS 2006: 709-718 - [i2]Arkadev Chattopadhyay:
An improved bound on correlation between polynomials over Z_m and MOD_q. Electron. Colloquium Comput. Complex. TR06 (2006) - [i1]Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien:
Languages with Bounded Multiparty Communication Complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c2]Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen:
Lower Bounds for Circuits with Few Modular and Symmetric Gates. ICALP 2005: 994-1005 - 2003
- [c1]Arkadev Chattopadhyay, Denis Thérien:
Locally Commutative Categories. ICALP 2003: 984-995
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-29 00:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
