Laurent Simon

Computational Theory and Mathematics · 2009–2013

A researcher in the Science corpus: 2 papers; trusts 9 researchers and is trusted by 7 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 11 citations into it; #5,637 of 12,182 by trust here, #9,306 by citations
• Artificial Intelligence — 7 citations into it; #17,386 of 35,345 by trust here, #30,347 by citations
• Computer Networks and Communications — 6 citations into it

Whom Laurent Simon trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Niklas Eén
2. Lintao Zhang
3. Matthew W. Moskewicz
4. Niklas Sörensson
5. Sharad Malik
6. E. Goldberg
7. Zhaohui Fu
8. Gilles Audemard
9. Armin Biere

Who trusts Laurent Simon overall

1. Alexey Ignatiev
2. Nina Narodytska
3. Ruben Martins
4. J. Berg
5. Gilles Audemard
6. Vasco M. Manquinho
7. Jinqiang Yu

Papers from Laurent Simon's perspective

Ordered by how strongly the researchers Laurent Simon trusts endorse each paper. Same corpus, a different order for every researcher.

1. A machine program for theorem-proving (CACM)
2. Temporal induction by incremental SAT solving (BMC@CAV)
3. Cha : Engineering an e cient SAT solver (Design Automation Conference)
4. Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems (Journal of automated reasoning)
5. Efficient conflict driven learning in a Boolean satisfiability solver (IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281))
6. BerkMin: A fast and robust SAT-solver (Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition)
7. Effective Preprocessing in SAT Through Variable and Clause Elimination (International Conference on Theory and Applications of Satisfiability Testing)
8. Predicting Learnt Clauses Quality in Modern SAT Solvers
9. On Solving the Partial MAX-SAT Problem (International Conference on Theory and Applications of Satisfiability Testing)
10. An Extensible SAT-solver (International Conference on Theory and Applications of Satisfiability Testing)

Their papers

• Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction (2013) — 142 citations
• Predicting Learnt Clauses Quality in Modern SAT Solvers (2009) — 726 citations