| No. |
Title |
Author |
Year |
| 1 |
Karchmer-Wigderson Games for Hazard-Free Computation |
Ikenmeyer, Christian et al. |
2023 |
| 2 |
On the Composition of Randomized Query Complexity and Approximate Degree |
Chakraborty, Sourav et al. |
2023 |
| 3 |
Rabbits Approximate, Cows Compute Exactly! |
Komarath, Balagopal et al. |
2022 |
| 4 |
Tight Lower Bounds for Approximate & Exact k-Center in ℝ^d |
Chitnis, Rajesh et al. |
2022 |
| 5 |
Algebraic Branching Programs, Border Complexity, and Tangent Spaces |
Bläser, Markus et al. |
2020 |
| 6 |
Improved Bounds on Fourier Entropy and Min-Entropy |
Arunachalam, Srinivasan et al. |
2020 |
| 7 |
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity |
Chakraborty, Diptarka et al. |
2018 |
| 8 |
Homomorphism Polynomials Complete for VP |
Durand, Arnaud et al. |
2014 |
