Search the dblp DataBase
Lintao Zhang :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Lintao Zhang Solving QBF by Combining Conjunctive and Disjunctive Normal Forms. [Citation Graph (0, 0)][DBLP ] AAAI, 2006, pp:- [Conf ] Lintao Zhang , Sharad Malik The Quest for Efficient Boolean Satisfiability Solvers. [Citation Graph (0, 0)][DBLP ] CADE, 2002, pp:295-313 [Conf ] Thomas Ball , Byron Cook , Shuvendu K. Lahiri , Lintao Zhang Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement. [Citation Graph (0, 0)][DBLP ] CAV, 2004, pp:457-461 [Conf ] Lintao Zhang , Sharad Malik The Quest for Efficient Boolean Satisfiability Solvers. [Citation Graph (0, 0)][DBLP ] CAV, 2002, pp:17-36 [Conf ] Lintao Zhang , Sharad Malik Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation. [Citation Graph (0, 0)][DBLP ] CP, 2002, pp:200-215 [Conf ] Malay K. Ganai , Pranav Ashar , Aarti Gupta , Lintao Zhang , Sharad Malik Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver. [Citation Graph (0, 0)][DBLP ] DAC, 2002, pp:747-750 [Conf ] Matthew W. Moskewicz , Conor F. Madigan , Ying Zhao , Lintao Zhang , Sharad Malik Chaff: Engineering an Efficient SAT Solver. [Citation Graph (0, 0)][DBLP ] DAC, 2001, pp:530-535 [Conf ] Lintao Zhang , Sharad Malik Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications. [Citation Graph (0, 0)][DBLP ] DATE, 2003, pp:10880-10885 [Conf ] Aarti Gupta , Zijiang Yang , Pranav Ashar , Lintao Zhang , Sharad Malik Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs. [Citation Graph (0, 0)][DBLP ] ICCAD, 2001, pp:286-292 [Conf ] Lintao Zhang , Sharad Malik Conflict driven learning in a quantified Boolean Satisfiability solver. [Citation Graph (0, 0)][DBLP ] ICCAD, 2002, pp:442-449 [Conf ] Lintao Zhang , Conor F. Madigan , Matthew W. Moskewicz , Sharad Malik Efficient Conflict Driven Learning in Boolean Satisfiability Solver. [Citation Graph (0, 0)][DBLP ] ICCAD, 2001, pp:279-285 [Conf ] Lidong Zhou , Lintao Zhang , Frank McSherry , Nicole Immorlica , Manuel Costa , Steve Chien A First Look at Peer-to-Peer Worms: Threats and Defenses. [Citation Graph (0, 0)][DBLP ] IPTPS, 2005, pp:24-35 [Conf ] Lucas Bordeaux , Lintao Zhang A solver for quantified Boolean and linear constraints. [Citation Graph (0, 0)][DBLP ] SAC, 2007, pp:321-325 [Conf ] Darko Marinov , Sarfraz Khurshid , Suhabe Bugrara , Lintao Zhang , Martin C. Rinard Optimizations for Compiling Declarative Models into Boolean Formulas. [Citation Graph (0, 0)][DBLP ] SAT, 2005, pp:187-202 [Conf ] Ilya Mironov , Lintao Zhang Applications of SAT Solvers to Cryptanalysis of Hash Functions. [Citation Graph (0, 0)][DBLP ] SAT, 2006, pp:102-115 [Conf ] Lintao Zhang On Subsumption Removal and On-the-Fly CNF Simplification. [Citation Graph (0, 0)][DBLP ] SAT, 2005, pp:482-489 [Conf ] Lintao Zhang , Sharad Malik Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms. [Citation Graph (0, 0)][DBLP ] SAT, 2003, pp:287-298 [Conf ] Manuel Costa , Jon Crowcroft , Miguel Castro , Antony I. T. Rowstron , Lidong Zhou , Lintao Zhang , Paul Barham Vigilante: end-to-end containment of internet worms. [Citation Graph (0, 0)][DBLP ] SOSP, 2005, pp:133-147 [Conf ] Lucas Bordeaux , Youssef Hamadi , Lintao Zhang Propositional Satisfiability and Constraint Programming: A comparative survey. [Citation Graph (0, 0)][DBLP ] ACM Comput. Surv., 2006, v:38, n:4, pp:- [Journal ] Manuel Costa , Miguel Castro , Lidong Zhou , Lintao Zhang , Marcus Peinado Bouncer: securing software by blocking bad input. [Citation Graph (0, 0)][DBLP ] SOSP, 2007, pp:117-130 [Conf ] A practical reconfigurable hardware accelerator for Boolean satisfiability solvers. [Citation Graph (, )][DBLP ] MODIST: Transparent Model Checking of Unmodified Distributed Systems. [Citation Graph (, )][DBLP ] Designing an Efficient Hardware Implication Accelerator for SAT Solving. [Citation Graph (, )][DBLP ] Boolean satisfiability from theoretical hardness to practical success. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.004secs