| No. |
Title |
Author |
Year |
| 1 |
Lifting to Parity Decision Trees via Stifling |
Chattopadhyay, Arkadev et al. |
2023 |
| 2 |
Query Complexity of Search Problems |
Chattopadhyay, Arkadev et al. |
2023 |
| 3 |
Monotone Complexity of Spanning Tree Polynomial Re-Visited |
Chattopadhyay, Arkadev et al. |
2022 |
| 4 |
Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product |
Chattopadhyay, Arkadev et al. |
2022 |
| 5 |
Symmetry and Quantum Query-To-Communication Simulation |
Chakraborty, Sourav et al. |
2022 |
| 6 |
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture |
Chattopadhyay, Arkadev et al. |
2021 |
| 7 |
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead |
Chakraborty, Sourav et al. |
2020 |
| 8 |
Equality Alone Does not Simulate Randomness |
Chattopadhyay, Arkadev et al. |
2019 |
| 9 |
Front Matter, Table of Contents, Preface, Conference Organization |
Chattopadhyay, Arkadev et al. |
2019 |
| 10 |
LIPIcs, Volume 150, FSTTCS'19, Complete Volume |
Chattopadhyay, Arkadev et al. |
2019 |
| 11 |
Query-To-Communication Lifting for BPP Using Inner Product |
Chattopadhyay, Arkadev et al. |
2019 |
| 12 |
A Lifting Theorem with Applications to Symmetric Functions |
Chattopadhyay, Arkadev et al. |
2018 |
| 13 |
Lower Bounds for Elimination via Weak Regularity |
Chattopadhyay, Arkadev et al. |
2017 |
| 14 |
Tribes Is Hard in the Message Passing Model |
Chattopadhyay, Arkadev et al. |
2015 |
| 15 |
The Power of Super-logarithmic Number of Players |
Chattopadhyay, Arkadev et al. |
2014 |
| 16 |
Graph Isomorphism is not AC^0 reducible to Group Isomorphism |
Chattopadhyay, Arkadev et al. |
2010 |
