Negev Shekel Nosatzki

According to our database, Negev Shekel Nosatzki authored at least 6 papers between 2017 and 2025.

Collaborative distances:

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

2025

Embeddings into Similarity Measures for Nearest Neighbor Search.

Alexandr Andoni, Negev Shekel Nosatzki

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2022

Estimating the Longest Increasing Subsequence in Nearly Optimal Time.

Alexandr Andoni, Negev Shekel Nosatzki, Sandip Sinha, Clifford Stein

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Approximating the Longest Common Subsequence problem within a sub-polynomial factor in linear time.

Negev Shekel Nosatzki

CoRR, 2021

2020

Edit Distance in Near-Linear Time: it's a Constant Factor.

Alexandr Andoni, Negev Shekel Nosatzki

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Two Party Distribution Testing: Communication and Security.

Alexandr Andoni, Tal Malkin, Negev Shekel Nosatzki

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2017

LSH Forest: Practical Algorithms Made Theoretical.

Alexandr Andoni, Ilya P. Razenshteyn, Negev Shekel Nosatzki

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017