Negev Shekel Nosatzki

According to our database1, Negev Shekel Nosatzki authored at least 5 papers between 2017 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Estimating the Longest Increasing Subsequence in Nearly Optimal Time.
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.
CoRR, 2021

2020
Edit Distance in Near-Linear Time: it's a Constant Factor.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2018
Two Party Distribution Testing: Communication and Security.
IACR Cryptol. ePrint Arch., 2018

2017
LSH Forest: Practical Algorithms Made Theoretical.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017


  Loading...