Arkadev Chattopadhyay

I am a Ph.D student in Computer Science at McGill University. My supervisor is Prof. Denis ThÃ©rien

University of Toronto

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers58 papers

Sort

By YearBy Citation

Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead

Sourav Chakraborty,Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar

CCC, (2020)

EIBibtex

Lower bounds for linear decision lists

Arkadev Chattopadhyay,Meena Mahajan, Nikhil S. Mande,Nitin Saurabh

Chicago J. Theor. Comput. Sci., (2020): 7

EIBibtex

Symmetry and Quantum Query-to-Communication Simulation

Sourav Chakraborty,Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar,Ronald de Wolf

Bibtex

The Log-Approximate-Rank Conjecture Is False

Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif

J. ACM, no. 4 (2020): 1-28

EIBibtex

Computing the multilinear factors of lacunary polynomials without heights

Arkadev Chattopadhyay,Bruno Grenet,Pascal Koiran,Natacha Portier,Yann Strozecki

J. Symb. Comput., (2020): 183-206

EIBibtex

Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture

Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif

Electron. Colloquium Comput. Complex., (2020): 132

Bibtex

Lower Bounds for Linear Decision Lists

Arkadev Chattopadhyay,Meena Mahajan, Nikhil S. Mande,Nitin Saurabh

Electronic Colloquium on Computational Complexity (ECCC), (2019): 7

EIBibtex

Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead

Sourav Chakraborty,Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar

Electron. Colloquium Comput. Complex., (2019): 136

Bibtex

Simulation Theorems via Pseudorandom Properties

Arkadev Chattopadhyay,Michal Koucký,Bruno Loff,Sagnik Mukhopadhyay

computational complexity, no. 4 (2019): 617-659

Cited by19EIBibtex

Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead

Sourav Chakraborty,Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar

Electronic Colloquium on Computational Complexity (ECCC), (2019): 136

EIBibtex

Query-to-Communication Lifting Using Low-Discrepancy Gadgets

Arkadev Chattopadhyay,Yuval Filmus, Sajin Koroth,Or Meir,Toniann Pitassi

Electronic Colloquium on Computational Complexity (ECCC), (2019): 103

EIBibtex

Query-to-communication lifting for BPP using inner product

Arkadev Chattopadhyay,Yuval Filmus,Sajin Koroth,Or Meir,Toniann Pitassi

ICALP, (2019)

Cited by3EIBibtex

Equality Alone Does Not Simulate Randomness

Arkadev Chattopadhyay,Shachar Lovett,Marc Vinyals

Leibniz International Proceedings in Informatics, (2019): 206

Cited by1EIBibtex

The Log-Approximate-Rank Conjecture is False

Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif

Electronic Colloquium on Computational Complexity (ECCC), (2018): 42-53

Cited by11EIBibtex

Simulation Beats Richness: New Data-Structure Lower Bounds

Arkadev Chattopadhyay,Michal Koucký,Bruno Loff,Sagnik Mukhopadhyay

STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 20..., pp.1013-1020, (2018)

Cited by9EIBibtex

Separation of Unbounded-Error Models in Multi-Party Communication Complexity

Arkadev Chattopadhyay, Nikhil S. Mande

Theory of Computing, no. 1 (2018): 1-23

EIBibtex

A Short List of Equalities Induces Large Sign Rank

Arkadev Chattopadhyay, Nikhil S. Mande

2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp.47.0-58, (2018)

Cited by6EIBibtex

Dual polynomials and communication complexity of XOR functions

Arkadev Chattopadhyay, Nikhil S. Mande

Electronic Colloquium on Computational Complexity (ECCC), (2017)

Cited by2EIBibtex

Tight Network Topology Dependent Bounds on Rounds of Communication

Arkadev Chattopadhyay,Michael Langberg,Shi Li,Atri Rudra

SODA, pp.2524-2539, (2017)

Cited by1EIBibtex

Dual polynomials and communication complexity of $\textsf{XOR}$ functions

Arkadev Chattopadhyay, Nikhil S. Mande

arXiv: Computational Complexity, (2017)

Bibtex

View All

Base Info Papers Patents Projects

Arkadev ChattopadhyayBinding

Papers58 papers

Arkadev Chattopadhyay