| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 167 |       | Yinlei Yu, Cameron Brien, Sharad Malik: Exploiting Circuit Reconvergence through Static Learning in CNF SAT Solvers. VLSI Design 2008: 461-468 |
| 157 | | Yinlei Yu, Sharad Malik: Lemma Learning in SMT on Linear Constraints. SAT 2006: 142-155 |
| 152 | | Yinlei Yu, Sharad Malik: Validating the result of a Quantified Boolean Formula (QBF) solver: theory and practice. ASP-DAC 2005: 1047-1051 |
| 149 | | Zhaohui Fu, Yinlei Yu, Sharad Malik: Considering Circuit Observability Don't Cares in CNF Satisfiability. DATE 2005: 1108-1113 |
| 135 | | Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik: Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems. SAT 2004 |
| 134 | | Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik: Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems. SAT (Selected Papers 2004: 292-305 |
Selection of 6 from 188 records - Sharad Malik has 123 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page