| No. |
Title |
Author |
Year |
| 1 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111) |
Gál, Anna et al. |
2023 |
| 2 |
Front Matter, Table of Contents, Preface, Conference Organization |
Mahajan, Meena et al. |
2023 |
| 3 |
LIPIcs, Volume 271, SAT 2023, Complete Volume |
Mahajan, Meena et al. |
2023 |
| 4 |
Query Complexity of Search Problems |
Chattopadhyay, Arkadev et al. |
2023 |
| 5 |
QBF Merge Resolution Is Powerful but Unnatural |
Mahajan, Meena et al. |
2022 |
| 6 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121) |
Gál, Anna et al. |
2021 |
| 7 |
On (Simple) Decision Tree Rank |
Dahiya, Yogesh et al. |
2021 |
| 8 |
Algebraic Branching Programs, Border Complexity, and Tangent Spaces |
Bläser, Markus et al. |
2020 |
| 9 |
Hard QBFs for Merge Resolution |
Beyersdorff, Olaf et al. |
2020 |
| 10 |
SAT and Interactions (Dagstuhl Seminar 20061) |
Beyersdorff, Olaf et al. |
2020 |
| 11 |
Building Strategies into QBF Proofs |
Beyersdorff, Olaf et al. |
2019 |
| 12 |
Lower Bound Techniques for QBF Proof Systems |
Mahajan, Meena |
2018 |
| 13 |
Arithmetic Circuits: An Overview (Invited Talk) |
Mahajan, Meena |
2017 |
| 14 |
Computing the Maximum using (min, +) Formulas |
Mahajan, Meena et al. |
2017 |
| 15 |
Are Short Proofs Narrow? QBF Resolution is not Simple |
Beyersdorff, Olaf et al. |
2016 |
| 16 |
Circuits, Logic and Games (Dagstuhl Seminar 15401) |
Bojanczyk, Mikolaj et al. |
2016 |
| 17 |
Understanding Cutting Planes for QBFs |
Beyersdorff, Olaf et al. |
2016 |
| 18 |
Homomorphism Polynomials Complete for VP |
Durand, Arnaud et al. |
2014 |
| 19 |
LIPIcs, Volume 8, FSTTCS'10, Complete Volume |
Lodaya, Kamal et al. |
2013 |
| 20 |
Frontmatter, Table of Contents, Preface, Conference Organization, Author Index |
Lodaya, Kamal et al. |
2010 |
| 21 |
Small space analogues of Valiant's classes and the limitations of skew formula |
Mahajan, Meena et al. |
2010 |
