Shay Golan

Orcid: 0000-0001-8357-2802

Affiliations:
  • Reichman University, Israel
  • Haifa University, Israel
  • Bar Ilan University, Ramat Gan, Israel (former)


According to our database1, Shay Golan authored at least 18 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Improved Algorithm for The <i>k</i>-Dyck Edit Distance Problem.
ACM Trans. Algorithms, July, 2024

Hamming Distance Oracle.
CoRR, 2024

Burst Edit Distance.
Proceedings of the String Processing and Information Retrieval, 2024

Õptimal Dynamic Time Warping on Run-Length Encoded Strings.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

String 2-Covers with No Length Restrictions.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Searching 2D-Strings for Matching Frames.
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

Hairpin Completion Distance Lower Bound.
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023
Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings.
CoRR, 2023

2022
An Improved Algorithm for The k-Dyck Edit Distance Problem.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2020
Approximating text-to-pattern Hamming distances.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Locally Consistent Parsing for Text Indexing in Small Space.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Time-Space Tradeoffs for Finding a Long Common Substring.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Improved Circular k-Mismatch Sketches.
Proceedings of the Approximation, 2020

2019
Streaming Pattern Matching with d Wildcards.
Algorithmica, 2019

Dynamic Dictionary Matching in the Online Model.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018
Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Real-Time Streaming Multi-Pattern Search for Constant Alphabet.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017


  Loading...