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

1 |
Finding the KT Partition of a Weighted Graph in Near-Linear Time |
Apers, Simon et al. |
2022 |

2 |
On the Cut Dimension of a Graph |
Lee, Troy et al. |
2021 |

3 |
Quantum Complexity of Minimum Cut |
Apers, Simon et al. |
2021 |

4 |
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity |
Gavinsky, Dmitry et al. |
2019 |

5 |
Bounding Quantum-Classical Separations for Classes of Nonlocal Games |
Bannink, Tom et al. |
2019 |

6 |
Two New Results About Quantum Exact Learning |
Arunachalam, Srinivasan et al. |
2019 |

7 |
A Composition Theorem for Randomized Query Complexity |
Anshu, Anurag et al. |
2018 |

8 |
Strategies for Quantum Races |
Lee, Troy et al. |
2018 |

9 |
Separating Quantum Communication and Approximate Rank |
Anshu, Anurag et al. |
2017 |

10 |
On the Sum-of-Squares Degree of Symmetric Quadratic Functions |
Lee, Troy et al. |
2016 |

11 |
Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks (Dagstuhl Seminar 15082) |
Klauck, Hartmut et al. |
2015 |

12 |
The Cover Number of a Matrix and its Algorithmic Applications |
Alon, Noga et al. |
2014 |

13 |
Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082) |
Beasley, LeRoy B. et al. |
2013 |

14 |
New bounds on the classical and quantum communication complexity of some graph properties |
Ivanyos, GĂˇbor et al. |
2012 |

15 |
Approximation norms and duality for communication complexity lower bounds |
Lee, Troy et al. |
2008 |