List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Nearly tight bounds for testing function isomorphism | 2017-09-29 | Paper |
| On the power of conditional samples in distribution testing Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
| On the power of conditional samples in distribution testing SIAM Journal on Computing | 2016-08-16 | Paper |
| Sound 3-query PCPPs are long ACM Transactions on Computation Theory | 2015-09-24 | Paper |
| Hardness and algorithms for rainbow connection Journal of Combinatorial Optimization | 2015-08-24 | Paper |
| Query complexity lower bounds for reconstruction of codes Theory of Computing | 2015-02-03 | Paper |
| On the query complexity of testing orientations for being Eulerian ACM Transactions on Algorithms | 2014-09-09 | Paper |
| scientific article; zbMATH DE number 6292744 (Why is no real title available?) Chicago Journal of Theoretical Computer Science | 2014-05-07 | Paper |
| On efficient computation of variable MUSes Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
| Perfect hashing and CNF encodings of cardinality constraints Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
| Nearly tight bounds for testing function isomorphism SIAM Journal on Computing | 2013-07-24 | Paper |
| Learning parities in the mistake-bound model Information Processing Letters | 2013-04-04 | Paper |
| Monotonicity testing and shortest-path routing on the cube Combinatorica | 2012-09-18 | Paper |
| New results on quantum property testing | 2012-08-29 | Paper |
| Hardness and Algorithms for Rainbow Connectivity | 2012-04-24 | Paper |
| Efficient sample extractors for juntas with applications Automata, Languages and Programming | 2011-07-06 | Paper |
| Approximate hypergraph partitioning and applications SIAM Journal on Computing | 2011-04-04 | Paper |
| Monotonicity testing and shortest-path routing on the cube Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
| Testing graph isomorphism Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| Underapproximation for model-checking based on universal circuits Information and Computation | 2010-04-08 | Paper |
| Testing Graph Isomorphism SIAM Journal on Computing | 2009-03-16 | Paper |
| Testing st-Connectivity Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
| On the Query Complexity of Testing Orientations for Being Eulerian Lecture Notes in Computer Science | 2008-11-27 | Paper |
| Sound 3-Query PCPPs Are Long Automata, Languages and Programming | 2008-08-28 | Paper |
| Underapproximation for Model-Checking Based on Random Cryptographic Constructions Computer Aided Verification | 2007-11-29 | Paper |
Research outcomes over time
This page was built for person: Arie Matsliah
