מיכל פרנס

פרופ' מיכל פרנס

רקטורית

    בשנת 1994 סיימה את הדוקטורט שלה במדעי המחשב באוניברסיטה העברית, ומשנת 1997 היא חברת סגל בבית הספר למדעי המחשב במכללה האקדמית תל־אביב-יפו.

    פרופ׳ פרנס כיהנה כדקנית בית הספר למדעי המחשב בין השנים 2011 – 2016, ומשנת 2022 היא מכהנת כרקטורית של המכללה. תחום מחקרה המרכזי הוא בחינת תכונות ואלגוריתמים תת-לינאריים, ובשנים האחרונות היא עוסקת גם בבעיות של כיסויים וחלוקות אופטימאליים של מטריצות  בינאריות.

    בחינת תכונות, אלגוריתמים תת-לינאריים, כיסויים וחלוקות של מטריצות בינאריות.

    אלגוריתמים, מבני נתונים, אלגוריתמים תת-לינאריים.

    Linial, N., Parnas, M. (2001), Discrete Mathematics, in Hebrew.
    Publisher: N. Ben-Zvi, Jerusalem, 407 pages.

    Haviv. I., Parnas, M. (2023), On the binary and Boolean rank of regular matrices. Journal of Computer and System Sciences, Volume 134, 73-86.
    Haviv. I., Parnas, M. (2023), The binary rank of circulant block matrices. Linear Algebra and its Applications, Volume 656, 277-303.
    Haviv. I., Parnas, M. (2022), Upper bounds on the Boolean rank of Kronecker products. Discrete Applied Mathematics, Elsevier, Volume 318, 82-96.
    Parnas, M. (2022), Circulant almost cross intersecting families, Art of Discrete and Applied Mathematics, Volume 5(1).
    Parnas, M., Ron. D., Shraibman, A. (2021), Property testing of the Boolean and binary rank of a binary matrix. Theory of Computing Systems, Volume 65(8), 1193-1210.
    Parnas, M., Shraibman. A. (2020), On maximal isolation sets in the uniform intersection matrix. Australasian Journal of Combinatorics, Volume 77(2), 285-300.
    Parnas, M., Ron. D., Shraibman, A. (2019), The Boolean rank of the uniform intersection matrix and a family of its submatrices. Linear Algebra and its Applications, Volume 574, 67-83, 2019.
    Parnas, M., Shraibman. A. (2018), The augmentation property of binary matrices for the binary and Boolean rank. Linear Algebra and its Applications, Volume 556, 70-99.
    Parnas, M., Ron. D. (2007), Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Journal of Theoretical Computer Science, Volume 381, Issue 1, 183-196.
    Parnas, M., Ron. D., Rubinfeld, R. (2006), Tolerant property testing and distance approximation. Journal of Computer and System Sciences, Volume 72, Issue 6, 1012-1042.
    Gaber, I., Parnas, M. (2005), All-Port line broadcasting in highly connected graphs, Networks, Volume 45, Issue 2, 95-103.
    Alon, N., Dar, S., Parnas, M., Ron, D. (2004), Testing of clustering. SIAM Review, SIGEST selection, Volume 46, Number 2, 285-308.
    Parnas, M., Ron. D., Rubinfeld, R. (2003), On testing convexity and submodularity. SIAM Journal on Computing, Volume 32, Number 5, 1158 - 1184.
    Parnas, M., Ron. D. (2003), Testing metric properties. Journal of Information and Computation, Volume 187, Issue 2, 155-195.
    Alon, N., Dar, S., Parnas, M., Ron, D. (2003), Testing of clustering. SIAM Journal on Discrete Mathematics, Volume 16, Number 3, 393-417.
    Parnas, M., Ron, D., Samorodnitsky, A. (2002), Testing basic Boolean formulae. SIAM Journal on Discrete Mathematics, Volume 16, Number 1, 20-46.
    Parnas, M., Ron. D., Rubinfeld, R. (2002), Testing membership in parenthesis languages. Journal of Random Structures and Algorithms, Volume 22, Number 1, 93-138.
    Parnas, M., Ron. D. (2002), Testing the diameter of graphs. Journal of Random Structures and Algorithms, Volume 20, Number 2, 165-183.
    Dolev, D., Harari, Y., Linial, N., Nisan, N., Parnas, M. (2001), Neighborhood preserving hashing and approximate queries. SIAM Journal on Discrete Mathematics, Volume 15, Number 1, 73-85.
    Berkman, O., Parnas, M., Sgall, J. (2001), Efficient dynamic traitor tracing. SIAM Journal on Computing, Volume 30, Number 6, 1802-1828.
    Berkman, O., Parnas, M., Roditty, Y. (2001), All cycles are edge-magic. Ars Combinatoria, Volume 59, 145 – 151.
    Karger, D., Nisan, N., Parnas, M. (1998), Fast connected components algorithms for the EREW PRAM. SIAM Journal on Computing, Volume 28, Number 3, 1021-1034.
    Mansour, Y., Parnas, M. (1998), Learning conjunctions with noise under product distributions. Information Processing Letters, Volume 68, Number 4, 189-196.

    Haviv. I., Parnas, M. (2022),
    On the binary and Boolean rank of regular matrices.
    47th International Symposium on Mathematical Foundations of Computer Science.

    Haviv. I., Parnas, M. (2021),
    Upper bounds on the Boolean rank of Kronecker products.
    LAGOS. Procedia Computer Science, Volume 195, 172 – 180, Elsevier.

    Parnas, M., Ron. D., Rubinfeld, R. (2002),
    On testing convexity and submodularity.
    RANDOM, 11 – 24.

    Parnas, M., Ron. D., Rubinfeld, R. (2001),
    Testing parenthesis languages.
    RANDOM-APPROX, 261 – 272.

    Parnas, M., Ron, D., Samorodnitsky, A. (2001),
    Proclaiming dictators and juntas or testing Boolean formulae.
    RANDOM-APPROX, 273 – 284.

    Parnas, M., Ron. D. (2001),
    Testing properties of metrics.
    33’rd Annual ACM Symposium on the Theory of Computing, 276 – 285.

    Alon, N., Dar, S., Parnas, M., Ron, D. (2000),
    Testing of clustering.
    41’st Symposium on Foundations of Computer Science, 240 – 250.

    Berkman, O., Parnas, M., Sgall, J. (2000),
    Efficient dynamic traitor tracing.
    11’th Annual ACM Symposium On Discrete Algorithms, 586 – 595.

    Parnas, M., Ron. D. (1999),
    Testing the diameter of graphs.
    RANDOM-APPROX 1999, Lecture Notes in Computer Science, 1671.
    Randomization, Approximation and Combinatorial Optimization,
    Algorithms and Techniques, 85 – 96.

    Mansour, Y., Parnas, M. (1996),
    On learning conjunctions with malicious noise.
    5’th Israel Symposium on Theory of Computing and Systems.

    Dolev, D., Harari, Y., Linial, N., Nisan, N., Parnas, M. (1994),
    Neighborhood preserving hashing and approximate queries.
    5’th Annual ACM Symposium On Discrete Algorithms, 251 – 259,1994.

    Greene, D., Parnas, M., Yao, F. (1994),
    Multi-index hashing for information retrieval.
    35’th Symposium on Foundations of Computer Science, 722 – 731.
    Link: https://doi.org/10.1109/SFCS.1994.365720

    Dolev, D., Harari, Y., Parnas, M. (1993),
    Finding the neighborhood of a query in a dictionary.
    2’nd Israel Symposium on Theory of Computing and Systems, 33 – 42.

    Karger, D., Nisan, N., Parnas, M. (1992),
    Fast connected components algorithms for EREW PRAM.
    4’th Annual ACM Symposium on Parallel Algorithms and Architectures,
    373 – 381.