2007 |
29 | EE | 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 |
28 | EE | Michal Parnas,
Dana Ron,
Ronitt Rubinfeld:
Tolerant property testing and distance approximation.
J. Comput. Syst. Sci. 72(6): 1012-1042 (2006) |
2005 |
27 | EE | Michal Parnas,
Dana Ron:
On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms
Electronic Colloquium on Computational Complexity (ECCC)(094): (2005) |
26 | EE | Iris Gaber,
Michal Parnas:
All-port line broadcasting in highly connected graphs.
Networks 45(2): 95-103 (2005) |
2004 |
25 | EE | Michal Parnas,
Dana Ron,
Ronitt Rubinfeld:
Tolerant Property Testing and Distance Approximation
Electronic Colloquium on Computational Complexity (ECCC)(010): (2004) |
2003 |
24 | EE | Michal Parnas,
Dana Ron:
Testing metric properties.
Inf. Comput. 187(2): 155-195 (2003) |
23 | EE | Michal Parnas,
Dana Ron,
Ronitt Rubinfeld:
Testing membership in parenthesis languages.
Random Struct. Algorithms 22(1): 98-138 (2003) |
22 | EE | Michal Parnas,
Dana Ron,
Ronitt Rubinfeld:
On Testing Convexity and Submodularity.
SIAM J. Comput. 32(5): 1158-1184 (2003) |
21 | EE | Noga Alon,
Seannie Dar,
Michal Parnas,
Dana Ron:
Testing of Clustering.
SIAM J. Discrete Math. 16(3): 393-417 (2003) |
2002 |
20 | EE | Michal Parnas,
Dana Ron,
Ronitt Rubinfeld:
On Testing Convexity and Submodularity.
RANDOM 2002: 11-25 |
19 | | Michal Parnas,
Dana Ron:
Testing the diameter of graphs.
Random Struct. Algorithms 20(2): 165-183 (2002) |
18 | EE | Michal Parnas,
Dana Ron,
Alex Samorodnitsky:
Testing Basic Boolean Formulae.
SIAM J. Discrete Math. 16(1): 20-46 (2002) |
2001 |
17 | EE | Michal Parnas,
Dana Ron,
Ronitt Rubinfeld:
Testing Parenthesis Languages.
RANDOM-APPROX 2001: 261-272 |
16 | EE | Michal Parnas,
Dana Ron,
Alex Samorodnitsky:
Proclaiming Dictators and Juntas or Testing Boolean Formulae.
RANDOM-APPROX 2001: 273-284 |
15 | EE | Michal Parnas,
Dana Ron:
Testing metric properties.
STOC 2001: 276-285 |
14 | | Omer Berkman,
Michal Parnas,
Yehuda Roditty:
All Cycles are Edge-Magic.
Ars Comb. 59: (2001) |
13 | EE | Michal Parnas,
Dana Ron,
Alex Samorodnitsky:
Proclaiming Dictators and Juntas or Testing Boolean Formulae
Electronic Colloquium on Computational Complexity (ECCC) 8(063): (2001) |
12 | EE | Danny Dolev,
Yuval Harari,
Nathan Linial,
Noam Nisan,
Michal Parnas:
Neighborhood Preserving Hashing and Approximate Queries.
SIAM J. Discrete Math. 15(1): 73-85 (2001) |
2000 |
11 | | Noga Alon,
Seannie Dar,
Michal Parnas,
Dana Ron:
Testing of Clustering.
FOCS 2000: 240-250 |
10 | EE | Omer Berkman,
Michal Parnas,
Jiri Sgall:
Efficient dynamic traitor tracing.
SODA 2000: 586-595 |
9 | EE | Omer Berkman,
Michal Parnas,
Jiri Sgall:
Efficient Dynamic Traitor Tracing.
SIAM J. Comput. 30(6): 1802-1828 (2000) |
1999 |
8 | | Michal Parnas,
Dana Ron:
Testing the Diameter of Graphs.
RANDOM-APPROX 1999: 85-96 |
7 | | David R. Karger,
Noam Nisan,
Michal Parnas:
Fast Connected Components Algorithms for the EREW PRAM.
SIAM J. Comput. 28(3): 1021-1034 (1999) |
1998 |
6 | EE | Yishay Mansour,
Michal Parnas:
Learning Conjunctions with Noise under Product Distributions.
Inf. Process. Lett. 68(4): 189-196 (1998) |
1996 |
5 | | Yishay Mansour,
Michal Parnas:
On Learning Conjunctions with Malicious Noise.
ISTCS 1996: 170-175 |
1994 |
4 | | Daniel H. Greene,
Michal Parnas,
F. Frances Yao:
Multi-Index Hashing for Information Retrieval
FOCS 1994: 722-731 |
3 | | Danny Dolev,
Yuval Harari,
Nathan Linial,
Noam Nisan,
Michal Parnas:
Neighborhood Preserving Hashing and Approximate Queries.
SODA 1994: 251-259 |
1993 |
2 | | Danny Dolev,
Yuval Harari,
Michal Parnas:
Finding the Neighborhood of a Query in a Dictionary.
ISTCS 1993: 33-42 |
1992 |
1 | EE | David R. Karger,
Noam Nisan,
Michal Parnas:
Fast Connected Components Algorithms for the EREW PRAM.
SPAA 1992: 373-381 |