Michal Parnas

According to our database, Michal Parnas authored at least 27 papers between 1993 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

On the binary and Boolean rank of regular matrices.

Ishay Haviv, Michal Parnas

J. Comput. Syst. Sci., June, 2023

2022

Upper bounds on the Boolean rank of Kronecker products.

Ishay Haviv, Michal Parnas

Discret. Appl. Math., 2022

The Binary Rank of Circulant Block Matrices.

Ishay Haviv, Michal Parnas

CoRR, 2022

Circulant almost cross intersecting families.

Michal Parnas

Art Discret. Appl. Math., 2022

2021

Property Testing of the Boolean and Binary Rank.

Michal Parnas, Dana Ron, Adi Shraibman

Theory Comput. Syst., 2021

2020

On maximal isolation sets in the uniform intersection matrix.

Michal Parnas, Adi Shraibman

Australas. J Comb., 2020

2017

The Augmentation Property of Binary Matrices for the Binary and Boolean Rank.

Michal Parnas, Adi Shraibman

CoRR, 2017

2007

Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms.

Michal Parnas, Dana Ron

Theor. Comput. Sci., 2007

2006

Tolerant property testing and distance approximation.

Michal Parnas, Dana Ron, Ronitt Rubinfeld

J. Comput. Syst. Sci., 2006

2005

All-port line broadcasting in highly connected graphs.

Iris Gaber, Michal Parnas

Networks, 2005

2003

Testing of Clustering.

Noga Alon, Seannie Dar, Michal Parnas, Dana Ron

SIAM J. Discret. Math., 2003

On Testing Convexity and Submodularity.

Michal Parnas, Dana Ron, Ronitt Rubinfeld

SIAM J. Comput., 2003

Testing membership in parenthesis languages.

Michal Parnas, Dana Ron, Ronitt Rubinfeld

Random Struct. Algorithms, 2003

Testing metric properties.

Michal Parnas, Dana Ron

Inf. Comput., 2003

2002

Testing Basic Boolean Formulae.

Michal Parnas, Dana Ron, Alex Samorodnitsky

SIAM J. Discret. Math., 2002

Testing the diameter of graphs.

Michal Parnas, Dana Ron

Random Struct. Algorithms, 2002

2001

Neighborhood Preserving Hashing and Approximate Queries.

Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas

SIAM J. Discret. Math., 2001

Proclaiming Dictators and Juntas or Testing Boolean Formulae

Michal Parnas, Dana Ron, Alex Samorodnitsky

Electron. Colloquium Comput. Complex., 2001

All Cycles are Edge-Magic.

Omer Berkman, Michal Parnas, Yehuda Roditty

Ars Comb., 2001

Testing Parenthesis Languages.

Michal Parnas, Dana Ron, Ronitt Rubinfeld

Proceedings of the Approximation, 2001

2000

Efficient Dynamic Traitor Tracing.

Omer Berkman, Michal Parnas, Jirí Sgall

SIAM J. Comput., 2000

1999

Fast Connected Components Algorithms for the EREW PRAM.

David R. Karger, Noam Nisan, Michal Parnas

SIAM J. Comput., 1999

1998

Learning Conjunctions with Noise under Product Distributions.

Yishay Mansour, Michal Parnas

Inf. Process. Lett., 1998

1996

On Learning Conjunctions with Malicious Noise.

Yishay Mansour, Michal Parnas

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1994

Robust algorithms and data structures for information retrieval (אלגוריתמים ומבני נתונים עמידים לשליפת נתונים.).

Michal Parnas

PhD thesis, 1994

Multi-Index Hashing for Information Retrieval

Daniel H. Greene, Michal Parnas, F. Frances Yao

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Finding the Neighborhood of a Query in a Dictionary.

Danny Dolev, Yuval Harari, Michal Parnas

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993