Arie Matsliah

According to our database1, Arie Matsliah authored at least 30 papers between 2006 and 2013.

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

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

On the power of conditional samples in distribution testing.
Proceedings of the Innovations in Theoretical Computer Science, 2013

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

Nearly Tight Bounds for Testing Function Isomorphism.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

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

Query Complexity Lower Bounds for Reconstruction of Codes.
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
Underapproximation for model-checking based on universal circuits.
Inf. Comput., 2010

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

Monotonicity Testing and Shortest-Path Routing on the Cube.
Proceedings of the Approximation, 2010

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

Learning Parities in the Mistake-Bound model.
Proceedings of the Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009, 2009

2008
Property testing and combinatorial approximation.
PhD thesis, 2008

Sound 3-Query PCPPs Are Long.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

On the Query Complexity of Testing Orientations for Being Eulerian.
Proceedings of the Approximation, 2008

2007
Approximate Hypergraph Partitioning and Applications.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 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

2006
Testing graph isomorphism.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006


  Loading...