No. Title Author Year
1 Approximating Cumulative Pebbling Cost Is Unique Games Hard Blocki, Jeremiah et al. 2020
2 Computationally Data-Independent Memory Hard Functions Ameri, Mohammad Hassan et al. 2020
3 On Locally Decodable Codes in Resource Bounded Channels Blocki, Jeremiah et al. 2020
4 Approximate F_2-Sketching of Valuation Functions Yaroslavtsev, Grigory et al. 2019
5 Improved Algorithms for Time Decay Streams Braverman, Vladimir et al. 2019
6 Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels Blocki, Jeremiah et al. 2018
7 Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows Braverman, Vladimir et al. 2018
8 Streaming for Aibohphobes: Longest Palindrome with Mismatches Grigorescu, Elena et al. 2018
9 Streaming Periodicity with Mismatches Erg√ľn, Funda et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 9


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