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


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