No. Title Author Year
1 Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels Blocki, Jeremiah et al. 2018
2 Flipping out with Many Flips: Hardness of Testing k-Monotonicity Grigorescu, Elena et al. 2018
3 Lattice-based Locality Sensitive Hashing is Optimal Chandrasekaran, Karthekeyan et al. 2018
4 Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows Braverman, Vladimir et al. 2018
5 Streaming for Aibohphobes: Longest Palindrome with Mismatches Grigorescu, Elena et al. 2018
6 Streaming Periodicity with Mismatches Ergün, Funda et al. 2017
7 Testing k-Monotonicity Canonne, Clément L. et al. 2017
8 AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product Cheraghchi, Mahdi et al. 2016
9 Local Testing for Membership in Lattices Chandrasekaran, Karthekeyan et al. 2016
10 Deciding Orthogonality in Construction-A Lattices Chandrasekaran, Karthekeyan et al. 2015
11 Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation Chen, Victor et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 11


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