Michal Parnas

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 14

Top Topics

Kronecker Product

Top Venues

J. Comput. Syst. Sci.

Theory Comput. Syst.

Discret. Appl. Math.

Publications

Ishay Haviv, Michal Parnas
Testing Intersectingness of Uniform Families. CoRR (2024)
Ishay Haviv, Michal Parnas
On the binary and Boolean rank of regular matrices. J. Comput. Syst. Sci. 134 (2023)
Michal Parnas
Circulant almost cross intersecting families. Art Discret. Appl. Math. 5 (1) (2022)
Ishay Haviv, Michal Parnas
On the Binary and Boolean Rank of Regular Matrices. MFCS (2022)
Ishay Haviv, Michal Parnas
On the Binary and Boolean Rank of Regular Matrices. CoRR (2022)
Ishay Haviv, Michal Parnas
Upper bounds on the Boolean rank of Kronecker products. Discret. Appl. Math. 318 (2022)
Ishay Haviv, Michal Parnas
The Binary Rank of Circulant Block Matrices. CoRR (2022)
Ishay Haviv, Michal Parnas
Upper Bounds on the Boolean Rank of Kronecker Products. LAGOS (2021)
Michal Parnas, Dana Ron, Adi Shraibman
Property Testing of the Boolean and Binary Rank. Theory Comput. Syst. 65 (8) (2021)
Michal Parnas, Adi Shraibman
On maximal isolation sets in the uniform intersection matrix. Australas. J Comb. 77 (2020)
Michal Parnas
Circulant almost cross intersecting families. CoRR (2020)
Michal Parnas, Adi Shraibman
On maximal isolation sets in the uniform intersection matrix. CoRR (2019)
Michal Parnas, Dana Ron, Adi Shraibman
Property testing of the Boolean and binary rank. CoRR (2019)
Michal Parnas, Adi Shraibman
The Augmentation Property of Binary Matrices for the Binary and Boolean Rank. CoRR (2017)
Michal Parnas, Dana Ron
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theor. Comput. Sci. 381 (1-3) (2007)
Michal Parnas, Dana Ron, Ronitt Rubinfeld
Tolerant property testing and distance approximation. J. Comput. Syst. Sci. 72 (6) (2006)
Michal Parnas, Dana Ron
On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms Electron. Colloquium Comput. Complex. (094) (2005)
Iris Gaber, Michal Parnas
All-port line broadcasting in highly connected graphs. Networks 45 (2) (2005)
Michal Parnas, Dana Ron, Ronitt Rubinfeld
Tolerant Property Testing and Distance Approximation Electron. Colloquium Comput. Complex. (010) (2004)
Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
Testing of Clustering. SIAM Rev. 46 (2) (2004)
Michal Parnas, Dana Ron, Ronitt Rubinfeld
On Testing Convexity and Submodularity. SIAM J. Comput. 32 (5) (2003)
Michal Parnas, Dana Ron
Testing metric properties. Inf. Comput. 187 (2) (2003)
Michal Parnas, Dana Ron, Ronitt Rubinfeld
Testing membership in parenthesis languages. Random Struct. Algorithms 22 (1) (2003)
Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
Testing of Clustering. SIAM J. Discret. Math. 16 (3) (2003)
Michal Parnas, Dana Ron
Testing the diameter of graphs. Random Struct. Algorithms 20 (2) (2002)
Michal Parnas, Dana Ron, Ronitt Rubinfeld
On Testing Convexity and Submodularity. RANDOM (2002)
Michal Parnas, Dana Ron, Alex Samorodnitsky
Testing Basic Boolean Formulae. SIAM J. Discret. Math. 16 (1) (2002)
Michal Parnas, Dana Ron, Alex Samorodnitsky
Proclaiming Dictators and Juntas or Testing Boolean Formulae Electron. Colloquium Comput. Complex. 8 (063) (2001)
Michal Parnas, Dana Ron, Alex Samorodnitsky
Proclaiming Dictators and Juntas or Testing Boolean Formulae. RANDOM-APPROX (2001)
Michal Parnas, Dana Ron, Ronitt Rubinfeld
Testing Parenthesis Languages. RANDOM-APPROX (2001)
Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
Neighborhood Preserving Hashing and Approximate Queries. SIAM J. Discret. Math. 15 (1) (2001)
Michal Parnas, Dana Ron
Testing metric properties. STOC (2001)
Omer Berkman, Michal Parnas, Yehuda Roditty
All Cycles are Edge-Magic. Ars Comb. 59 (2001)
Omer Berkman, Michal Parnas, Jirí Sgall
Efficient dynamic traitor tracing. SODA (2000)
Omer Berkman, Michal Parnas, Jirí Sgall
Efficient Dynamic Traitor Tracing. SIAM J. Comput. 30 (6) (2000)
Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
Testing of Clustering. FOCS (2000)
David R. Karger, Noam Nisan, Michal Parnas
Fast Connected Components Algorithms for the EREW PRAM. SIAM J. Comput. 28 (3) (1999)
Michal Parnas, Dana Ron
Testing the Diameter of Graphs. RANDOM-APPROX (1999)
Yishay Mansour, Michal Parnas
Learning Conjunctions with Noise under Product Distributions. Inf. Process. Lett. 68 (4) (1998)
Yishay Mansour, Michal Parnas
On Learning Conjunctions with Malicious Noise. ISTCS (1996)
Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
Neighborhood Preserving Hashing and Approximate Queries. SODA (1994)
Daniel H. Greene, Michal Parnas, F. Frances Yao
Multi-Index Hashing for Information Retrieval FOCS (1994)
Danny Dolev, Yuval Harari, Michal Parnas
Finding the Neighborhood of a Query in a Dictionary. ISTCS (1993)
David R. Karger, Noam Nisan, Michal Parnas
Fast Connected Components Algorithms for the EREW PRAM. SPAA (1992)