Omer Gold, PhD
Founder and CEO of Anomity.ai, which gives security teams real-time visibility and governance across every AI agent, MCP server, plugin, skill and AI tool, without disrupting workflows.
POSITIONFounder & CEO, Anomity.ai
ACADEMIAComputer Science PhD,
Tel Aviv University, 2020
FieldAlgorithms, AI, Computational Geometry
About
In academia I worked on classical problems in computer science, improving running-time bounds that had stood untouched for decades. I bring the same habit to building companies: start from what is actually true, not from what everyone assumes is settled.
I am founder and CEO of Anomity.ai. Enterprises adopted AI faster than they could govern it: agents, MCP servers, plugins, skills and copilots now read and act on company data, largely outside the security team's field of view. Anomity gives security teams real-time visibility and governance across all of it — what is running, who authorized it, what it can reach — and enforces policy as it happens, without disrupting workflows. Previously I founded Deskfirst, which brought online collaboration desktops to client-facing teams.
I obtained my PhD from the School of Computer Science at Tel Aviv University in 2020, advised by Prof. Micha Sharir. I received 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.
Dissertation: New Algorithms for Some Classical Problems in P — abstract, acknowledgements.
Research
Research interests: design and analysis of algorithms, computational geometry.
During my PhD I worked on core problems in algorithm design, which led to the following results.
- The first subquadratic-time algorithm for computing Dynamic Time Warping between two point-sequences on the real line, breaking a fifty-year-old quadratic-time barrier. It remains the best known algorithm for the problem.
- An improved algorithm and decision tree for the 3SUM problem (both later further improved).
- Proofs of the existence of various diameter spanners in directed graphs, and efficient algorithms to compute them.
- The first strongly-polynomial subcubic-time algorithm for computing the L∞ closest pair of n points in Rn.
Publications
Keerti Choudhary and Omer Gold
Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms
31st ACM-SIAM Symposium on Discrete Algorithms (SODA 2020). Also arXiv:1812.01602.
Omer Gold and Micha Sharir
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
ACM Transactions on Algorithms 14(4), 2018 (TALG 2018). Also 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), and arXiv:1607.05994.
Omer Gold and Micha Sharir
Dominance Product and High-Dimensional Closest Pair under L∞
28th International Symposium on Algorithms and Computation (ISAAC 2017). Also arXiv:1605.08107.
Omer Gold and Micha Sharir
Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy
25th Annual European Symposium on Algorithms (ESA 2017). Also arXiv:1512.05279.
Omer Gold and Micha Sharir
On the Complexity of the Discrete Fréchet Distance under L1 and L∞
31st European Workshop on Computational Geometry (EuroCG 2015).
Omer Gold and Reuven Cohen
Coping with Physical Attacks on Random Network Structures
IEEE International Conference on Communications (ICC 2014). Also arXiv:1312.6189.
Omer Gold
Deep Actor-Critic Experiment for Stock Trading Amid Sentiment and Buzz
Independent preprint.
Theses
PhD dissertation, Tel Aviv University, 2020
New Algorithms for Some Classical Problems in P
Advised by Prof. Micha Sharir. Also available: abstract, acknowledgements.
M.Sc. thesis, Bar-Ilan University, 2014
Coping with Physical Attacks on Random Network Structures
Computer Science, magna cum laude.
Reviewer
I have served as an external reviewer for STOC, SODA, SoCG, ISAAC and 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 and Spring 2013, Bar-Ilan University
Teaching material
Automata and Formal Languages — a summary of my lessons, Spring 2012 (PDF).
I wrote the lesson plans while I was a teaching assistant for the course at Bar-Ilan University.
I hope they are useful to students of related courses.