| Chronological backtracking A Nadel, V Ryvchin Theory and Applications of Satisfiability Testing–SAT 2018: 21st …, 2018 | 97 | 2018 |
| Faster extraction of high-level minimal unsatisfiable cores V Ryvchin, O Strichman International Conference on Theory and Applications of Satisfiability …, 2011 | 65 | 2011 |
| Efficient SAT solving under assumptions A Nadel, V Ryvchin International Conference on Theory and Applications of Satisfiability …, 2012 | 64 | 2012 |
| Efficient MUS extraction with resolution A Nadel, V Ryvchin, O Strichman 2013 Formal Methods in Computer-Aided Design, 197-200, 2013 | 54 | 2013 |
| Local restarts V Ryvchin, O Strichman Theory and Applications of Satisfiability Testing–SAT 2008: 11th …, 2008 | 50 | 2008 |
| Ultimately incremental SAT A Nadel, V Ryvchin, O Strichman International Conference on Theory and Applications of Satisfiability …, 2014 | 44 | 2014 |
| Bit-vector optimization A Nadel, V Ryvchin Tools and Algorithms for the Construction and Analysis of Systems: 22nd …, 2016 | 39 | 2016 |
| Maple lcm dist chronobt: Featuring chronological backtracking V Ryvchin, A Nadel Proceedings of SAT competition 2018, 2018 | 38 | 2018 |
| Accelerated deletion-based extraction of minimal unsatisfiable cores A Nadel, V Ryvchin, O Strichman Journal on Satisfiability, Boolean Modeling and Computation 9 (1), 27-51, 2014 | 35 | 2014 |
| Efficient generation of small interpolants in CNF Y Vizel, A Nadel, V Ryvchin Formal Methods in System Design 47, 51-74, 2015 | 25 | 2015 |
| Preprocessing in incremental SAT A Nadel, V Ryvchin, O Strichman Theory and Applications of Satisfiability Testing–SAT 2012: 15th …, 2012 | 23 | 2012 |
| Designers work less with quality formal equivalence checking O Cohen, M Gordon, M Lifshits, A Nadel, V Ryvchin Design and Verification Conference (DVCon), 2010 | 20 | 2010 |
| Assignment stack shrinking A Nadel, V Ryvchin International Conference on Theory and Applications of Satisfiability …, 2010 | 13 | 2010 |
| Maple LCM dist ChronoBT: featuring chronological backtracking A Nadel, V Ryvchin Proc. of SAT Competition, 29, 2018 | 8 | 2018 |
| Local restarts in SAT V Ryvchin, O Strichman Constraint Programming Letters (CPL) 4, 3-13, 2008 | 8 | 2008 |
| Mining Backbone Literals in Incremental SAT: A New Kind of Incremental Data A Ivrii, V Ryvchin, O Strichman International Conference on Theory and Applications of Satisfiability …, 2015 | 3 | 2015 |
| Hints Revealed J Kalechstain, V Ryvchin, N Dershowitz International Conference on Theory and Applications of Satisfiability …, 2015 | 2 | 2015 |
| Local search with a SAT oracle for combinatorial optimization A Cohen, A Nadel, V Ryvchin International Conference on Tools and Algorithms for the Construction and …, 2021 | 1 | 2021 |
| Core algorithms for SAT and SAT-related problems V Ryvchin Technion-Israel Institute of Technology, Faculty of Industrial and …, 2014 | 1 | 2014 |
| Using Hints to Speed-Up SAT J Kalechstain, V Ryvchin, N Dershowitz | | |
Alexander NadelReseach Scientist, Intel & Technion在 intel.com 的电子邮件经过验证
Alexander NadelReseach Scientist, Intel & Technion在 intel.com 的电子邮件经过验证
Ofer StrichmanTechnion, Haifa, Israel在 ie.technion.ac.il 的电子邮件经过验证