Arie Matsliah

According to our database1, Arie Matsliah authored at least 30 papers between 2007 and 2014.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Query Complexity Lower Bounds for Reconstruction of Codes.
Theory Comput., 2014

2013
Nearly Tight Bounds for Testing Function Isomorphism.
SIAM J. Comput., 2013

The non-adaptive query complexity of testing k-parities.
Chic. J. Theor. Comput. Sci., 2013

Using cross-entropy for satisfiability.
Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

2012
On the query complexity of testing orientations for being Eulerian.
ACM Trans. Algorithms, 2012

On the Power of Conditional Samples in Distribution Testing.
Electron. Colloquium Comput. Complex., 2012

Monotonicity testing and shortest-path routing on the cube.
Comb., 2012

Augmenting Clause Learning with Implied Literals - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Perfect Hashing and CNF Encodings of Cardinality Constraints.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

On Efficient Computation of Variable MUSes.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Computing Interpolants without Proofs.
Proceedings of the Hardware and Software: Verification and Testing, 2012

IC3-guided abstraction.
Proceedings of the Formal Methods in Computer-Aided Design, 2012

Relating Proof Complexity Measures and Practical Hardness of SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2012

Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching.
Proceedings of the 27th Conference on Computational Complexity, 2012

2011
Hardness and algorithms for rainbow connection.
J. Comb. Optim., 2011

Cycle Detection, Order Finding and Discrete Log with Jumps.
Proceedings of the Innovations in Computer Science, 2011

Detecting and exploiting near-sortedness for efficient relational query evaluation.
Proceedings of the Database Theory, 2011

Efficient Sample Extractors for Juntas with Applications.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Incremental formal verification of hardware.
Proceedings of the International Conference on Formal Methods in Computer-Aided Design, 2011

2010
Approximate Hypergraph Partitioning and Applications.
SIAM J. Comput., 2010

Learning parities in the mistake-bound model.
Inf. Process. Lett., 2010

Underapproximation for model-checking based on universal circuits.
Inf. Comput., 2010

Nearly Tight Bounds for Testing Function Isomorphism.
Electron. Colloquium Comput. Complex., 2010

New Results on Quantum Property Testing.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
Hardness and Algorithms for Rainbow Connectivity.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008
Property testing and combinatorial approximation.
PhD thesis, 2008

Testing Graph Isomorphism.
SIAM J. Comput., 2008

2007
Sound 3-query PCPPs are Long.
Electron. Colloquium Comput. Complex., 2007

Underapproximation for Model-Checking Based on Random Cryptographic Constructions.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

Testing <i>st</i> -Connectivity.
Proceedings of the Approximation, 2007


  Loading...