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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI