No. Title Author Year
1 On the Hardness of Set Disjointness and Set Intersection with Bounded Universe Goldstein, Isaac et al. 2019
2 A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance Kopelowitz, Tsvi et al. 2018
3 Improved Space-Time Tradeoffs for kSUM Goldstein, Isaac et al. 2018
4 Quasi-Periodicity Under Mismatch Errors Amir, Amihood et al. 2018
5 Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams Golan, Shay et al. 2018
6 Approximate Cover of Strings Amir, Amihood et al. 2017
7 Orthogonal Vectors Indexing Goldstein, Isaac et al. 2017
8 Real-Time Streaming Multi-Pattern Search for Constant Alphabet Golan, Shay et al. 2017
9 Simultaneously Load Balancing for Every p-norm, With Reassignments Bernstein, Aaron et al. 2017
10 Distance Labeling Schemes for Trees Alstrup, Stephen et al. 2016
11 How Hard is it to Find (Honest) Witnesses? Goldstein, Isaac et al. 2016
12 Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap Amir, Amihood et al. 2016
13 New Parameterized Algorithms for APSP in Directed Graphs Porat, Ely et al. 2016
14 Streaming Pattern Matching with d Wildcards Golan, Shay et al. 2016
15 Sublinear Distance Labeling Alstrup, Stephen et al. 2016
16 Succinct Online Dictionary Matching with Improved Worst-Case Guarantees Kopelowitz, Tsvi et al. 2016
17 Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion Ngo, Hung Q. et al. 2012
18 Exponential Space Improvement for minwise Based Algorithms Feigenblat, Guy et al. 2012
19 Explicit Non-Adaptive Combinatorial Group Testing Schemes Porat, Ely et al. 2009
20 Pattern matching with don't cares and few errors Clifford, Raphael et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 20


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