Michal Parnas

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

2024

Testing Intersectingness of Uniform Families.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

2022

The Binary Rank of Circulant Block Matrices.

[BibT_eX]

[DOI]

CoRR, 2022

Circulant almost cross intersecting families.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2022

On the Binary and Boolean Rank of Regular Matrices.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Property Testing of the Boolean and Binary Rank.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

Upper Bounds on the Boolean Rank of Kronecker Products.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

On maximal isolation sets in the uniform intersection matrix.

[BibT_eX]

[DOI]

Australas. J Comb., 2020

2017

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

[BibT_eX]

[DOI]

CoRR, 2017

2005

All-port line broadcasting in highly connected graphs.

[BibT_eX]

[DOI]

Iris Gaber

Networks, 2005

On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

2004

Tolerant Property Testing and Distance Approximation

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

2003

Testing membership in parenthesis languages.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

2002

Testing Basic Boolean Formulae.

[BibT_eX]

[DOI]

Alex Samorodnitsky

SIAM J. Discret. Math., 2002

On Testing Convexity and Submodularity.

[BibT_eX]

[DOI]

Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

2001

All Cycles are Edge-Magic.

[BibT_eX]

Omer Berkman

Yehuda Roditty

Ars Comb., 2001

Testing metric properties.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Proclaiming Dictators and Juntas or Testing Boolean Formulae.

[BibT_eX]

[DOI]

Alex Samorodnitsky

Proceedings of the Approximation, 2001

Testing Parenthesis Languages.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

2000

Efficient dynamic traitor tracing.

[BibT_eX]

[DOI]

Omer Berkman

Jirí Sgall

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Testing of Clustering.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Testing the Diameter of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Randomization, 1999

1998

Learning Conjunctions with Noise under Product Distributions.

[BibT_eX]

[DOI]

Yishay Mansour

Inf. Process. Lett., 1998

1996

On Learning Conjunctions with Malicious Noise.

[BibT_eX]

Yishay Mansour

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

1994

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

[BibT_eX]

[DOI]

PhD thesis, 1994

Neighborhood Preserving Hashing and Approximate Queries.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Multi-Index Hashing for Information Retrieval

[BibT_eX]

[DOI]

Daniel H. Greene

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.

[BibT_eX]

[DOI]

Danny Dolev

Yuval Harari

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

1992

Fast Connected Components Algorithms for the EREW PRAM.

[BibT_eX]

[DOI]

David R. Karger

Noam Nisan