| No. |
Title |
Author |
Year |
| 1 |
Is Untrusted Randomness Helpful? |
Girish, Uma et al. |
2023 |
| 2 |
Eliminating Intermediate Measurements Using Pseudorandom Generators |
Girish, Uma et al. |
2022 |
| 3 |
Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs |
Girish, Uma et al. |
2022 |
| 4 |
Block Rigidity: Strong Multiplayer Parallel Repetition Implies Super-Linear Lower Bounds for Turing Machines |
Mittal, Kunal et al. |
2021 |
| 5 |
Lower Bounds for XOR of Forrelations |
Girish, Uma et al. |
2021 |
| 6 |
Memory-Sample Lower Bounds for Learning Parity with Noise |
Garg, Sumegha et al. |
2021 |
| 7 |
Parallel Repetition for the GHZ Game: A Simpler Proof |
Girish, Uma et al. |
2021 |
| 8 |
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm |
Girish, Uma et al. |
2021 |
| 9 |
Quantum Versus Randomized Communication Complexity, with Efficient Players |
Girish, Uma et al. |
2021 |
| 10 |
The Random-Query Model and the Memory-Bounded Coupon Collector |
Raz, Ran et al. |
2020 |
| 11 |
Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich’s PRG |
Garg, Sumegha et al. |
2020 |
| 12 |
Time-Space Lower Bounds for Two-Pass Learning |
Garg, Sumegha et al. |
2019 |
| 13 |
A Candidate for a Strong Separation of Information and Communication |
Braverman, Mark et al. |
2018 |
| 14 |
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols |
Tauman Kalai, Yael et al. |
2018 |
| 15 |
Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers |
Raz, Ran |
2016 |
| 16 |
LIPIcs, Volume 50, CCC'16, Complete Volume |
Raz, Ran |
2016 |
| 17 |
Space Pseudorandom Generators by Communication Complexity Lower Bounds |
Ganor, Anat et al. |
2014 |
| 18 |
Two Sides of the Coin Problem |
Cohen, Gil et al. |
2014 |
