אלגוריתמים

Prof. Tamir Tassa is senior staff member in the Department of Mathematics and Computer Science at the Open University. He previously served as lecturer and scholar in the School of Mathematical Sciences at Tel Aviv University, and in the Department of Computer Science at Ben-Gurion University of the Negev. Between 1993 and 1996 he served as assistant professor of computational and applied mathematics at the University of California, Los Angeles. In 1993 he received his PhD in mathematics from Tel Aviv University. His main areas of interest are safe multi-participant computation, privacy-maintaining data mining and data publication, and sharing of secrets.

Prof. Manor Mendel pursued his academic education in computer science at Tel Aviv University. In 2005, upon completion of his postdoctoral studies at the Hebrew University of Jerusalem, the University of Illinois Urbana-Champaign, and the California Institute of Technology, he was named senior staff in the Department of Mathematics and Computer Science at the Open University. Additionally, he served as a guest scholar and guest professor at Microsoft’s research division, at the University of Washington, and at the Institute for Advanced Study at Princeton University. His studies center around metric geometry, algorithms and the link between them.

Zeev Notov is a professor at the Open University, in the Departments of Mathematics and Computer Science. His main areas of interest are approximation algorithms for NP-hardness cohesion and cover problems, whose sources are in line networks or Wi-Fi networks.

Holds a PhD in applied mathematics and computer science from the Weizmann Institute of Science, 2008).
Occupation: a lecturer and a planner of courses in mathematics and computer science.
Over the last few years mostly theoretical and algorithmic courses for a master’s degree in computer science.