| No. |
Title |
Author |
Year |
| 1 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111) |
Gál, Anna et al. |
2023 |
| 2 |
On the Composition of Randomized Query Complexity and Approximate Degree |
Chakraborty, Sourav et al. |
2023 |
| 3 |
Counting and Sampling from Substructures Using Linear Algebraic Queries |
Bishnu, Arijit et al. |
2022 |
| 4 |
Separations Between Combinatorial Measures for Transitive Functions |
Chakraborty, Sourav et al. |
2022 |
| 5 |
Symmetry and Quantum Query-To-Communication Simulation |
Chakraborty, Sourav et al. |
2022 |
| 6 |
Query Complexity of Global Minimum Cut |
Bishnu, Arijit et al. |
2021 |
| 7 |
Tight Chang’s-Lemma-Type Bounds for Boolean Functions |
Chakraborty, Sourav et al. |
2021 |
| 8 |
Disjointness Through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond |
Bhattacharya, Anup et al. |
2020 |
| 9 |
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead |
Chakraborty, Sourav et al. |
2020 |
| 10 |
Two New Results About Quantum Exact Learning |
Arunachalam, Srinivasan et al. |
2019 |
