default search action
Michal Parnas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Ishay Haviv, Michal Parnas:
Testing Intersectingness of Uniform Families. APPROX/RANDOM 2024: 35:1-35:15 - [i10]Ishay Haviv, Michal Parnas:
Testing Intersectingness of Uniform Families. CoRR abs/2404.11504 (2024) - 2023
- [j20]Ishay Haviv, Michal Parnas:
On the binary and Boolean rank of regular matrices. J. Comput. Syst. Sci. 134: 73-86 (2023) - 2022
- [j19]Michal Parnas:
Circulant almost cross intersecting families. Art Discret. Appl. Math. 5(1) (2022) - [j18]Ishay Haviv
, Michal Parnas
Upper bounds on the Boolean rank of Kronecker products. Discret. Appl. Math. 318: 82-96 (2022) - [c14]Ishay Haviv, Michal Parnas:
On the Binary and Boolean Rank of Regular Matrices. MFCS 2022: 56:1-56:14 - [i9]Ishay Haviv, Michal Parnas:
On the Binary and Boolean Rank of Regular Matrices. CoRR abs/2203.13073 (2022) - [i8]Ishay Haviv, Michal Parnas:
The Binary Rank of Circulant Block Matrices. CoRR abs/2204.08942 (2022) - 2021
- [j17]Michal Parnas
Property Testing of the Boolean and Binary Rank. Theory Comput. Syst. 65(8): 1193-1210 (2021) - [c13]Ishay Haviv, Michal Parnas:
Upper Bounds on the Boolean Rank of Kronecker Products. LAGOS 2021: 172-180 - 2020
- [j16]Michal Parnas, Adi Shraibman:
On maximal isolation sets in the uniform intersection matrix. Australas. J Comb. 77: 285-300 (2020) - [i7]Michal Parnas:
Circulant almost cross intersecting families. CoRR abs/2005.07907 (2020)
2010 – 2019
- 2019
- [i6]Michal Parnas, Adi Shraibman:
On maximal isolation sets in the uniform intersection matrix. CoRR abs/1907.11632 (2019) - [i5]Michal Parnas, Dana Ron, Adi Shraibman:
Property testing of the Boolean and binary rank. CoRR abs/1908.11632 (2019) - 2017
- [i4]Michal Parnas, Adi Shraibman:
The Augmentation Property of Binary Matrices for the Binary and Boolean Rank. CoRR abs/1706.06900 (2017)
2000 – 2009
- 2007
- [j15]Michal Parnas, Dana Ron
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theor. Comput. Sci. 381(1-3): 183-196 (2007) - 2006
- [j14]Michal Parnas, Dana Ron
Tolerant property testing and distance approximation. J. Comput. Syst. Sci. 72(6): 1012-1042 (2006) - 2005
- [j13]Iris Gaber, Michal Parnas:
All-port line broadcasting in highly connected graphs. Networks 45(2): 95-103 (2005) - [i3]Michal Parnas, Dana Ron:
On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j12]Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
Testing of Clustering. SIAM Rev. 46(2): 285-308 (2004) - [i2]Michal Parnas, Dana Ron, Ronitt Rubinfeld:
Tolerant Property Testing and Distance Approximation. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j11]Michal Parnas, Dana Ron
Testing metric properties. Inf. Comput. 187(2): 155-195 (2003) - [j10]Michal Parnas, Dana Ron
Testing membership in parenthesis languages. Random Struct. Algorithms 22(1): 98-138 (2003) - [j9]Michal Parnas, Dana Ron
On Testing Convexity and Submodularity. SIAM J. Comput. 32(5): 1158-1184 (2003) - [j8]Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
Testing of Clustering. SIAM J. Discret. Math. 16(3): 393-417 (2003) - 2002
- [j7]Michal Parnas, Dana Ron
Testing the diameter of graphs. Random Struct. Algorithms 20(2): 165-183 (2002) - [j6]Michal Parnas, Dana Ron
Testing Basic Boolean Formulae. SIAM J. Discret. Math. 16(1): 20-46 (2002) - [c12]Michal Parnas, Dana Ron
On Testing Convexity and Submodularity. RANDOM 2002: 11-25 - 2001
- [j5]Omer Berkman, Michal Parnas, Yehuda Roditty:
All Cycles are Edge-Magic. Ars Comb. 59 (2001) - [j4]Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas:
Neighborhood Preserving Hashing and Approximate Queries. SIAM J. Discret. Math. 15(1): 73-85 (2001) - [c11]Michal Parnas, Dana Ron, Ronitt Rubinfeld:
Testing Parenthesis Languages. RANDOM-APPROX 2001: 261-272 - [c10]Michal Parnas, Dana Ron, Alex Samorodnitsky:
Proclaiming Dictators and Juntas or Testing Boolean Formulae. RANDOM-APPROX 2001: 273-284 - [c9]Michal Parnas, Dana Ron:
Testing metric properties. STOC 2001: 276-285 - [i1]Michal Parnas, Dana Ron, Alex Samorodnitsky:
Proclaiming Dictators and Juntas or Testing Boolean Formulae. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j3]Omer Berkman, Michal Parnas, Jirí Sgall
Efficient Dynamic Traitor Tracing. SIAM J. Comput. 30(6): 1802-1828 (2000) - [c8]Noga Alon, Seannie Dar, Michal Parnas, Dana Ron:
Testing of Clustering. FOCS 2000: 240-250 - [c7]Omer Berkman, Michal Parnas, Jirí Sgall:
Efficient dynamic traitor tracing. SODA 2000: 586-595
1990 – 1999
- 1999
- [j2]David R. Karger
Fast Connected Components Algorithms for the EREW PRAM. SIAM J. Comput. 28(3): 1021-1034 (1999) - [c6]Michal Parnas, Dana Ron
Testing the Diameter of Graphs. RANDOM-APPROX 1999: 85-96 - 1998
- [j1]Yishay Mansour, Michal Parnas:
Learning Conjunctions with Noise under Product Distributions. Inf. Process. Lett. 68(4): 189-196 (1998) - 1996
- [c5]Yishay Mansour, Michal Parnas:
On Learning Conjunctions with Malicious Noise. ISTCS 1996: 170-175 - 1994
- [b1]Michal Parnas:
Robust algorithms and data structures for information retrieval (אלגוריתמים ומבני נתונים עמידים לשליפת נתונים.). Hebrew University of Jerusalem, Israel, 1994 - [c4]Daniel H. Greene, Michal Parnas, F. Frances Yao:
Multi-Index Hashing for Information Retrieval. FOCS 1994: 722-731 - [c3]Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas:
Neighborhood Preserving Hashing and Approximate Queries. SODA 1994: 251-259 - 1993
- [c2]Danny Dolev, Yuval Harari, Michal Parnas:
Finding the Neighborhood of a Query in a Dictionary. ISTCS 1993: 33-42 - 1992
- [c1]David R. Karger
Fast Connected Components Algorithms for the EREW PRAM. SPAA 1992: 373-381
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 00:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: