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

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