No. Title Author Year
1 Online Directed Spanners and Steiner Forests Grigorescu, Elena et al. 2021
2 Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree Chandrasekaran, Karthekeyan et al. 2020
3 Locally Decodable/Correctable Codes for Insertions and Deletions Block, Alexander R. et al. 2020
4 The Maximum Binary Tree Problem Chandrasekaran, Karthekeyan et al. 2020
5 Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels Blocki, Jeremiah et al. 2018
6 Flipping out with Many Flips: Hardness of Testing k-Monotonicity Grigorescu, Elena et al. 2018
7 Lattice-based Locality Sensitive Hashing is Optimal Chandrasekaran, Karthekeyan et al. 2018
8 Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows Braverman, Vladimir et al. 2018
9 Streaming for Aibohphobes: Longest Palindrome with Mismatches Grigorescu, Elena et al. 2018
10 Streaming Periodicity with Mismatches Ergün, Funda et al. 2017
11 Testing k-Monotonicity Canonne, Clément L. et al. 2017
12 AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product Cheraghchi, Mahdi et al. 2016
13 Local Testing for Membership in Lattices Chandrasekaran, Karthekeyan et al. 2016
14 Deciding Orthogonality in Construction-A Lattices Chandrasekaran, Karthekeyan et al. 2015
15 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: 15


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