Travelled to:1 × France
1 × Italy
1 × Portugal
1 × United Kingdom
2 × Germany
Collaborated with:A.Mishchenko N.Sörensson R.K.Brayton A.Biere P.A.Abdulla P.Bjesse J.Baumgartner H.Mony P.K.Nalla M.L.Case P.Chauhan N.Sharma S.Ray S.Jang C.Chen
Talks about:sat (4) solver (2) preprocess (1) synthesi (1) structur (1) sequenti (1) reachabl (1) abstract (1) variabl (1) revisit (1)
Person: Niklas Eén
DBLP: E=eacute=n:Niklas
Contributed to:
20132012
200720052003
2000Wrote 7 papers:
- DATE-2013-MishchenkoEBBMN #abstraction #named #revisited
- GLA: gate-level abstraction revisited (AM, NE, RKB, JB, HM, PKN), pp. 1399–1404.
- DATE-2013-MishchenkoEBCCS
- A semi-canonical form for sequential AIGs (AM, NE, RKB, MLC, PC, NS), pp. 797–802.
- DATE-2012-RayMEBJC
- Mapping into LUT structures (SR, AM, NE, RKB, SJ, CC), pp. 1579–1584.
- SAT-2007-EenMS #logic #satisfiability #synthesis
- Applying Logic Synthesis for Speeding Up SAT (NE, AM, NS), pp. 272–286.
- SAT-2005-EenB #effectiveness #preprocessor #satisfiability
- Effective Preprocessing in SAT Through Variable and Clause Elimination (NE, AB), pp. 61–75.
- SAT-2003-EenS
- An Extensible SAT-solver (NE, NS), pp. 502–518.
- TACAS-2000-AbdullaBE #analysis #reachability
- Symbolic Reachability Analysis Based on SAT-Solvers (PAA, PB, NE), pp. 411–425.