| 2009 |
|---|
| 10 | EE | Sourav Chakraborty,
Eldar Fischer,
Arie Matsliah,
Raphael Yuster:
Hardness and Algorithms for Rainbow Connectivity.
STACS 2009: 243-254 |
| 9 | EE | Sourav Chakraborty,
Eldar Fischer,
Arie Matsliah,
Raphael Yuster:
Hardness and Algorithms for Rainbow Connectivity
CoRR abs/0902.1255: (2009) |
| 2008 |
|---|
| 8 | EE | Eldar Fischer,
Oded Lachish,
Ilan Newman,
Arie Matsliah,
Orly Yahalom:
On the Query Complexity of Testing Orientations for Being Eulerian.
APPROX-RANDOM 2008: 402-415 |
| 7 | EE | Eli Ben-Sasson,
Prahladh Harsha,
Oded Lachish,
Arie Matsliah:
Sound 3-Query PCPPs Are Long.
ICALP (1) 2008: 686-697 |
| 6 | EE | Eldar Fischer,
Arie Matsliah:
Testing Graph Isomorphism.
SIAM J. Comput. 38(1): 207-225 (2008) |
| 2007 |
|---|
| 5 | EE | Sourav Chakraborty,
Eldar Fischer,
Oded Lachish,
Arie Matsliah,
Ilan Newman:
Testing st -Connectivity.
APPROX-RANDOM 2007: 380-394 |
| 4 | EE | Arie Matsliah,
Ofer Strichman:
Underapproximation for Model-Checking Based on Random Cryptographic Constructions.
CAV 2007: 339-351 |
| 3 | EE | Eldar Fischer,
Arie Matsliah,
Asaf Shapira:
Approximate Hypergraph Partitioning and Applications.
FOCS 2007: 579-589 |
| 2 | EE | Arie Matsliah,
Eli Ben-Sasson,
Prahladh Harsha,
Oded Lachish:
Sound 3-query PCPPs are Long.
Electronic Colloquium on Computational Complexity (ECCC) 14(127): (2007) |
| 2006 |
|---|
| 1 | EE | Eldar Fischer,
Arie Matsliah:
Testing graph isomorphism.
SODA 2006: 299-308 |
