The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |