No. Title Author Year
1 Cubic Formula Size Lower Bounds Based on Compositions with Majority Gál, Anna et al. 2018
2 New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity Chaubal, Siddhesh et al. 2018
3 Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121) Gál, Anna et al. 2017
4 Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121) Gal, Anna et al. 2014
5 Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length Gal, Anna et al. 2011
6 Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity Ford, Jeff et al. 2006
7 Incremental branching programs Gál, Anna et al. 2006
8 The Cell Probe Complexity of Succinct Data Structures Gál, Anna et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 8


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