No. Title Author Year
1 Recovery from Non-Decomposable Distance Oracles Hu, Zhuangfei et al. 2023
2 Adaptive Sketches for Robust Regression with Importance Sampling Mahabadi, Sepideh et al. 2022
3 An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes Baweja, Anubhav et al. 2022
4 Front Matter, Table of Contents, Preface, Conference Organization Bojańczyk, Mikołaj et al. 2022
5 LIPIcs, Volume 229, ICALP 2022, Complete Volume Bojańczyk, Mikołaj et al. 2022
6 Noisy Boolean Hidden Matching with Applications Kapralov, Michael et al. 2022
7 Streaming Algorithms with Large Approximation Factors Li, Yi et al. 2022
8 A Simple Proof of a New Set Disjointness with Applications to Data Streams Kamath, Akshay et al. 2021
9 A Very Sketchy Talk (Invited Talk) Woodruff, David P. 2021
10 Separations for Estimating Large Frequency Moments on Data Streams Woodruff, David P. et al. 2021
11 Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation Musco, Cameron et al. 2021
12 The Product of Gaussian Matrices Is Close to Gaussian Li, Yi et al. 2021
13 Graph Spanners in the Message-Passing Model Fernández V, Manuel et al. 2020
14 Pseudo-Deterministic Streaming Goldwasser, Shafi et al. 2020
15 Streaming Complexity of SVMs Andoni, Alexandr et al. 2020
16 Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems Rashtchian, Cyrus et al. 2020
17 Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams Bakshi, Ainesh et al. 2020
18 Querying a Matrix Through Matrix-Vector Products Sun, Xiaoming et al. 2019
19 Robust Communication-Optimal Distributed Clustering Algorithms Awasthi, Pranjal et al. 2019
20 Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams Woodruff, David P. et al. 2019
21 The One-Way Communication Complexity of Dynamic Time Warping Distance Braverman, Vladimir et al. 2019
22 The Query Complexity of Mastermind with l_p Distances Fernández V, Manuel et al. 2019
23 Towards Optimal Moment Estimation in Streaming and Distributed Models Jayaram, Rajesh et al. 2019
24 High Probability Frequency Moment Sketches Ganguly, Sumit et al. 2018
25 Improved Algorithms for Adaptive Compressed Sensing Nakos, Vasileios et al. 2018
26 Matrix Completion and Related Problems via Strong Duality Balcan, Maria-Florina et al. 2018
27 Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows Braverman, Vladimir et al. 2018
28 On Low-Risk Heavy Hitters and Sparse Recovery Schemes Li, Yi et al. 2018
29 On Sketching the q to p Norms Krishnan, Aditya et al. 2018
30 Revisiting Frequency Moment Estimation in Random Order Streams Braverman, Vladimir et al. 2018
31 Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness Musco, Cameron et al. 2018
32 Embeddings of Schatten Norms with Applications to Data Streams Li, Yi et al. 2017
33 Fast Regression with an $ell_infty$ Guarantee Price, Eric et al. 2017
34 Sharper Bounds for Regularized Data Fitting Avron, Haim et al. 2017
35 Sketching for Geometric Problems (Invited Talk) Woodruff, David P. 2017
36 Theory and Applications of Hashing (Dagstuhl Seminar 17181) Dietzfelbinger, Martin et al. 2017
37 New Algorithms for Heavy Hitters in Data Streams (Invited Talk) Woodruff, David P. 2016
38 New Characterizations in Turnstile Streams with Applications Ai, Yuqing et al. 2016
39 Optimal Approximate Matrix Product in Terms of Stable Rank Cohen, Michael B. et al. 2016
40 Stochastic Streams: Sample Complexity vs. Space Complexity Crouch, Michael et al. 2016
41 Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings Li, Yi et al. 2016
42 Tight Bounds for Graph Problems in Insertion Streams Sun, Xiaoming et al. 2015
43 Certifying Equality With Limited Interaction Brody, Joshua et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 43

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