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

1 |
Average Whenever You Meet: Opportunistic Protocols for Community Detection |
Becchetti, Luca et al. |
2018 |

2 |
Dimension Reduction for Polynomials over Gaussian Space and Applications |
Ghazi, Badih et al. |
2018 |

3 |
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs |
Manurangsi, Pasin et al. |
2017 |

4 |
On the Bit Complexity of Sum-of-Squares Proofs |
Raghavendra, Prasad et al. |
2017 |

5 |
Real Stability Testing |
Raghavendra, Prasad et al. |
2017 |

6 |
Correlation Decay and Tractability of CSPs |
Brown-Cohen, Jonah et al. |
2016 |

7 |
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree |
Barak, Boaz et al. |
2015 |

8 |
Gap Amplification for Small-Set Expansion via Random Walks |
Raghavendra, Prasad et al. |
2014 |