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

1 |
Is Untrusted Randomness Helpful? |
Girish, Uma et al. |
2023 |

2 |
Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs |
Girish, Uma et al. |
2022 |

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

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

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

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

7 |
Odd Yao-Yao Graphs are Not Spanners |
Jin, Yifei et al. |
2018 |

8 |
k-Regret Minimizing Set: Efficient Algorithms and Hardness |
Cao, Wei et al. |
2017 |

9 |
Almost All Even Yao-Yao Graphs Are Spanners |
Li, Jian et al. |
2016 |