No. Title Author Year
1 A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance Kopelowitz, Tsvi et al. 2018
2 Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams Golan, Shay et al. 2018
3 Simultaneously Load Balancing for Every p-norm, With Reassignments Bernstein, Aaron et al. 2017
4 The Online House Numbering Problem: Min-Max Online List Labeling Devanny, William E. et al. 2017
5 Color-Distance Oracles and Snippets Kopelowitz, Tsvi et al. 2016
6 Faster Worst Case Deterministic Dynamic Connectivity Kejlberg-Rasmussen, Casper et al. 2016
7 How Hard is it to Find (Honest) Witnesses? Goldstein, Isaac et al. 2016
8 Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap Amir, Amihood et al. 2016
9 Streaming Pattern Matching with d Wildcards Golan, Shay et al. 2016
10 Succinct Online Dictionary Matching with Improved Worst-Case Guarantees Kopelowitz, Tsvi et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 10


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