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

An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States. - Stav Ben-Nun; Tsvi Kopelowitz; Matan Kraus; Ely Porat (PODC, 2020)

An O(log3/2n) Parallel Time Population Protocol for Majority with O(log n) States. - Stav Ben-Nun; Tsvi Kopelowitz; Matan Kraus; Ely Porat (CoRR, 2020)

String Factorization via Prefix Free Families. - Matan Kraus; Moshe Lewenstein; Alexandru Popa 001; Ely Porat; Yonathan Sadia (CPM, 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)

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

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

Fully Dynamic LZ77 in Sublinear Time. - Itai Boneh; Matan Kraus (CoRR, 2025)

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