Real-Time Streaming Multi-Pattern Search for Constant Alphabet. - Shay Golan 001; Ely Porat (ESA, 2017)

Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams. - Shay Golan 001; Tsvi Kopelowitz; Ely Porat (ICALP, 2018)

Dynamic Dictionary Matching in the Online Model. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (WADS, 2019)

Streaming Pattern Matching with d Wildcards. - Shay Golan 001; Tsvi Kopelowitz; Ely Porat (Algorithmica, 2019)

Improved Circular k-Mismatch Sketches. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Przemyslaw Uznanski (APPROX-RANDOM, 2020)

The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (CPM, 2020)

Time-Space Tradeoffs for Finding a Long Common Substring. - Stav Ben-Nun; Shay Golan 001; Tomasz Kociumaka; Matan Kraus (CPM, 2020)

Locally Consistent Parsing for Text Indexing in Small Space. - Or Birenzwige; Shay Golan 001; Ely Porat (SODA, 2020)

Approximating text-to-pattern Hamming distances. - Timothy M. Chan; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (STOC, 2020)

An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (SODA, 2022)

Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings. - Itai Boneh; Shay Golan 001; Shay Mozes; Oren Weimann (CoRR, 2023)

Hairpin Completion Distance Lower Bound. - Itai Boneh; Dvir Fried; Shay Golan 001; Matan Kraus (CPM, 2024)

Searching 2D-Strings for Matching Frames. - Itai Boneh; Dvir Fried; Shay Golan 001; Matan Kraus; Adrian Miclaus; Arseny M. Shur (CPM, 2024)

String 2-Covers with No Length Restrictions. - Itai Boneh; Shay Golan 001; Arseny M. Shur (ESA, 2024)

Õptimal Dynamic Time Warping on Run-Length Encoded Strings. - Itai Boneh; Shay Golan 001; Shay Mozes; Oren Weimann (ICALP, 2024)

Burst Edit Distance. - Itai Boneh; Shay Golan 001; Avivit Levy; Ely Porat; B. Riva Shalom (SPIRE, 2024)

Hamming Distance Oracle. - Itai Boneh; Dvir Fried; Shay Golan 001; Matan Kraus (CoRR, 2024)

An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (ACM Trans. Algorithms, 2024)

String Problems in the Congested Clique Model. - Shay Golan 001; Matan Kraus (CPM, 2025)

Covers in Optimal Space. - Itai Boneh; Shay Golan 001 (CPM, 2025)

Faster Construction of a Planar Distance Oracle with Õ(1) Query Time. - Itai Boneh; Shay Golan 001; Shay Mozes; Daniel Prigan; Oren Weimann (ICALP, 2025)

Expected Density of Random Minimizers. - Shay Golan 001; Arseny M. Shur (SOFSEM (1), 2025)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. - Itai Boneh; Shiri Chechik; Shay Golan 001; Shay Mozes; Oren Weimann (STOC, 2025)

Deterministic Longest Common Subsequence Approximation in Near-Linear Time. - Itai Boneh; Shay Golan 001; Matan Kraus (CoRR, 2025)