default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Dolzmann
Person information
- affiliation: Schloss Dagstuhl - Leibniz Center for Informatics, Germany
- affiliation: University of Passau, Faculty of Computer Science and Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j6]Marek Kosta, Thomas Sturm
, Andreas Dolzmann:
Better answers to real questions. J. Symb. Comput. 74: 255-275 (2016)- 2015
- [i1]Marek Kosta, Thomas Sturm, Andreas Dolzmann:
Better Answers to Real Questions. CoRR abs/1501.05098 (2015) - 2014
- [c10]Marek Kosta, Thomas Sturm, Andreas Dolzmann:
Better Answers to Real Questions. SMT 2014: 69
2000 – 2009
- 2007
- [j5]Andreas Dolzmann, Volker Weispfenning:
Multiple object semilinear motion planning. J. Symb. Comput. 42(3): 324-337 (2007) - 2006
- [j4]Andreas Dolzmann, Thomas Sturm:
Editorial. J. Symb. Comput. 41(11): 1155-1156 (2006) - 2005
- [e1]Andreas Dolzmann, Andreas Seidl, Thomas Sturm:
Algorithmic Algebra and Logic. Proceedings of the A3L 2005, April 3-6, Passau, Germany; Conference in Honor of the 60th Birthday of Volker Weispfenning. Books on Demand 2005, ISBN 3-8334-2669-1, pp. i-xii, 1-558 [contents] - 2004
- [c9]Andreas Dolzmann, Lorenz A. Gilch:
Generic Hermitian Quantifier Elimination. AISC 2004: 80-93 - [c8]Andreas Dolzmann, Andreas Seidl, Thomas Sturm:
Efficient projection orders for CAD. ISSAC 2004: 111-118 - 2001
- [c7]Andreas Dolzmann, Thomas Sturm:
Parametric Systems of Linear Congruences. CASC 2001: 149-166 - 2000
- [b1]Andreas Dolzmann:
Algorithmic strategies for applicable real quantifier elimination. University of Passau, Germany, 2000 - [c6]Andreas Dolzmann, Volker Weispfenning:
Local quantifier elimination. ISSAC 2000: 86-94 - [p1]Andreas Dolzmann:
Algorithmische Strategien für anwendbare reelle Quantorenelimination. Ausgezeichnete Informatikdissertationen 2000: 43-52
1990 – 1999
- 1999
- [c5]Andreas Dolzmann, Thomas Sturm:
P-adic Constraint Solving. ISSAC 1999: 151-158 - 1998
- [j3]Andreas Dolzmann, Thomas Sturm, Volker Weispfenning:
A New Approach for Automatic Theorem Proving in Real Geometry. J. Autom. Reason. 21(3): 357-380 (1998) - [c4]Andreas Dolzmann:
Solving Geometric Problems with Real Quantifier Elimination. Automated Deduction in Geometry 1998: 14-29 - [c3]Andreas Dolzmann, Oliver Gloor, Thomas Sturm:
Approaches to Parallel Quantifier Elimination. ISSAC 1998: 88-95 - 1997
- [j2]Andreas Dolzmann, Thomas Sturm:
REDLOG: computer algebra meets computer logic. SIGSAM Bull. 31(2): 2-9 (1997) - [j1]Andreas Dolzmann, Thomas Sturm:
Simplification of Quantifier-Free Formulae over Ordered Fields. J. Symb. Comput. 24(2): 209-231 (1997) - [c2]Andreas Dolzmann, Thomas Sturm, Volker Weispfenning:
Real Quantifier Elimination in Practice. Algorithmic Algebra and Number Theory 1997: 221-247 - [c1]Andreas Dolzmann, Thomas Sturm:
Guarded Expressions in Practice. ISSAC 1997: 376-383
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-09 13:23 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:
