No. Title Author Year
1 Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead Chakraborty, Sourav et al. 2020
2 Equality Alone Does not Simulate Randomness Chattopadhyay, Arkadev et al. 2019
3 Front Matter, Table of Contents, Preface, Conference Organization Chattopadhyay, Arkadev et al. 2019
4 LIPIcs, Volume 150, FSTTCS'19, Complete Volume Chattopadhyay, Arkadev et al. 2019
5 Query-To-Communication Lifting for BPP Using Inner Product Chattopadhyay, Arkadev et al. 2019
6 A Lifting Theorem with Applications to Symmetric Functions Chattopadhyay, Arkadev et al. 2018
7 Lower Bounds for Elimination via Weak Regularity Chattopadhyay, Arkadev et al. 2017
8 Tribes Is Hard in the Message Passing Model Chattopadhyay, Arkadev et al. 2015
9 The Power of Super-logarithmic Number of Players Chattopadhyay, Arkadev et al. 2014
10 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: 10


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