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