Niklas Sörensson

Computational Theory and Mathematics · 2003–2006

A researcher in the Science corpus: 4 papers; trusts 5 researchers and is trusted by 68 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 12 citations into it; #269 of 12,182 by trust here, #1,027 by citations
• Computer Networks and Communications — 5 citations into it; #267 of 9,886 by trust here, #1,395 by citations

Whom Niklas Sörensson trusts overall

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

1. Niklas Eén
2. Carsten Sinz
3. Matthew W. Moskewicz
4. Donald Ervin Knuth

Who trusts Niklas Sörensson overall

1. Martin Gebser
2. Frank Hutter
3. Alexey Ignatiev
4. Gilles Audemard
5. Emina Torlak
6. Armin Biere
7. Jessica Davies
8. Benjamin Kaufmann
9. António Morgado
10. J. Berg

Papers from Niklas Sörensson's perspective

Ordered by how strongly the researchers Niklas Sörensson trusts endorse each paper. Same corpus, a different order for every researcher.

1. On the Complexity of Derivation in Propositional Calculus
2. Efficient CNF Encoding of Boolean Cardinality Constraints
3. A machine program for theorem-proving (CACM)
4. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
5. Cha : Engineering an e cient SAT solver (Design Automation Conference)
6. Temporal induction by incremental SAT solving (BMC@CAV)
7. The Art of Computer Programming: Volume 3: Sorting and Searching
8. A Structure-Preserving Clause Form Translation
9. GRASP: A Search Algorithm for Propositional Satisfiability
10. Chaff: engineering an efficient SAT solver (Proceedings - Design Automation Conference)

Their papers

• An Extensible SAT-solver (2003) — 3,398 citations
• Temporal induction by incremental SAT solving (2003) — 460 citations
• Translating Pseudo-Boolean Constraints into SAT (2006) — 721 citations
• MiniSat v1.13 - A SAT Solver with Conflict-Clause Minimization (2005) — 310 citations