| Hardness and algorithms for rainbow connection S Chakraborty, E Fischer, A Matsliah, R Yuster Journal of Combinatorial Optimization 21 (3), 330-347, 2011 | 235 | 2011 |
| Incremental formal verification of hardware H Chockler, A Ivrii, A Matsliah, S Moran, Z Nevo 2011 Formal Methods in Computer-Aided Design (FMCAD), 135-143, 2011 | 77 | 2011 |
| Monotonicity testing and shortest-path routing on the cube J Briët, S Chakraborty, D García-Soriano, A Matsliah Combinatorica 32 (1), 35-53, 2012 | 62 | 2012 |
| Testing graph isomorphism E Fischer, A Matsliah SIAM Journal on Computing 38 (1), 207-225, 2008 | 59 | 2008 |
| On the power of conditional samples in distribution testing S Chakraborty, E Fischer, Y Goldhirsh, A Matsliah SIAM Journal on Computing 45 (4), 1261-1296, 2016 | 49 | 2016 |
| Relating proof complexity measures and practical hardness of SAT M Järvisalo, A Matsliah, J Nordström, S Živný International Conference on Principles and Practice of Constraint …, 2012 | 46 | 2012 |
| The non-adaptive query complexity of testing k-parities H Buhrman, D García-Soriano, A Matsliah, R de Wolf arXiv preprint arXiv:1209.3849, 2012 | 34 | 2012 |
| Efficient sample extractors for juntas with applications S Chakraborty, D García-Soriano, A Matsliah International Colloquium on Automata, Languages, and Programming, 545-556, 2011 | 32 | 2011 |
| Nearly tight bounds for testing function isomorphism S Chakraborty, D García-Soriano, A Matsliah Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011 | 32 | 2011 |
| New results on quantum property testing S Chakraborty, E Fischer, A Matsliah, R De Wolf arXiv preprint arXiv:1005.0523, 2010 | 30 | 2010 |
| Perfect hashing and CNF encodings of cardinality constraints Y Ben-Haim, A Ivrii, O Margalit, A Matsliah International Conference on Theory and Applications of Satisfiability …, 2012 | 27 | 2012 |
| Approximate hypergraph partitioning and applications E Fischer, A Matsliah, A Shapira 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 579-589, 2007 | 26 | 2007 |
| Computing interpolants without proofs H Chockler, A Ivrii, A Matsliah Haifa verification conference, 72-85, 2012 | 23 | 2012 |
| Junto-symmetric functions, hypergraph isomorphism and crunching S Chakraborty, E Fischer, D GacíaSoriano, A Matsliah 2012 IEEE 27th Conference on Computational Complexity, 148-158, 2012 | 22 | 2012 |
| Testing st-Connectivity S Chakraborty, E Fischer, O Lachish, A Matsliah, I Newman Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2007 | 21 | 2007 |
| Nearly tight bounds for testing function isomorphism N Alon, E Blais, S Chakraborty, D García-Soriano, A Matsliah SIAM Journal on Computing 42 (2), 459-493, 2013 | 19 | 2013 |
| Detecting and exploiting near-sortedness for efficient relational query evaluation S Ben-Moshe, Y Kanza, E Fischer, A Matsliah, M Fischer, C Staelin Proceedings of the 14th International Conference on Database Theory, 256-267, 2011 | 19 | 2011 |
| Sound 3-query PCPPs are long E Ben-Sasson, P Harsha, O Lachish, A Matsliah ACM Transactions on Computation Theory (TOCT) 1 (2), 1-49, 2009 | 17 | 2009 |
| Approximate hypergraph partitioning and applications E Fischer, A Matsliah, A Shapira SIAM Journal on Computing 39 (7), 3155-3185, 2010 | 15 | 2010 |
| On the query complexity of testing orientations for being Eulerian E Fischer, O Lachish, I Newman, A Matsliah, O Yahalom Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008 | 14 | 2008 |
Oded LachishBirkbeck, University of LondonZweryfikowany adres z dcs.bbk.ac.uk
