Michal Parnas

50 papers A* 5A 1B 3C 1Journal 33Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
A study of the binary and Boolean rank of matrices with small constant real rank.
Discret. Appl. Math.
Michal Parnas, Adi Shraibman
2026 J jnl
Mathematical and computational perspectives on the Boolean and binary rank and their relation to the real rank.
CoRR
Michal Parnas
2026 J jnl
Testing Intersectingness of Uniform Families.
Theory Comput. Syst.
Ishay Haviv, Michal Parnas
2025 B conf
A Study of the Binary and Boolean Rank of Matrices with Small Constant Real Rank.
FCT
Michal Parnas, Adi Shraibman
2024 A conf
Testing Intersectingness of Uniform Families.
APPROX/RANDOM
Ishay Haviv, Michal Parnas
2024 J jnl
Testing Intersectingness of Uniform Families.
CoRR
Ishay Haviv, Michal Parnas
2023 J jnl
On the binary and Boolean rank of regular matrices.
J. Comput. Syst. Sci.
Ishay Haviv, Michal Parnas
2022 J jnl
Circulant almost cross intersecting families.
Art Discret. Appl. Math.
Michal Parnas
2022 B conf
On the Binary and Boolean Rank of Regular Matrices.
MFCS
Ishay Haviv, Michal Parnas
2022 J jnl
On the Binary and Boolean Rank of Regular Matrices.
CoRR
Ishay Haviv, Michal Parnas
2022 J jnl
The Binary Rank of Circulant Block Matrices.
CoRR
Ishay Haviv, Michal Parnas
2022 J jnl
Upper bounds on the Boolean rank of Kronecker products.
Discret. Appl. Math.
Ishay Haviv, Michal Parnas
2021 J jnl
Property Testing of the Boolean and Binary Rank.
Theory Comput. Syst.
Michal Parnas, Dana Ron, Adi Shraibman
2021 C conf
Upper Bounds on the Boolean Rank of Kronecker Products.
LAGOS
Ishay Haviv, Michal Parnas
2020 J jnl
Circulant almost cross intersecting families.
CoRR
Michal Parnas
2020 J jnl
On maximal isolation sets in the uniform intersection matrix.
Australas. J Comb.
Michal Parnas, Adi Shraibman
2019 J jnl
On maximal isolation sets in the uniform intersection matrix.
CoRR
Michal Parnas, Adi Shraibman
2019 J jnl
Property testing of the Boolean and binary rank.
CoRR
Michal Parnas, Dana Ron, Adi Shraibman
2017 J jnl
The Augmentation Property of Binary Matrices for the Binary and Boolean Rank.
CoRR
Michal Parnas, Adi Shraibman
2007 J jnl
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms.
Theor. Comput. Sci.
Michal Parnas, Dana Ron
2006 J jnl
Tolerant property testing and distance approximation.
J. Comput. Syst. Sci.
Michal Parnas, Dana Ron, Ronitt Rubinfeld
2005 J jnl
All-port line broadcasting in highly connected graphs.
Networks
Iris Gaber, Michal Parnas
2005 J jnl
On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms
Electron. Colloquium Comput. Complex.
Michal Parnas, Dana Ron
2004 J jnl
Testing of Clustering.
SIAM Rev.
Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
2004 J jnl
Tolerant Property Testing and Distance Approximation
Electron. Colloquium Comput. Complex.
Michal Parnas, Dana Ron, Ronitt Rubinfeld
2003 J jnl
On Testing Convexity and Submodularity.
SIAM J. Comput.
Michal Parnas, Dana Ron, Ronitt Rubinfeld
2003 J jnl
Testing membership in parenthesis languages.
Random Struct. Algorithms
Michal Parnas, Dana Ron, Ronitt Rubinfeld
2003 J jnl
Testing metric properties.
Inf. Comput.
Michal Parnas, Dana Ron
2003 J jnl
Testing of Clustering.
SIAM J. Discret. Math.
Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
2002 — conf
On Testing Convexity and Submodularity.
RANDOM
Michal Parnas, Dana Ron, Ronitt Rubinfeld
2002 J jnl
Testing Basic Boolean Formulae.
SIAM J. Discret. Math.
Michal Parnas, Dana Ron, Alex Samorodnitsky
2002 J jnl
Testing the diameter of graphs.
Random Struct. Algorithms
Michal Parnas, Dana Ron
2001 J jnl
All Cycles are Edge-Magic.
Ars Comb.
Omer Berkman, Michal Parnas, Yehuda Roditty
2001 J jnl
Neighborhood Preserving Hashing and Approximate Queries.
SIAM J. Discret. Math.
Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
2001 J jnl
Proclaiming Dictators and Juntas or Testing Boolean Formulae
Electron. Colloquium Comput. Complex.
Michal Parnas, Dana Ron, Alex Samorodnitsky
2001 — conf
Proclaiming Dictators and Juntas or Testing Boolean Formulae.
RANDOM-APPROX
Michal Parnas, Dana Ron, Alex Samorodnitsky
2001 — conf
Testing Parenthesis Languages.
RANDOM-APPROX
Michal Parnas, Dana Ron, Ronitt Rubinfeld
2001 A* conf
Testing metric properties.
STOC
Michal Parnas, Dana Ron
2000 J jnl
Efficient Dynamic Traitor Tracing.
SIAM J. Comput.
Omer Berkman, Michal Parnas, Jirí Sgall
2000 A* conf
Efficient dynamic traitor tracing.
SODA
Omer Berkman, Michal Parnas, Jirí Sgall
2000 A* conf
Testing of Clustering.
FOCS
Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
1999 J jnl
Fast Connected Components Algorithms for the EREW PRAM.
SIAM J. Comput.
David R. Karger, Noam Nisan, Michal Parnas
1999 — conf
Testing the Diameter of Graphs.
RANDOM-APPROX
Michal Parnas, Dana Ron
1998 J jnl
Learning Conjunctions with Noise under Product Distributions.
Inf. Process. Lett.
Yishay Mansour, Michal Parnas
1996 — conf
On Learning Conjunctions with Malicious Noise.
ISTCS
Yishay Mansour, Michal Parnas
1994 A* conf
Multi-Index Hashing for Information Retrieval
FOCS
Daniel H. Greene, Michal Parnas, F. Frances Yao
1994 A* conf
Neighborhood Preserving Hashing and Approximate Queries.
SODA
Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
1994 — —
Robust algorithms and data structures for information retrieval (אלגוריתמים ומבני נתונים עמידים לשליפת נתונים.).
Michal Parnas
1993 — conf
Finding the Neighborhood of a Query in a Dictionary.
ISTCS
Danny Dolev, Yuval Harari, Michal Parnas
1992 B conf
Fast Connected Components Algorithms for the EREW PRAM.
SPAA
David R. Karger, Noam Nisan, Michal Parnas