Jean-Marie Lagniez

Computational Theory and Mathematics · 2013

A researcher in the Science corpus: 1 paper; trusts 8 researchers and is trusted by 7 researchers here, as inferred from the citation graph.

Subfields

Whom Jean-Marie Lagniez trusts overall

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

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

Who trusts Jean-Marie Lagniez overall

  1. Alexey Ignatiev
  2. Jinqiang Yu
  3. Ruben Martins

Papers from Jean-Marie Lagniez's perspective

Ordered by how strongly the researchers Jean-Marie Lagniez 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. Chaff: engineering an efficient SAT solver (Proceedings - Design Automation Conference)
  4. BerkMin: A fast and robust SAT-solver (Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition)
  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. Predicting Learnt Clauses Quality in Modern SAT Solvers
  7. On Solving the Partial MAX-SAT Problem (International Conference on Theory and Applications of Satisfiability Testing)
  8. An Extensible SAT-solver (International Conference on Theory and Applications of Satisfiability Testing)
  9. GRASP: A Search Algorithm for Propositional Satisfiability
  10. Cha : Engineering an e cient SAT solver (Design Automation Conference)

Their papers