Researcher interests: Algorithmic aspects of computer science; combinatorial optimization; metric embedding; on-line algorithms; network algorithms.(Theoretical)
DEPARTMENT: Computer Science
Contact Business Development: Anna Pellivert

Selected Publications

Yair Bartal, nova fandina, Ofer Neiman
dimensionality reduction theoretical perspective on practical measures (2019)| NeurIPS 2019 : Thirty-third Conference on Neural Information Processing Systems| Read more
arnold filtser, Yair Bartal, Ofer Neiman
on notions of distortion and an almost minimum spanning tree with constant average distortion (2019)| Journal of Computer and System Sciences| Read more
Yair Bartal, leead gottlieb
approximate nearest neighbor search for l p spaces 2 p via embeddings (2019)| Theoretical Computer Science| Read more
Yair Bartal, nova fandina, Ofer Neiman
covering metric spaces by few trees (2019)| ICALP| Read more
Yair Bartal, nova fandina, Ofer Neiman
covering metric spaces by few trees (2019)| arXiv: Data Structures and Algorithms| Read more
Yair Bartal, leead gottlieb
approximate nearest neighbor search for ell _p spaces 2 p infty via embeddings (2018)| latin american symposium on theoretical informatics| Read more
Yair Bartal, leead gottlieb
approximate nearest neighbor search for ell _p spaces 2 p infty via embeddings (2018)| Latin American Symposium on Theoretical Informatics| Read more
arnold filtser, Yair Bartal, Ofer Neiman
on notions of distortion and an almost minimum spanning tree with constant average distortion (2016)| Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms| Read more
Yair Bartal, leead gottlieb, robert krauthgamer
the traveling salesman problem low dimensionality implies a polynomial time approximation scheme (2016)| SIAM Journal on Computing| Read more

Contact for more information:

Anna Pellivert
VP, BUSINESS DEVELOPMENT
+972-2-6586697
Contact ME: