Selected Publications

1. Testing properties of Metrics.
   Michal Parnas, Dana Ron.
   33’rd Annual ACM Symposium on the Theory of Computing, 2001.
   
   
2. Proclaiming Dictators and Juntas or Testing Boolean Formulae.
   Michal Parnas, Dana Ron, Alex Samorodnitsky.
   RANDOM-APPROX  2001.
   
   
3. Testing Parenthesis Languages.
   Michal Parnas, Dana Ron, Ronitt Rubinfled.
   RANDOM-APPROX  2001.
   
   
4. Efficient Dynamic Traitor Tracing

Omer Berkman, Michal Parnas, Jiri Sgall,
SIAM Journal on Computing, Volume 30, Number 6, 2001,
and 11’th Annual ACM Symposium On Discrete Algorithms,  2000.
 
5. Testing of Clustering

Noga Alon, Seannie Dar, Michal Parnas, Dana Ron.
41’st Symposium on Foundations of Computer Science, 2000.
 
6. Testing the Diameter of Graphs

Michal Parnas, Dana Ron.
Randomization, Approximation and Combinatorial Optimization,
Algorithms and Techniques, 1999.
 
7. Learning Conjunctions with Noise undr Product Distributions.

Yishay Mansour, Michal Parnas.
 Information Processing Letters Volume 68, Number 4, 1998.
 
8. Multi-Index Hashing for Information Retrieval

D.Greene, M.Parnas, F.Yao.
35’th Symposium on Foundations of Computer Science, 1994.
 
9. Neighborhood Preserving Hashing and Approximate Queries.

D.Dolev, Y.Harari, N.Linial, N.Nisan, M.Parnas.
SIAM Journal on Discrete Mathematics, Volume 15, Number 1,  2002,
and 5’th Annual ACM Symposium On Discrete Algorithms, 1994.
 
10. Fast Connected Components Algorithms for the EREW PRAM.

 David Karger, Noam Nisan, Michal Parnas.
 SIAM Journal on Computing, Volume 28, Number 3, 1999,
 and  4’th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992.