No. Title Author Year
1 Graph Spanners in the Message-Passing Model Fernández V, Manuel et al. 2020
2 Pseudo-Deterministic Streaming Goldwasser, Shafi et al. 2020
3 Streaming Complexity of SVMs Andoni, Alexandr et al. 2020
4 Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems Rashtchian, Cyrus et al. 2020
5 Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams Bakshi, Ainesh et al. 2020
6 Querying a Matrix Through Matrix-Vector Products Sun, Xiaoming et al. 2019
7 Robust Communication-Optimal Distributed Clustering Algorithms Awasthi, Pranjal et al. 2019
8 Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams Woodruff, David P. et al. 2019
9 The One-Way Communication Complexity of Dynamic Time Warping Distance Braverman, Vladimir et al. 2019
10 The Query Complexity of Mastermind with l_p Distances Fernández V, Manuel et al. 2019
11 Towards Optimal Moment Estimation in Streaming and Distributed Models Jayaram, Rajesh et al. 2019
12 High Probability Frequency Moment Sketches Ganguly, Sumit et al. 2018
13 Improved Algorithms for Adaptive Compressed Sensing Nakos, Vasileios et al. 2018
14 Matrix Completion and Related Problems via Strong Duality Balcan, Maria-Florina et al. 2018
15 Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows Braverman, Vladimir et al. 2018
16 On Low-Risk Heavy Hitters and Sparse Recovery Schemes Li, Yi et al. 2018
17 On Sketching the q to p Norms Krishnan, Aditya et al. 2018
18 Revisiting Frequency Moment Estimation in Random Order Streams Braverman, Vladimir et al. 2018
19 Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness Musco, Cameron et al. 2018
20 Embeddings of Schatten Norms with Applications to Data Streams Li, Yi et al. 2017
21 Fast Regression with an $ell_infty$ Guarantee Price, Eric et al. 2017
22 Sharper Bounds for Regularized Data Fitting Avron, Haim et al. 2017
23 Sketching for Geometric Problems (Invited Talk) Woodruff, David P. 2017
24 Theory and Applications of Hashing (Dagstuhl Seminar 17181) Dietzfelbinger, Martin et al. 2017
25 New Algorithms for Heavy Hitters in Data Streams (Invited Talk) Woodruff, David P. 2016
26 New Characterizations in Turnstile Streams with Applications Ai, Yuqing et al. 2016
27 Optimal Approximate Matrix Product in Terms of Stable Rank Cohen, Michael B. et al. 2016
28 Stochastic Streams: Sample Complexity vs. Space Complexity Crouch, Michael et al. 2016
29 Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings Li, Yi et al. 2016
30 Tight Bounds for Graph Problems in Insertion Streams Sun, Xiaoming et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 31


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI