Arie Matsliah's homepage



Contact info:

  • Email: arie.matsliah@gmail.com

    Affiliation:

  • IBM Research - Haifa, and partly Technion CS

    Fields of interest:

  • Theoretical CS, probability theory and combinatorics; in particular testing, learning, and approximation algorithms
  • SAT solvers and formal verification

    TAing, Technion 2004-2008:

  • Spring 2006,7,8:     Introduction to Computer Science
  • Winter 2005,7:       Probabilistic Methods and Algorithms
  • Winter 2006:           Signal and Image Processing
  • Spring 2004,5:       Introduction to Computer Networks

    Conference publications:

    Incremental Formal Verification of Hardware Efficient Sample Extractors for Juntas with Applications Detecting and Exploiting Near-Sortedness for Efficient Relational Query Evaluation Nearly Tight Bounds on Testing Function Isomorphism Cycle Detection, Order Finding and Discrete Log with Jumps Query Complexity Lower Bounds for Reconstruction of Codes New Results on Quantum Property Testing Monotonicity Testing and Shortest-Path Routing on the Cube Hardness and Algorithms for Rainbow Connectivity Sound 3-Query PCPPs Are Long On the Query Complexity of Testing for Eulerian Orientations Approximate Hypergraph Partitioning and Applications Underapproximation for Model-Checking Based on Universal Circuits Testing ST connectivity Testing Graph Isomorphism On the Complexity of Physical Problems and a Swarm Algorithm for $k$-Clique Search in Physical Graphs

    Journal publications:

    Learning Parities in the Mistake-Bound Model Monotonicity Testing and Shortest-Path Routing on the Cube Hardness and Algorithms for Rainbow Connectivity Approximate Hypergraph Partitioning and Applications On the Query Complexity of Testing for Eulerian Orientations Underapproximation for Model-Checking Based on Universal Circuits Sound 3-Query PCPPs Are Long Testing Graph Isomorphism

    Ph.D. thesis:

    Property Testing and Combinatorial Approximation


    Copyrights:*

    Almost without exception, all publications are the copyright of the journal and/or proceeding publishers in which they appeared (and posting the versions here is within the generally acceptable practice for published articles). One notable exception is the open-content Theory of Computing journal that does not require a copyright transfer.
    * Even this disclaimer itself is not mine - it was copied from Eldar Fischer's homepage


    eXTReMe Tracker