default search action
Niklas Eén
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [c15]Geoffrey Irving, Christian Szegedy, Alexander A. Alemi, Niklas Eén, François Chollet, Josef Urban:
DeepMath - Deep Sequence Models for Premise Selection. NIPS 2016: 2235-2243 - 2015
- [c14]Niklas Eén, Alexander Legg, Nina Narodytska, Leonid Ryzhyk:
SAT-Based Strategy Extraction in Reachability Games. AAAI 2015: 3738-3745 - 2013
- [c13]Alan Mishchenko, Niklas Eén, Robert K. Brayton, Michael L. Case, Pankaj Chauhan, Nikhil Sharma:
A semi-canonical form for sequential AIGs. DATE 2013: 797-802 - [c12]Alan Mishchenko, Niklas Eén, Robert K. Brayton, Jason Baumgartner, Hari Mony, Pradeep Kumar Nalla:
GLA: gate-level abstraction revisited. DATE 2013: 1399-1404 - [c11]Koen Claessen, Niklas Eén, Baruch Sterin:
A circuit approach to LTL model checking. FMCAD 2013: 53-60 - [c10]Niklas Eén, Alan Mishchenko:
A Fast Reparameterization Procedure. DIFTS@FMCAD 2013 - 2012
- [c9]Sayak Ray, Alan Mishchenko, Niklas Eén, Robert K. Brayton, Stephen Jang, Chao Chen:
Mapping into LUT structures. DATE 2012: 1579-1584 - 2011
- [c8]Niklas Eén, Alan Mishchenko, Robert K. Brayton:
Efficient implementation of property directed reachability. FMCAD 2011: 125-134 - 2010
- [c7]Niklas Eén, Alan Mishchenko, Nina Amla:
A single-instance incremental SAT formulation of proof- and counterexample-based abstraction. FMCAD 2010: 181-188 - [i1]Niklas Eén, Alan Mishchenko, Nina Amla:
A Single-Instance Incremental SAT Formulation of Proof- and Counterexample-Based Abstraction. CoRR abs/1008.2021 (2010)
2000 – 2009
- 2009
- [j2]Koen Claessen, Niklas Eén, Mary Sheeran, Niklas Sörensson, Alexey Voronov
, Knut Åkesson:
SAT-Solving in Practice, with a Tutorial Example from Supervisory Control. Discret. Event Dyn. Syst. 19(4): 495-524 (2009) - 2007
- [c6]Niklas Eén, Alan Mishchenko, Niklas Sörensson:
Applying Logic Synthesis for Speeding Up SAT. SAT 2007: 272-286 - 2006
- [j1]Niklas Eén, Niklas Sörensson:
Translating Pseudo-Boolean Constraints into SAT. J. Satisf. Boolean Model. Comput. 2(1-4): 1-26 (2006) - [c5]Alan Mishchenko, Satrajit Chatterjee, Robert K. Brayton, Niklas Eén:
Improvements to combinational equivalence checking. ICCAD 2006: 836-843 - 2005
- [b1]Niklas Eén:
SAT Based Model Checking. Chalmers University of Technology, Gothenburg, Sweden, 2005 - [c4]Niklas Eén, Armin Biere:
Effective Preprocessing in SAT Through Variable and Clause Elimination. SAT 2005: 61-75 - 2003
- [c3]Niklas Eén, Niklas Sörensson:
An Extensible SAT-solver. SAT 2003: 502-518 - [c2]Niklas Eén, Niklas Sörensson:
Temporal induction by incremental SAT solving. BMC@CAV 2003: 543-560 - 2000
- [c1]Parosh Aziz Abdulla, Per Bjesse, Niklas Eén:
Symbolic Reachability Analysis Based on SAT-Solvers. TACAS 2000: 411-425
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: