---

Summary

Founder and CEO at Deskfirst, where we build the world's easiest-to-use and fastest online collaboration workspace.

I obtained my PhD from the School of Computer Science at Tel Aviv University in 2020, where my advisor was Prof. Micha Sharir.
Here, you can find my dissertation: New Algorithms for Some Classical Problems in P (Abstract, Acknowledgements).
I recieved my M.Sc. in Computer Science (magna cum laude) from Bar-Ilan University,
and my B.Sc. in Mathematics and Computer Science from Ben Gurion University.

During my PhD studies I have worked on some of the core problems in the field of algorithm design, which yielded the following results.

1. The first subquadratic-time algorithm for computing Dynamic Time Warping between two point-sequences on the real line,
   breaking a 50 years old quadratic time barrier. This is the best-known algorithm for this well-known problem to date.
2. Improved algorithm and decision tree for the 3SUM problem (both were later further improved).
3. Proofs of the existence of various Diameter Spanners in directed graphs, and efficient algorithms to compute them.
4. The first strongly-polynomial subcubic-time algorithm for computing L_∞ Closest Pair of n points in Rⁿ.

Below, you can find the papers that include the results mentioned above, as well as additional papers.

---

Research

Research interests: Design and Analysis of Algorithms, Computational Geometry.

Publications

Omer Gold
PhD Dissertation: "New Algorithms for Some Classical Problems in P
Tel Aviv University, 2020.

Keerti Choudhary and Omer Gold
Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms
In Proc. of the 31st ACM-SIAM Symposium on Discrete Algorithms (SODA 2020).
Also in arXiv:1812.01602.

Omer Gold and Micha Sharir
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
ACM Transactions on Algorithms, Volume 14 Issue 4, October 2018 (TALG 2018)
Also in Proc. of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Also in arXiv:1607.05994

Omer Gold and Micha Sharir
Dominance Product and High-Dimensional Closest Pair under L_∞
In Proc. of the 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Also in arXiv:1605.08107

Omer Gold and Micha Sharir
Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy
In Proc. of the 25th Annual European Symposium on Algorithms (ESA 2017)
Also in arXiv:1512.05279

Omer Gold and Micha Sharir
On the Complexity of the Discrete Fréchet Distance under L₁ and L_∞
The 31st European Workshop on Computational Geometry (EuroCG 2015)

Omer Gold and Reuven Cohen
Coping with Physical Attacks on Random Network Structures
In Proc. of IEEE International Conference on Communications (ICC 2014)
Also in arXiv:1312.6189

Omer Gold
Master's Thesis: "Coping with Physical Attacks on Random Network Structures
Bar-Ilan University, 2014.

Preprints

Omer Gold
Deep Actor-Critic Experiment for Stock Trading Amid Sentiment and Buzz
Independent Preprint

Reviewer

I served as an external reviewer for the following venues: STOC, SODA, SoCG, ISAAC, IJCGA.

---

Teaching

• Google Technologies for Cloud and Web Development, Tel Aviv University
  Fall 2017/18, Spring 2018, Fall 2018/19, Spring 2019, Fall 2019/20, Spring 2020
• Discrete Mathematics, Spring 2017, Tel Aviv University
• Computational Geometry, Spring 2015, Tel Aviv University
• Automata and Formal Languages, Spring 2012, Spring 2013, Bar-Ilan University

Automata and Formal Languages - a summary of my lessons from spring 2012 (PDF).
During my M.Sc. studies in Bar-Ilan University I was a TA for the Automata and Formal Languages course, for which I wrote the lesson plans that you can find in the link above. I hope that it can be helpful to students of relevant courses.