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

Selected Publications

Yair Bartal, leead gottlieb
approximate nearest neighbor search for l p spaces 2 p via embeddings (2019)| Theoretical Computer Science| 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
Yair Bartal, leead gottlieb
dimension reduction techniques for l_p 1 p 2 with applications (2016)| 32nd International Symposium on Computational Geometry (SoCG 2016)| Read more
Yair Bartal, Ittai Abraham, Ofer Neiman
local embeddings of metric spaces (2015)| Algorithmica| Read more
Yair Bartal, Ittai Abraham, Ofer Neiman
embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion (2015)| SIAM Journal on Computing| Read more
Yair Bartal, leead gottlieb, Ofer Neiman
on the impossibility of dimension reduction for doubling subsets of ell_ p (2015)| SIAM Journal on Discrete Mathematics| Read more
Yair Bartal, leead gottlieb, Ofer Neiman
on the impossibility of dimension reduction for doubling subsets of lp ()| Proceedings of the thirtieth annual symposium on Computational geometry| Read more

Contact for more information:

Tamir Huberman
CIO
+972-2-6586678
Contact ME: