| No. |
Title |
Author |
Year |
| 1 |
Dynamic Graph Algorithms (Dagstuhl Seminar 22461) |
Bernstein, Aaron et al. |
2023 |
| 2 |
Incremental Edge Orientation in Forests |
Bender, Michael A. et al. |
2021 |
| 3 |
Improved Circular k-Mismatch Sketches |
Golan, Shay et al. |
2020 |
| 4 |
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time |
Golan, Shay et al. |
2020 |
| 5 |
Towards Optimal Set-Disjointness and Set-Intersection Data Structures |
Kopelowitz, Tsvi et al. |
2020 |
| 6 |
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance |
Kopelowitz, Tsvi et al. |
2018 |
| 7 |
Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams |
Golan, Shay et al. |
2018 |
| 8 |
Simultaneously Load Balancing for Every p-norm, With Reassignments |
Bernstein, Aaron et al. |
2017 |
| 9 |
The Online House Numbering Problem: Min-Max Online List Labeling |
Devanny, William E. et al. |
2017 |
| 10 |
Color-Distance Oracles and Snippets |
Kopelowitz, Tsvi et al. |
2016 |
| 11 |
Faster Worst Case Deterministic Dynamic Connectivity |
Kejlberg-Rasmussen, Casper et al. |
2016 |
| 12 |
How Hard is it to Find (Honest) Witnesses? |
Goldstein, Isaac et al. |
2016 |
| 13 |
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap |
Amir, Amihood et al. |
2016 |
| 14 |
Streaming Pattern Matching with d Wildcards |
Golan, Shay et al. |
2016 |
| 15 |
Succinct Online Dictionary Matching with Improved Worst-Case Guarantees |
Kopelowitz, Tsvi et al. |
2016 |
