| No. |
Title |
Author |
Year |
| 1 |
String Factorization via Prefix Free Families |
Kraus, Matan et al. |
2023 |
| 2 |
Partial Permutations Comparison, Maintenance and Applications |
Levy, Avivit et al. |
2022 |
| 3 |
Incremental Edge Orientation in Forests |
Bender, Michael A. et al. |
2021 |
| 4 |
Improved Circular k-Mismatch Sketches |
Golan, Shay et al. |
2020 |
| 5 |
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time |
Golan, Shay et al. |
2020 |
| 6 |
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe |
Goldstein, Isaac et al. |
2019 |
| 7 |
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance |
Kopelowitz, Tsvi et al. |
2018 |
| 8 |
Improved Space-Time Tradeoffs for kSUM |
Goldstein, Isaac et al. |
2018 |
| 9 |
Quasi-Periodicity Under Mismatch Errors |
Amir, Amihood et al. |
2018 |
| 10 |
Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams |
Golan, Shay et al. |
2018 |
| 11 |
Approximate Cover of Strings |
Amir, Amihood et al. |
2017 |
| 12 |
Orthogonal Vectors Indexing |
Goldstein, Isaac et al. |
2017 |
| 13 |
Real-Time Streaming Multi-Pattern Search for Constant Alphabet |
Golan, Shay et al. |
2017 |
| 14 |
Simultaneously Load Balancing for Every p-norm, With Reassignments |
Bernstein, Aaron et al. |
2017 |
| 15 |
Distance Labeling Schemes for Trees |
Alstrup, Stephen et al. |
2016 |
| 16 |
How Hard is it to Find (Honest) Witnesses? |
Goldstein, Isaac et al. |
2016 |
| 17 |
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap |
Amir, Amihood et al. |
2016 |
| 18 |
New Parameterized Algorithms for APSP in Directed Graphs |
Porat, Ely et al. |
2016 |
| 19 |
Streaming Pattern Matching with d Wildcards |
Golan, Shay et al. |
2016 |
| 20 |
Sublinear Distance Labeling |
Alstrup, Stephen et al. |
2016 |
| 21 |
Succinct Online Dictionary Matching with Improved Worst-Case Guarantees |
Kopelowitz, Tsvi et al. |
2016 |
| 22 |
Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion |
Ngo, Hung Q. et al. |
2012 |
| 23 |
Exponential Space Improvement for minwise Based Algorithms |
Feigenblat, Guy et al. |
2012 |
| 24 |
Explicit Non-Adaptive Combinatorial Group Testing Schemes |
Porat, Ely et al. |
2009 |
| 25 |
Pattern matching with don't cares and few errors |
Clifford, Raphael et al. |
2009 |
