No. Title Author Year
1 Noisy Boolean Hidden Matching with Applications Kapralov, Michael et al. 2022
2 On the Security of Proofs of Sequential Work in a Post-Quantum World Blocki, Jeremiah et al. 2021
3 Sensitivity Analysis of the Maximum Matching Problem Yoshida, Yuichi et al. 2021
4 Separations for Estimating Large Frequency Moments on Data Streams Woodruff, David P. et al. 2021
5 Approximating Cumulative Pebbling Cost Is Unique Games Hard Blocki, Jeremiah et al. 2020
6 Computationally Data-Independent Memory Hard Functions Ameri, Mohammad Hassan et al. 2020
7 On Locally Decodable Codes in Resource Bounded Channels Blocki, Jeremiah et al. 2020
8 Approximate F_2-Sketching of Valuation Functions Yaroslavtsev, Grigory et al. 2019
9 Improved Algorithms for Time Decay Streams Braverman, Vladimir et al. 2019
10 Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels Blocki, Jeremiah et al. 2018
11 Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows Braverman, Vladimir et al. 2018
12 Streaming for Aibohphobes: Longest Palindrome with Mismatches Grigorescu, Elena et al. 2018
13 Streaming Periodicity with Mismatches Erg√ľn, Funda et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 13


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