Matan Kraus

According to our database, Matan Kraus authored at least 10 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Deterministic Longest Common Subsequence Approximation in Near-Linear Time.

Itai Boneh, Shay Golan, Matan Kraus

CoRR, July, 2025

Fully Dynamic LZ77 in Sublinear Time.

Itai Boneh, Matan Kraus

CoRR, February, 2025

String Problems in the Congested Clique Model.

Shay Golan, Matan Kraus

Proceedings of the 36th Annual Symposium on Combinatorial Pattern Matching, 2025

2024

Hamming Distance Oracle.

Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus

CoRR, 2024

Searching 2D-Strings for Matching Frames.

Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Adrian Miclaus, Arseny M. Shur

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

Hairpin Completion Distance Lower Bound.

Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023

String Factorization via Prefix Free Families.

Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2020

An O(log^3/2n) Parallel Time Population Protocol for Majority with O(log n) States.

Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat

CoRR, 2020

An <i>O</i>(log^3/2 <i>n</i>) Parallel Time Population Protocol for Majority with <i>O</i>(log <i>n</i>) States.

Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Time-Space Tradeoffs for Finding a Long Common Substring.

Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, Matan Kraus

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020