( en | de | ru )

 

Disambiguation of "Chattopadhyay, Arkadev"

Author of the publication

copydeleteadd this publication to your clipboard
Lower Bounds for Elimination via Weak Regularity.

, , , , and . Electron. Colloquium Comput. Complex., (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anupam Chattopadhyay

Dhrupadi Chattopadhyay

Renate Chattopadhyay

Shamita Chattopadhyay

Sibylle Chattopadhyay

 

Other publications of authors with the same name

Simulation Beats Richness: New Data-Structure Lower Bounds., , , and . Electron. Colloquium Comput. Complex., (2017)Weights at the Bottom Matter When the Top is Heavy., and . Electron. Colloquium Comput. Complex., (2017)Graph Isomorphism is not AC^0 reducible to Group Isomorphism., , and . Electron. Colloquium Comput. Complex., (2010)The NOF Multiparty Communication Complexity of Composed Functions., , , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 13-24. Springer, (2012)Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020)., , , and . SIAM J. Comput., 51 (3): 20- (June 2022)Tribes Is Hard in the Message Passing Model., and . STACS, volume 30 of LIPIcs, page 224-237. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Lower bounds for circuits with MOD_m gates., , , and . FOCS, page 709-718. IEEE Computer Society, (2006)Lower Bounds on Interactive Compressibility by Constant-Depth Circuits., and . FOCS, page 619-628. IEEE Computer Society, (2012)Tribes Is Hard in the Message Passing Model., and . CoRR, (2016)The story of set disjointness., and . SIGACT News, 41 (3): 59-85 (2010)