|
Search the dblp DataBase
Knot Pipatsrisawat:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Knot Pipatsrisawat, Adnan Darwiche
A Lightweight Component Caching Scheme for Satisfiability Solvers. [Citation Graph (0, 0)][DBLP] SAT, 2007, pp:294-299 [Conf]
A New Clause Learning Scheme for Efficient Unsatisfiability Proofs. [Citation Graph (, )][DBLP]
New Compilation Languages Based on Structured Decomposability. [Citation Graph (, )][DBLP]
Clone: Solving Weighted Max-SAT in a Reduced Search Space. [Citation Graph (, )][DBLP]
On the Power of Clause-Learning SAT Solvers with Restarts. [Citation Graph (, )][DBLP]
Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications. [Citation Graph (, )][DBLP]
On Decomposability and Interaction Functions. [Citation Graph (, )][DBLP]
A New d-DNNF-Based Bound Computation Algorithm for Functional E-MAJSAT. [Citation Graph (, )][DBLP]
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers. [Citation Graph (, )][DBLP]
Efficient Genome Wide Tagging by Reduction to SAT. [Citation Graph (, )][DBLP]
Optimal algorithms for haplotype assembly from whole-genome sequence data. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
|