No. Title Author Year
1 Adaptive Sketches for Robust Regression with Importance Sampling Mahabadi, Sepideh et al. 2022
2 An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes Baweja, Anubhav et al. 2022
3 Front Matter, Table of Contents, Preface, Conference Organization Bojańczyk, Mikołaj et al. 2022
4 LIPIcs, Volume 229, ICALP 2022, Complete Volume Bojańczyk, Mikołaj et al. 2022
5 Noisy Boolean Hidden Matching with Applications Kapralov, Michael et al. 2022
6 Streaming Algorithms with Large Approximation Factors Li, Yi et al. 2022
7 A Simple Proof of a New Set Disjointness with Applications to Data Streams Kamath, Akshay et al. 2021
8 A Very Sketchy Talk (Invited Talk) Woodruff, David P. 2021
9 Separations for Estimating Large Frequency Moments on Data Streams Woodruff, David P. et al. 2021
10 Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation Musco, Cameron et al. 2021
11 The Product of Gaussian Matrices Is Close to Gaussian Li, Yi et al. 2021
12 Graph Spanners in the Message-Passing Model Fernández V, Manuel et al. 2020
13 Pseudo-Deterministic Streaming Goldwasser, Shafi et al. 2020
14 Streaming Complexity of SVMs Andoni, Alexandr et al. 2020
15 Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems Rashtchian, Cyrus et al. 2020
16 Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams Bakshi, Ainesh et al. 2020
17 Querying a Matrix Through Matrix-Vector Products Sun, Xiaoming et al. 2019
18 Robust Communication-Optimal Distributed Clustering Algorithms Awasthi, Pranjal et al. 2019
19 Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams Woodruff, David P. et al. 2019
20 The One-Way Communication Complexity of Dynamic Time Warping Distance Braverman, Vladimir et al. 2019
21 The Query Complexity of Mastermind with l_p Distances Fernández V, Manuel et al. 2019
22 Towards Optimal Moment Estimation in Streaming and Distributed Models Jayaram, Rajesh et al. 2019
23 High Probability Frequency Moment Sketches Ganguly, Sumit et al. 2018
24 Improved Algorithms for Adaptive Compressed Sensing Nakos, Vasileios et al. 2018
25 Matrix Completion and Related Problems via Strong Duality Balcan, Maria-Florina et al. 2018
26 Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows Braverman, Vladimir et al. 2018
27 On Low-Risk Heavy Hitters and Sparse Recovery Schemes Li, Yi et al. 2018
28 On Sketching the q to p Norms Krishnan, Aditya et al. 2018
29 Revisiting Frequency Moment Estimation in Random Order Streams Braverman, Vladimir et al. 2018
30 Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness Musco, Cameron et al. 2018
Current Page :
Number of result pages: 2
Number of documents: 42

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