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

1 |
A Simple Proof of a New Set Disjointness with Applications to Data Streams |
Kamath, Akshay et al. |
2021 |

2 |
A Very Sketchy Talk (Invited Talk) |
Woodruff, David P. |
2021 |

3 |
Separations for Estimating Large Frequency Moments on Data Streams |
Woodruff, David P. et al. |
2021 |

4 |
Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation |
Musco, Cameron et al. |
2021 |

5 |
The Product of Gaussian Matrices Is Close to Gaussian |
Li, Yi et al. |
2021 |

6 |
Graph Spanners in the Message-Passing Model |
Fernández V, Manuel et al. |
2020 |

7 |
Pseudo-Deterministic Streaming |
Goldwasser, Shafi et al. |
2020 |

8 |
Streaming Complexity of SVMs |
Andoni, Alexandr et al. |
2020 |

9 |
Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems |
Rashtchian, Cyrus et al. |
2020 |

10 |
Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams |
Bakshi, Ainesh et al. |
2020 |

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

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

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

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

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

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

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

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

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

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

21 |
On Low-Risk Heavy Hitters and Sparse Recovery Schemes |
Li, Yi et al. |
2018 |

22 |
On Sketching the q to p Norms |
Krishnan, Aditya et al. |
2018 |

23 |
Revisiting Frequency Moment Estimation in Random Order Streams |
Braverman, Vladimir et al. |
2018 |

24 |
Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness |
Musco, Cameron et al. |
2018 |

25 |
Embeddings of Schatten Norms with Applications to Data Streams |
Li, Yi et al. |
2017 |

26 |
Fast Regression with an $ell_infty$ Guarantee |
Price, Eric et al. |
2017 |

27 |
Sharper Bounds for Regularized Data Fitting |
Avron, Haim et al. |
2017 |

28 |
Sketching for Geometric Problems (Invited Talk) |
Woodruff, David P. |
2017 |

29 |
Theory and Applications of Hashing (Dagstuhl Seminar 17181) |
Dietzfelbinger, Martin et al. |
2017 |

30 |
New Algorithms for Heavy Hitters in Data Streams (Invited Talk) |
Woodruff, David P. |
2016 |