Testing graph isomorphism. - Eldar Fischer; Arie Matsliah (SODA, 2006)

Testing st -Connectivity. - Sourav Chakraborty 001; Eldar Fischer; Oded Lachish; Arie Matsliah; Ilan Newman (APPROX-RANDOM, 2007)

Underapproximation for Model-Checking Based on Random Cryptographic Constructions. - Arie Matsliah; Ofer Strichman (CAV, 2007)

Approximate Hypergraph Partitioning and Applications. - Eldar Fischer; Arie Matsliah; Asaf Shapira (FOCS, 2007)

On the Query Complexity of Testing Orientations for Being Eulerian. - Eldar Fischer; Oded Lachish; Ilan Newman; Arie Matsliah; Orly Yahalom (APPROX-RANDOM, 2008)

Sound 3-Query PCPPs Are Long. - Eli Ben-Sasson; Prahladh Harsha; Oded Lachish; Arie Matsliah (ICALP (1), 2008)

Property testing and combinatorial approximation. - Arie Matsliah (2008)

Learning Parities in the Mistake-Bound model. - Harry Buhrman; David García-Soriano; Arie Matsliah (Algebraic Methods in Computational Complexity, 2009)

Hardness and Algorithms for Rainbow Connectivity. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah; Raphael Yuster (STACS, 2009)

Monotonicity Testing and Shortest-Path Routing on the Cube. - Jop Briët; Sourav Chakraborty 001; David García-Soriano; Arie Matsliah (APPROX-RANDOM, 2010)

New Results on Quantum Property Testing. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah; Ronald de Wolf (FSTTCS, 2010)

Underapproximation for model-checking based on universal circuits. - Arie Matsliah; Ofer Strichman (Inf. Comput., 2010)

Incremental formal verification of hardware. - Hana Chockler; Alexander Ivrii; Arie Matsliah; Shiri Moran; Ziv Nevo (FMCAD, 2011)

Efficient Sample Extractors for Juntas with Applications. - Sourav Chakraborty 001; David García-Soriano; Arie Matsliah (ICALP (1), 2011)

Detecting and exploiting near-sortedness for efficient relational query evaluation. - Sagi Ben-Moshe; Yaron Kanza; Eldar Fischer; Arie Matsliah; Mani Fischer; Carl Staelin (ICDT, 2011)

Query Complexity Lower Bounds for Reconstruction of Codes. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah (ICS, 2011)

Cycle Detection, Order Finding and Discrete Log with Jumps. - Sourav Chakraborty 001; David García-Soriano; Arie Matsliah (ICS, 2011)

Nearly Tight Bounds for Testing Function Isomorphism. - Sourav Chakraborty 001; David García-Soriano; Arie Matsliah (SODA, 2011)

Hardness and algorithms for rainbow connection. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah; Raphael Yuster (J. Comb. Optim., 2011)

Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. - Sourav Chakraborty 001; Eldar Fischer; David García-Soriano; Arie Matsliah (CCC, 2012)

Relating Proof Complexity Measures and Practical Hardness of SAT. - Matti Järvisalo; Arie Matsliah; Jakob Nordström; Stanislav Zivný (CP, 2012)

IC3-guided abstraction. - Jason Baumgartner; Alexander Ivrii; Arie Matsliah; Hari Mony (FMCAD, 2012)

Computing Interpolants without Proofs. - Hana Chockler; Alexander Ivrii; Arie Matsliah (Haifa Verification Conference, 2012)

On Efficient Computation of Variable MUSes. - Anton Belov; Alexander Ivrii; Arie Matsliah; João Marques-Silva 001 (SAT, 2012)

Perfect Hashing and CNF Encodings of Cardinality Constraints. - Yael Ben-Haim; Alexander Ivrii; Oded Margalit; Arie Matsliah (SAT, 2012)

Augmenting Clause Learning with Implied Literals - (Poster Presentation). - Arie Matsliah; Ashish Sabharwal; Horst Samulowitz (SAT, 2012)

On the power of conditional samples in distribution testing. - Sourav Chakraborty 001; Eldar Fischer; Yonatan Goldhirsh; Arie Matsliah (ITCS, 2013)

Using cross-entropy for satisfiability. - Hana Chockler; Alexander Ivrii; Arie Matsliah; Simone Fulvio Rollini; Natasha Sharygina (SAC, 2013)

The non-adaptive query complexity of testing k-parities. - Harry Buhrman; David García-Soriano; Arie Matsliah; Ronald de Wolf (Chic. J. Theor. Comput. Sci., 2013)

Nearly Tight Bounds for Testing Function Isomorphism. - Noga Alon; Eric Blais; Sourav Chakraborty 001; David García-Soriano; Arie Matsliah (SIAM J. Comput., 2013)