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


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