No. |
Title |
Author |
Year |
---|

1 |
Eliminating Intermediate Measurements Using Pseudorandom Generators |
Girish, Uma et al. |
2022 |

2 |
Block Rigidity: Strong Multiplayer Parallel Repetition Implies Super-Linear Lower Bounds for Turing Machines |
Mittal, Kunal et al. |
2021 |

3 |
Lower Bounds for XOR of Forrelations |
Girish, Uma et al. |
2021 |

4 |
Memory-Sample Lower Bounds for Learning Parity with Noise |
Garg, Sumegha et al. |
2021 |

5 |
Parallel Repetition for the GHZ Game: A Simpler Proof |
Girish, Uma et al. |
2021 |

6 |
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm |
Girish, Uma et al. |
2021 |

7 |
Quantum Versus Randomized Communication Complexity, with Efficient Players |
Girish, Uma et al. |
2021 |

8 |
The Random-Query Model and the Memory-Bounded Coupon Collector |
Raz, Ran et al. |
2020 |

9 |
Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreichâ€™s PRG |
Garg, Sumegha et al. |
2020 |

10 |
Time-Space Lower Bounds for Two-Pass Learning |
Garg, Sumegha et al. |
2019 |

11 |
A Candidate for a Strong Separation of Information and Communication |
Braverman, Mark et al. |
2018 |

12 |
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols |
Tauman Kalai, Yael et al. |
2018 |

13 |
Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers |
Raz, Ran |
2016 |

14 |
LIPIcs, Volume 50, CCC'16, Complete Volume |
Raz, Ran |
2016 |

15 |
Space Pseudorandom Generators by Communication Complexity Lower Bounds |
Ganor, Anat et al. |
2014 |

16 |
Two Sides of the Coin Problem |
Cohen, Gil et al. |
2014 |