| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Improved Sublinear-Time Edit Distance for Preprocessed Strings | Bringmann, Karl et al. | 2022 |
| 2 | Fast n-Fold Boolean Convolution via Additive Combinatorics | Bringmann, Karl et al. | 2021 |
| 3 | On the Approximability of Multistage Min-Sum Set Cover | Fotakis, Dimitris et al. | 2021 |
| 4 | Deterministic Sparse Fourier Transform with an ?_{∞} Guarantee | Li, Yi et al. | 2020 |
| 5 | Deterministic Heavy Hitters with Sublinear Query Time | Li, Yi et al. | 2018 |
| 6 | Improved Algorithms for Adaptive Compressed Sensing | Nakos, Vasileios et al. | 2018 |
| 7 | On Low-Risk Heavy Hitters and Sparse Recovery Schemes | Li, Yi et al. | 2018 |
| 8 | On Fast Decoding of High-Dimensional Signals from One-Bit Measurements | Nakos, Vasileios | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |