Arkadev Chattopadhyay
TitleCited byYear
Multiparty communication complexity of disjointness
A Chattopadhyay, A Ada
arXiv preprint arXiv:0801.3624, 2008
Discrepancy and the power of bottom fan-in in depth-three circuits
A Chattopadhyay
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 449-458, 2007
On the representational efficiency of restricted boltzmann machines
J Martens, A Chattopadhya, T Pitassi, R Zemel
Advances in Neural Information Processing Systems, 2877-2885, 2013
The story of set disjointness
A Chattopadhyay, T Pitassi
ACM SIGACT News 41 (3), 59-85, 2010
The hardness of being private
A Ada, A Chattopadhyay, SA Cook, L Fontes, M Koucký, T Pitassi
ACM Transactions on Computation Theory (TOCT) 6 (1), 1-24, 2014
Lower bounds for circuits with MOD_m gates
A Chattopadhyay, N Goyal, P Pudlak, D Therien
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
Topology matters in communication
A Chattopadhyay, J Radhakrishnan, A Rudra
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 631-640, 2014
Circuits, communication and polynomials
A Chattopadhyay
McGill University, 2009
Simulation Theorems via Pseudo-random Properties
A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay
computational complexity 28 (4), 617-659, 2019
The NOF multiparty communication complexity of composed functions
A Ada, A Chattopadhyay, O Fawzi, P Nguyen
computational complexity 24 (3), 645-694, 2015
Lower bounds for circuits with few modular and symmetric gates
A Chattopadhyay, KA Hansen
International Colloquium on Automata, Languages, and Programming, 994-1005, 2005
Graph isomorphism is not AC0-reducible to group isomorphism
A Chattopadhyay, J Torán, F Wagner
ACM Transactions on Computation Theory (TOCT) 5 (4), 1-13, 2013
Linear systems over composite moduli
A Chattopadhyay, A Wigderson
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 43-52, 2009
Lower bounds on interactive compressibility by constant-depth circuits
A Chattopadhyay, R Santhanam
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 619-628, 2012
A little advice can be very helpful
A Chattopadhyay, J Edmonds, F Ellen, T Pitassi
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
Factoring bivariate lacunary polynomials without heights
A Chattopadhyay, B Grenet, P Koiran, N Portier, Y Strozecki
Proceedings of the 38th International Symposium on Symbolic and Algebraic …, 2013
Languages with bounded multiparty communication complexity
A Chattopadhyay, A Krebs, M Koucký, M Szegedy, P Tesson, D Thérien
Annual Symposium on Theoretical Aspects of Computer Science, 500-511, 2007
The log-approximate-rank conjecture is false
A Chattopadhyay, NS Mande, S Sherif
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Tribes is hard in the message passing model
A Chattopadhyay, S Mukhopadhyay
arXiv preprint arXiv:1602.06079, 2016
The power of super-logarithmic number of players
A Chattopadhyay, ME Saks
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
The system can't perform the operation now. Try again later.
Articles 1–20