1 | Nati Linial and Michal Parnas. Discrete Mathematics (in Hebrew), 2001. |

23 | Ishay Haviv and Michal Parnas. On the binary and Boolean rank of regular matrices, Journal of Computer and System Sciences, volume 134, pages 73-86, June 2023. |

22 | Ishay Haviv and Michal Parnas. The binary rank of circulant block matrices, Linear Algebra and its Applications, volume 656, pages 277–303, Elsevier, January 2023. |

21 | Ishay Haviv and Michal Parnas. Upper bounds on the Boolean rank of Kronecker products, Discrete Applied Mathematics, volume 318, pages 82–96, Elsevier, September 15, 2022. |

20 | Michal Parnas. Circulant almost cross intersecting families, The Art of Discrete and Applied Mathematics, volume 5, number 1, pages P1–08, April 4, 2022. |

19 | Michal Parnas, Dana Ron and Adi Shraibman. Property Testing of the Boolean and Binary Rank, Theory of Computing Systems (2021), June 3, 2021. |

18 | Adi Shraibman and Michal Parnas. On maximal isolation sets in the uniform intersection matrix, Australasian Journal of Combinatorics, volume 77, number 2, pages 285–300, 2020. |

17 | Michal Parnas, Dana Ron and Adi Shraibman. The Boolean rank of the uniform intersection matrix and a family of its submatrices, Linear Algebra and its Applications, volume 574, pages 67–83, August 2019. |

16 | Michal Parnas and Adi Shraibman. The augmentation property of binary matrices for the binary and Boolean rank, Linear Algebra and its Applications, volume 556, pages 70–99, November 2018. |

15 | Michal Parnas and Dana Ron. Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms, Theoretical Computer Science, volume 381, number 1-3, pages 183–196, August 2007. |

14 | Michal Parnas, Dana Ron and Ronitt Rubinfeld. Tolerant property testing and distance approximation, Journal of Computer and System Sciences, volume 72, number 6, pages 1012–1042, September 2006. |

13 | Iris Gaber and Michal Parnas. All-port line broadcasting in highly connected graphs, Networks: An International Journal, volume 45, number 2, pages 95–103, Wiley Online Library, 2005. |

12 | Noga Alon, Seannie Dar, Michal Parnas and Dana Ron. Testing of clustering, SIAM Review, volume 46, number 2, pages 285–308, Society for Industrial and Applied Mathematics Publications, 2004. |

11 | Noga Alon, Seannie Dar, Michal Parnas and Dana Ron. Testing of Clustering, SIAM Journal on Discrete Mathematics, volume 16, number 3, pages 393–417, 2003, Appeared also in FOCS 2000. |

10 | Michal Parnas, Dana Ron and Ronitt Rubinfeld. Testing membership in parenthesis languages, Random Structures & Algorithms, volume 22, number 1, pages 98–138, 2003, Appeared also in RANDOM-APPROX 2001. |

9 | Michal Parnas, Dana Ron and Ronitt Rubinfeld. On Testing Convexity and Submodularity, SIAM J. Comput., volume 32, number 5, pages 1158–1184, 2003, Appeared also in RANDOM 2002. |

8 | Michal Parnas and Dana Ron. Testing metric properties, Information and Computation, volume 187, number 2, pages 155–195, December 2003, Appeared also in STOC 2001. |

7 | Michal Parnas and Dana Ron. Testing the diameter of graphs, Random Structures & Algorithms, volume 20, number 2, pages 165–183, 2002, Appeared also in RANDOM-APPROX 1999. |

6 | Michal Parnas, Dana Ron and Alex Samorodnitsky. Testing Basic Boolean Formulae, SIAM Journal on Discrete Mathematics, volume 16, number 1, pages 20–46, 2002. |

5 | Omer Berkman, Michal Parnas and Yehada Roditty. All cycles are edge-magic, Ars Combinatoria-Waterloo then Winnipeg, volume 59, pages 145–152, Charles Babbage Research Center, 2001. |

4 | Omer Berkman, Michal Parnas and Jirí Sgall. Efficient Dynamic Traitor Tracing, SIAM Journal on Computing, volume 30, number 6, pages 1802–1828, 2001, Appeared also in SODA 2000. |

3 | Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan and Michal Parnas. Neighborhood Preserving Hashing and Approximate Queries, SIAM Journal on Discrete Mathematics, volume 15, number 1, pages 73–85, 2001, Appeared also in SODA 1994. |

2 | David Karger, Noam Nisan and Michal Parnas. Fast connected components algorithms for the EREW PRAM, SIAM Journal on Computing, volume 28, pages 1021–1034, 1998, Appeared also in SPAA 1992.. |

1 | Yishay Mansour and Michal Parnas. Learning Conjunctions with Noise under Product Distributions, Information Processing Letters, volume 68, number 4, pages 189–196, November 1998. |

14 | Ishay Haviv and Michal Parnas. On the Binary and Boolean Rank of Regular Matrices, in 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Schloss Dagstuhl-Leibniz-Zentrum fɒr Informatik, 2022. |

13 | Ishay Haviv and Michal Parnas. Upper Bounds on the Boolean Rank of Kronecker Products, in Procedia Computer Science, volume 195, pages 172–180, 2021. arxiv |

12 | Michal Parnas, Dana Ron and Ronitt Rubinfeld. On testing convexity and submodularity, in International Workshop on Randomization and Approximation Techniques in Computer Science, pages 11–25, 2002. |

11 | Michal Parnas and Dana Ron. Testing metric properties, in Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 276–285, 2001. |

10 | Michal Parnas, Dana Ron and Ronitt Rubinfeld. Testing parenthesis languages, in Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, pages 261–272, Springer, 2001. |

9 | Michal Parnas, Dana Ron and Alex Samorodnitsky. Proclaiming dictators and juntas or testing boolean formulae, in Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, pages 273–285, Springer, 2001. |

8 | N Alon, S Dar, M Parnas and D Ron. Testing of clustering, in Proceedings 41st Annual Symposium on Foundations of Computer Science, pages 240–240, 2000. |

7 | Omer Berkman, Michal Parnas and Jirí Sgall. Efficient dynamic traitor tracing, in Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pages 586–595, 2000. |

6 | Michal Parnas and Dana Ron. Testing the diameter of graphs, in Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques, pages 85–96, Springer, 1999. |

5 | Yishay Mansour and Michal Parnas. On Learning Conjunctions with Malicious Noise., in ISTCS, pages 170–175, 1996. |

4 | Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan and Michal Parnas. Neighborhood preserving hashing and approximate queries, in Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, pages 251–259, 1994. |

3 | Daniel H. Greene, Michal Parnas and Frances Yao. Multi-Index Hashing for Information Retrieval, in 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pages 722–731, IEEE Computer Society, 1994. |

2 | Danny Dolev, Yuval Harari and Michal Parnas. Finding the neighborhood of a query in a dictionary, in [1993] The 2nd Israel Symposium on Theory and Computing Systems, pages 33–42, 1993. |

1 | David R Karger, Noam Nisan and Michal Parnas. Fast connected components algorithms for the EREW PRAM, in Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, pages 373–381, 1992. |