top of page
Prof. Parnas Michal
Fields of Research
Prof. Parnas Michal
School of Computer Science
  • Sublinear algorithms

  • Property testing

  • Combinatorics

Short Bio

Prof. Parnas is a faculty member of the School of Computer Science since 1997. She received her BSc, MSc. and PhD in computer science from the Hebrew university of Jerusalem.  

Michal was the Dean of the School of Computer Science from 2011 to 2016 and is the vice president of academic affairs of the college since October 2022.

She is known for her research on property testing and sublinear algorithms.

She is also the co-author of a book in Hebrew on discrete mathematics, with Prof. Lineal.

Selected Publications

  1. M. Parnas, D. Ron. Approximating the Minimum Vertex Cover in Sublinear Time and a Connection to Distributed Algorithms.Journal of Theoretical Computer Science, Volume 381, Issue 1, pp.183-196, 2007. 

  2. M. Parnas, D. Ron, R. Rubinfeld. Tolerant Property Testing and Distance Approximation. Journal of Computer and System Sciences (JCSS), Volume 72, Issue 6, pp. 1012-1042, 2006.

  3. N. Alon, S. Dar, M. Parnas, D. Ron. Testing of Clustering.  SIAM Journal on Discrete Mathematics, Volume 16, Number 3,pp. 393-417, 2003.

  4. M.Parnas and D.Ron.  Testing the Diameter of Graphs.  Journal of Random Structures and Algorithms, Volume 20, Number 2, pp. 165-183, 2002.

  5. O.Berkman, M.Parnas, J.Sgall.  Efficient Dynamic Traitor Tracing. SIAM Journal on Computing, Volume 30, Number 6, pp. 1802-1828, 2001.

  6. D.Greene, M.Parnas, F.Yao.Multi-Index Hashing for Information Retrieval.35’th Symposium on Foundations of Computer Science, pp. 722-731, 1994. 

bottom of page