Scholar
Shay Golan
Google Scholar ID: TAkhWJ8AAAAJ
Postdoc, EECS, University of California, Berkeley
Citations & Impact
Citations
167
H-index
8
i10-index
8
Publications
20
Co-authors
12
list available
Contact
Publications
Resume (English only)
Academic Achievements
- 2026: The Complexity of Dynamic LZ77 is Θ˜(n^{2/3})
- 2025: Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
- 2025: Faster Construction of a Planar Distance Oracle with Õ(1) Query Time
- 2025: GreedyMini: Generating low-density DNA minimizers
- 2025: Covers in Optimal Space
- 2025: String Problems in the Congested Clique Model
- 2025: Expected Density of Random Minimizers
- 2024: String 2-Covers with No Length Restrictions
- 2024: Õptimal Dynamic Time Warping on Run-Length Encoded Strings
- 2024: Searching 2D-Strings for Matching Frames
- 2024: Hairpin Completion Distance Lower Bound
- 2024: Burst Edit Distance
- 2022: An Improved Algorithm for The k-Dyck Edit Distance Problem
- 2020: Improved Circular k-Mismatch Sketches
- 2020: Approximating text-to-pattern Hamming distances
- 2020: The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time
- 2020: Time-Space Tradeoffs for Finding a Long Common Substring
Research Experience
- Postdoctoral researcher at Reichman and Haifa Universities, hosted by Shay Mozes and Oren Weimann; Fulbright Postdoctoral Fellow at the EECS department of the University of California, Berkeley, hosted by Jelani Nelson.
Education
- Ph.D. in Computer Science from Bar-Ilan University, advised by Ely Porat and Tsvi Kopelowitz.
Background
- Senior Lecturer (aka Assistant Professor), with research interests in string algorithms, data structures, graph algorithms, and other discrete algorithms. Main research area is string algorithms, focusing on streaming, small space, and dynamic settings.
