No. Title Author Year
1 Differentially Private Aggregation via Imperfect Shuffling Ghazi, Badih et al. 2023
2 How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity Blocki, Jeremiah et al. 2023
3 Private Data Stream Analysis for Universal Symmetric Norm Estimation Braverman, Vladimir et al. 2023
4 Adaptive Sketches for Robust Regression with Importance Sampling Mahabadi, Sepideh et al. 2022
5 Noisy Boolean Hidden Matching with Applications Kapralov, Michael et al. 2022
6 On the Security of Proofs of Sequential Work in a Post-Quantum World Blocki, Jeremiah et al. 2021
7 Sensitivity Analysis of the Maximum Matching Problem Yoshida, Yuichi et al. 2021
8 Separations for Estimating Large Frequency Moments on Data Streams Woodruff, David P. et al. 2021
9 Approximating Cumulative Pebbling Cost Is Unique Games Hard Blocki, Jeremiah et al. 2020
10 Computationally Data-Independent Memory Hard Functions Ameri, Mohammad Hassan et al. 2020
11 On Locally Decodable Codes in Resource Bounded Channels Blocki, Jeremiah et al. 2020
12 Approximate F_2-Sketching of Valuation Functions Yaroslavtsev, Grigory et al. 2019
13 Improved Algorithms for Time Decay Streams Braverman, Vladimir et al. 2019
14 Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels Blocki, Jeremiah et al. 2018
15 Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows Braverman, Vladimir et al. 2018
16 Streaming for Aibohphobes: Longest Palindrome with Mismatches Grigorescu, Elena et al. 2018
17 Streaming Periodicity with Mismatches Erg√ľn, Funda et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 17


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