default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSven Reimer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c15]Tobias Seufert, Christoph Scholl, Arun Chandrasekharan, Sven Reimer, Tobias Welp:
Making PROGRESS in Property Directed Reachability. MBMV 2022: 1-2- [c14]Tobias Seufert
, Christoph Scholl, Arun Chandrasekharan, Sven Reimer, Tobias Welp:
Making PROGRESS in Property Directed Reachability. VMCAI 2022: 355-377
2010 – 2019
- 2018
- [c13]Tobias Paxian, Sven Reimer, Bernd Becker:
Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT. SAT 2018: 37-53 - 2017
- [c12]Ralf Wimmer, Sven Reimer, Paolo Marin, Bernd Becker:
HQSpre - An Effective Preprocessor for QBF and DQBF. TACAS (1) 2017: 373-390 - 2016
- [c11]Matthias Sauer, Jie Jiang, Sven Reimer, Kohei Miyase, Xiaoqing Wen, Bernd Becker, Ilia Polian:
On Optimal Power-Aware Path Sensitization. ATS 2016: 179-184 - 2015
- [b1]Sven Reimer:
Bekannte Unbekannte: formale Methoden in Anwesenheit unbekannter Werte. University of Freiburg, Germany, Der Andere Verlag 2015, ISBN 978-3-86247-569-8, pp. 1-174 - [j2]Dominik Erb, Michael A. Kochte, Sven Reimer, Matthias Sauer, Hans-Joachim Wunderlich, Bernd Becker:
Accurate QBF-Based Test Pattern Generation in Presence of Unknown Values. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 34(12): 2025-2038 (2015) - [c10]Karina Gitina, Ralf Wimmer, Sven Reimer, Matthias Sauer, Christoph Scholl, Bernd Becker:
Solving DQBF through quantifier elimination. DATE 2015: 1617-1622 - 2014
- [j1]Sven Reimer, Matthias Sauer, Paolo Marin, Bernd Becker:
QBF with Soft Variables. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 70 (2014) - [c9]Sven Reimer, Matthias Sauer, Tobias Schubert, Bernd Becker:
Incremental Encoding and Solving of Cardinality Constraints. ATVA 2014: 297-313 - [c8]Sven Reimer, Matthias Sauer, Tobias Schubert, Bernd Becker:
Using MaxBMC for Pareto-optimal circuit initialization. DATE 2014: 1-6 - [c7]Matthias Sauer, Sven Reimer, Sudhakar M. Reddy, Bernd Becker:
Efficient SAT-Based Circuit Initialization for Larger Designs. VLSID 2014: 62-67 - 2013
- [c6]Matthias Sauer, Sven Reimer, Ilia Polian, Tobias Schubert, Bernd Becker:
Provably optimal test cube generation using quantified boolean formula solving. ASP-DAC 2013: 533-539 - [c5]Matthias Sauer, Sven Reimer, Tobias Schubert, Ilia Polian, Bernd Becker:
Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths. DATE 2013: 448-453 - [c4]Karina Gitina, Sven Reimer, Matthias Sauer, Ralf Wimmer, Christoph Scholl, Bernd Becker:
Equivalence checking of partial designs using dependency quantified Boolean formulae. ICCD 2013: 396-403 - [c3]Karina Gitina, Sven Reimer, Matthias Sauer, Ralf Wimmer, Christoph Scholl, Bernd Becker:
Equivalence Checking for Partial Implementations Revisited. MBMV 2013: 61-70 - 2012
- [c2]Sven Reimer, Florian Pigorsch, Christoph Scholl, Bernd Becker:
Enhanced Integration of QBF Solving Techniques. MBMV 2012: 133-143 - 2011
- [c1]Sven Reimer, Florian Pigorsch, Christoph Scholl, Bernd Becker:
Integration of orthogonal QBF solving techniques. DATE 2011: 149-154
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-10-07 21:20 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:
