default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJasper Nalbach
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Jasper Nalbach
, Erika Ábrahám, Philippe Specht, Christopher W. Brown, James H. Davenport, Matthew England:
Levelwise construction of a single cylindrical algebraic cell. J. Symb. Comput. 123: 102288 (2024)- [c10]Jasper Nalbach, Erika Ábrahám:
Merging Adjacent Cells During Single Cell Construction. CASC 2024: 252-272 - [c9]Valentin Promies, Jasper Nalbach, Erika Ábrahám:
Under-Approximation of a Single Algebraic Cell (Extended Abstract). PAAR+SC²@IJCAR 2024: 132-136 - [i5]Jasper Nalbach, Gereon Kremer:
Extensions of the Cylindrical Algebraic Covering Method for Quantifiers. CoRR abs/2411.03070 (2024) - [i4]Lucas Michel, Jasper Nalbach, Pierre Mathonet, Naïm Zénaïdi, Christopher W. Brown, Erika Ábrahám, James H. Davenport, Matthew England:
On Projective Delineability. CoRR abs/2411.13300 (2024) - 2023
- [c8]Jasper Nalbach, Erika Ábrahám:
Subtropical Satisfiability for SMT Solving. NFM 2023: 430-446 - [c7]Philipp Bär, Jasper Nalbach, Erika Ábrahám, Christopher W. Brown:
Exploiting Strict Constraints in the Cylindrical Algebraic Covering. SMT 2023: 33-45 - [c6]Erika Ábrahám, Jasper Nalbach, Valentin Promies:
Automated Exercise Generation for Satisfiability Checking. FMTea 2023: 1-16 - [c5]Jasper Nalbach, Valentin Promies, Erika Ábrahám, Paul Kobialka:
FMplex: A Novel Method for Solving Linear Real Arithmetic Problems. GandALF 2023: 16-32 - [i3]Philipp Bär, Jasper Nalbach, Erika Ábrahám, Christopher W. Brown:
Exploiting Strict Constraints in the Cylindrical Algebraic Covering. CoRR abs/2306.16757 (2023) - [i2]Jasper Nalbach, Valentin Promies, Erika Ábrahám, Paul Kobialka:
FMplex: A Novel Method for Solving Linear Real Arithmetic Problems (Extended Version). CoRR abs/2309.03138 (2023) - 2022
- [c4]Gereon Kremer, Jasper Nalbach:
Cylindrical Algebraic Coverings for Quantifiers (short paper). SC-Square@FLoC 2022: 1-9 - [i1]Jasper Nalbach, Erika Ábrahám, Philippe Specht, Christopher W. Brown, James H. Davenport, Matthew England:
Levelwise construction of a single cylindrical algebraic cell. CoRR abs/2212.09309 (2022) - 2021
- [c3]Jasper Nalbach, Erika Ábrahám, Gereon Kremer:
Extending the Fundamental Theorem of Linear Programming for Strict Inequalities. ISSAC 2021: 313-320
2010 – 2019
- 2019
- [c2]Jasper Nalbach, Gereon Kremer, Erika Ábrahám:
On Variable Orderings in MCSAT for Non-Linear Real Arithmetic. SC-square@SIAM AG 2019 - 2017
- [c1]Erika Ábrahám, Jasper Nalbach, Gereon Kremer:
Embedding the Virtual Substitution Method in the Model Constructing Satisfiability Calculus Framework. SC²@ISSAC 2017
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 2025-01-20 23:58 CET 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:
