≡ X En

בית הספר למדעי המחשב

המכללה האקדמית תל-אביב

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

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

הצגה: רשמי, שנתי, לינארי.

ספרים

1 נתי ליניאל ומיכל פרנס. מתמטיקה בדידה, 2001.

מאמרים נבחרים מעתונות מדעית

23 Ishay Haviv and Michal Parnas. On the binary and Boolean rank of regular matrices, Journal of Computer and System Sciences, כרך 134, עמודים 73-86, June 2023.
22 Ishay Haviv and Michal Parnas. The binary rank of circulant block matrices, Linear Algebra and its Applications, כרך 656, עמודים 277–303, Elsevier, January 2023.
21 Ishay Haviv and Michal Parnas. Upper bounds on the Boolean rank of Kronecker products, Discrete Applied Mathematics, כרך 318, עמודים 82–96, Elsevier, September 15, 2022.
20 Michal Parnas. Circulant almost cross intersecting families, The Art of Discrete and Applied Mathematics, כרך 5, מספר 1, עמודים 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, כרך 77, מספר 2, עמודים 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, כרך 574, עמודים 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, כרך 556, עמודים 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, כרך 381, מספר 1-3, עמודים 183–196, August 2007.
14 Michal Parnas, Dana Ron and Ronitt Rubinfeld. Tolerant property testing and distance approximation, Journal of Computer and System Sciences, כרך 72, מספר 6, עמודים 1012–1042, September 2006.
13 Iris Gaber and Michal Parnas. All-port line broadcasting in highly connected graphs, Networks: An International Journal, כרך 45, מספר 2, עמודים 95–103, Wiley Online Library, 2005.
12 Noga Alon, Seannie Dar, Michal Parnas and Dana Ron. Testing of clustering, SIAM Review, כרך 46, מספר 2, עמודים 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, כרך 16, מספר 3, עמודים 393–417, 2003, Appeared also in FOCS 2000.
10 Michal Parnas, Dana Ron and Ronitt Rubinfeld. Testing membership in parenthesis languages, Random Structures & Algorithms, כרך 22, מספר 1, עמודים 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., כרך 32, מספר 5, עמודים 1158–1184, 2003, Appeared also in RANDOM 2002.
8 Michal Parnas and Dana Ron. Testing metric properties, Information and Computation, כרך 187, מספר 2, עמודים 155–195, December 2003, Appeared also in STOC 2001.
7 Michal Parnas and Dana Ron. Testing the diameter of graphs, Random Structures & Algorithms, כרך 20, מספר 2, עמודים 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, כרך 16, מספר 1, עמודים 20–46, 2002.
5 Omer Berkman, Michal Parnas and Yehada Roditty. All cycles are edge-magic, Ars Combinatoria-Waterloo then Winnipeg, כרך 59, עמודים 145–152, Charles Babbage Research Center, 2001.
4 Omer Berkman, Michal Parnas and Jirí Sgall. Efficient Dynamic Traitor Tracing, SIAM Journal on Computing, כרך 30, מספר 6, עמודים 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, כרך 15, מספר 1, עמודים 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, כרך 28, עמודים 1021–1034, 1998, Appeared also in SPAA 1992..
1 Yishay Mansour and Michal Parnas. Learning Conjunctions with Noise under Product Distributions, Information Processing Letters, כרך 68, מספר 4, עמודים 189–196, November 1998.

מאמרים בכנסים

14 Ishay Haviv and Michal Parnas. On the Binary and Boolean Rank of Regular Matrices, באוסף 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, באוסף Procedia Computer Science, כרך 195, עמודים 172–180, 2021. arxiv
12 Michal Parnas, Dana Ron and Ronitt Rubinfeld. On testing convexity and submodularity, באוסף International Workshop on Randomization and Approximation Techniques in Computer Science, עמודים 11–25, 2002.
11 Michal Parnas and Dana Ron. Testing metric properties, באוסף Proceedings of the thirty-third annual ACM symposium on Theory of computing, עמודים 276–285, 2001.
10 Michal Parnas, Dana Ron and Ronitt Rubinfeld. Testing parenthesis languages, באוסף Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, עמודים 261–272, Springer, 2001.
9 Michal Parnas, Dana Ron and Alex Samorodnitsky. Proclaiming dictators and juntas or testing boolean formulae, באוסף Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, עמודים 273–285, Springer, 2001.
8 N Alon, S Dar, M Parnas and D Ron. Testing of clustering, באוסף Proceedings 41st Annual Symposium on Foundations of Computer Science, עמודים 240–240, 2000.
7 Omer Berkman, Michal Parnas and Jirí Sgall. Efficient dynamic traitor tracing, באוסף Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, עמודים 586–595, 2000.
6 Michal Parnas and Dana Ron. Testing the diameter of graphs, באוסף Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques, עמודים 85–96, Springer, 1999.
5 Yishay Mansour and Michal Parnas. On Learning Conjunctions with Malicious Noise., באוסף ISTCS, עמודים 170–175, 1996.
4 Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan and Michal Parnas. Neighborhood preserving hashing and approximate queries, באוסף Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, עמודים 251–259, 1994.
3 Daniel H. Greene, Michal Parnas and Frances Yao. Multi-Index Hashing for Information Retrieval, באוסף 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, עמודים 722–731, IEEE Computer Society, 1994.
2 Danny Dolev, Yuval Harari and Michal Parnas. Finding the neighborhood of a query in a dictionary, באוסף [1993] The 2nd Israel Symposium on Theory and Computing Systems, עמודים 33–42, 1993.
1 David R Karger, Noam Nisan and Michal Parnas. Fast connected components algorithms for the EREW PRAM, באוסף Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, עמודים 373–381, 1992.