| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Interactive Proofs for Verifying Machine Learning | Goldwasser, Shafi et al. | 2021 |
| 2 | Shadows of Newton Polytopes | Hrubeš, Pavel et al. | 2021 |
| 3 | Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits | Hrubes, Pavel et al. | 2019 |
| 4 | On Weak epsilon-Nets and the Radon Number | Moran, Shay et al. | 2019 |
| 5 | On the Communication Complexity of Key-Agreement Protocols | Haitner, Iftach et al. | 2018 |
| 6 | On Isoperimetric Profiles and Computational Complexity | Hrubes, Pavel et al. | 2016 |
| 7 | Internal Compression of Protocols to Entropy | Bauer, Balthazar et al. | 2015 |
| 8 | Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness | Rao, Anup et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |