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

1 |
Querying a Matrix Through Matrix-Vector Products |
Sun, Xiaoming et al. |
2019 |

2 |
Robust Communication-Optimal Distributed Clustering Algorithms |
Awasthi, Pranjal et al. |
2019 |

3 |
Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams |
Woodruff, David P. et al. |
2019 |

4 |
The One-Way Communication Complexity of Dynamic Time Warping Distance |
Braverman, Vladimir et al. |
2019 |

5 |
The Query Complexity of Mastermind with l_p Distances |
Fernández V, Manuel et al. |
2019 |

6 |
Towards Optimal Moment Estimation in Streaming and Distributed Models |
Jayaram, Rajesh et al. |
2019 |

7 |
High Probability Frequency Moment Sketches |
Ganguly, Sumit et al. |
2018 |

8 |
Improved Algorithms for Adaptive Compressed Sensing |
Nakos, Vasileios et al. |
2018 |

9 |
Matrix Completion and Related Problems via Strong Duality |
Balcan, Maria-Florina et al. |
2018 |

10 |
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows |
Braverman, Vladimir et al. |
2018 |