( en | de | ru )

 

Disambiguation of "Parnas, Michal"

Author of the publication

copydeleteadd this publication to your clipboard
Tolerant property testing and distance approximation

, , and . J. Comput. Syst. Sci., 72 (6): 1012-1042 (2006)
DOI: 10.1016/j.jcss.2006.03.002

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michal Novotny

Michal Fic

Michal Pejko

Michal Olszewski

Michal Ratajski

 

Other publications of authors with the same name

Learning Conjunctions with Noise under Product Distributions., and . Inf. Process. Lett., 68 (4): 189-196 (1998)The Augmentation Property of Binary Matrices for the Binary and Boolean Rank., and . CoRR, (2017)Testing Parenthesis Languages., , and . RANDOM-APPROX, volume 2129 of Lecture Notes in Computer Science, page 261-272. Springer, (2001)Testing Intersectingness of Uniform Families., and . CoRR, (2024)Neighborhood Preserving Hashing and Approximate Queries., , , , and . SODA, page 251-259. ACM/SIAM, (1994)Multi-Index Hashing for Information Retrieval, , and . FOCS, page 722-731. IEEE Computer Society, (1994)Testing of Clustering., , , and . SIAM J. Discret. Math., 16 (3): 393-417 (2003)On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms, and . Electron. Colloquium Comput. Complex., (2005)On Testing Convexity and Submodularity., , and . RANDOM, volume 2483 of Lecture Notes in Computer Science, page 11-25. Springer, (2002)On the Binary and Boolean Rank of Regular Matrices., and . MFCS, volume 241 of LIPIcs, page 56:1-56:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)