default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVolker Weispfenning
Person information
- affiliation: University of Passau, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j25]Scott McCallum
, Volker Weispfenning:
Deciding polynomial-transcendental problems. J. Symb. Comput. 47(1): 16-31 (2012)
2000 – 2009
- 2008
- [c25]Melanie Achatz, Scott McCallum, Volker Weispfenning:
Deciding polynomial-exponential problems. ISSAC 2008: 215-222 - 2007
- [j24]Andreas Dolzmann, Volker Weispfenning:
Multiple object semilinear motion planning. J. Symb. Comput. 42(3): 324-337 (2007) - [c24]Volker Weispfenning:
Robust Stability for Parametric Linear ODEs. CASC 2007: 402-422 - 2006
- [j23]Volker Weispfenning:
Comprehensive Gröbner bases and regular rings. J. Symb. Comput. 41(3-4): 285-296 (2006) - 2005
- [c23]Volker Weispfenning:
Model Theory of Lattice Products. Algorithmic Algebra and Logic 2005: 315-554 - [c22]Volker Weispfenning:
Solving Linear Differential Problems with Parameters. CASC 2005: 469-488 - 2004
- [c21]Volker Weispfenning:
Solving Constraints by Elimination Methods. IJCAR 2004: 336-341 - 2003
- [j22]Volker Weispfenning:
Canonical comprehensive Gröbner bases. J. Symb. Comput. 36(3-4): 669-683 (2003) - 2002
- [c20]Volker Weispfenning:
Canonical comprehensive Gröbner bases. ISSAC 2002: 270-276 - 2001
- [j21]Volker Weispfenning:
Semilinear Motion Planning in REDLOG. Appl. Algebra Eng. Commun. Comput. 12(6): 455-475 (2001) - [c19]Volker Weispfenning:
Semilinear Motion Planning Among Moving Objects in REDLOG. CASC 2001: 541-553 - [c18]Hirokazu Anai, Volker Weispfenning:
Reach Set Computations Using Real Quantifier Elimination. HSCC 2001: 63-76 - [p1]Alexander Bockmayr, Volker Weispfenning:
Solving Numerical Constraints. Handbook of Automated Reasoning 2001: 751-842 - 2000
- [j20]Volker Weispfenning:
Deciding linear-exponential problems. SIGSAM Bull. 34(1): 30-31 (2000) - [c17]Hirokazu Anai, Volker Weispfenning:
Deciding linear-trigonometric problems. ISSAC 2000: 14-22 - [c16]Andreas Dolzmann, Volker Weispfenning:
Local quantifier elimination. ISSAC 2000: 86-94
1990 – 1999
- 1999
- [c15]Volker Weispfenning:
Mixed Real-Integer Linear Quantifier Elimination. ISSAC 1999: 129-136 - 1998
- [j19]Andreas Dolzmann, Thomas Sturm, Volker Weispfenning:
A New Approach for Automatic Theorem Proving in Real Geometry. J. Autom. Reason. 21(3): 357-380 (1998) - [e1]Volker Weispfenning, Barry M. Trager:
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC '98, Rostock, Germany, August 13-15, 1998. ACM 1998, ISBN 1-58113-002-3 [contents] - 1997
- [j18]Volker Weispfenning:
Quantifier Elimination for Real Algebra - the Quadratic Case and Beyond. Appl. Algebra Eng. Commun. Comput. 8(2): 85-101 (1997) - [j17]Volker Weispfenning:
Simulation and Optimization by Quantifier Elimination. J. Symb. Comput. 24(2): 189-208 (1997) - [c14]Andreas Dolzmann, Thomas Sturm, Volker Weispfenning:
Real Quantifier Elimination in Practice. Algorithmic Algebra and Number Theory 1997: 221-247 - [c13]Volker Weispfenning:
Complexity and Uniformity of Elimination in Presburger Arithmetic. ISSAC 1997: 48-53 - 1996
- [c12]Thomas Sturm, Volker Weispfenning:
Computational Geometry Problems in REDLOG. Automated Deduction in Geometry 1996: 58-86 - 1994
- [c11]Volker Weispfenning:
Quantifier Elimination for Real Algebra - the Cubic Case. ISSAC 1994: 258-263 - 1993
- [b1]Thomas Becker, Volker Weispfenning, Heinz Kredel:
Gröbner bases - a computational approach to commutative algebra. Graduate texts in mathematics 141, Springer 1993, ISBN 978-3-540-97971-5, pp. I-XXII, 1-574 - [j16]Rüdiger Loos, Volker Weispfenning:
Applying Linear Quantifier Elimination. Comput. J. 36(5): 450-462 (1993) - [c10]Volker Weispfenning:
Differential Term-Orders. ISSAC 1993: 245-253 - 1992
- [j15]Volker Weispfenning:
Comprehensive Gröbner Bases. J. Symb. Comput. 14(1): 1-30 (1992) - [c9]Volker Weispfenning:
Finite Gröbner Bases in Non-Noetherian Skew Polynomial Rings. ISSAC 1992: 329-334 - 1991
- [j14]Gunter Ritter, Volker Weispfenning:
On the Number of Term Orders. Appl. Algebra Eng. Commun. Comput. 2: 55-79 (1991) - [c8]Thomas Becker, Volker Weispfenning:
The Chinese Remainder Problem, Multivariate Interpolation, and Gröbner Bases. ISSAC 1991: 64-69 - 1990
- [j13]Volker Weispfenning:
Existential equivalence of ordered abelian groups with parameters. Arch. Math. Log. 29(4): 237-248 (1990) - [j12]Abdelilah Kandri-Rody, Volker Weispfenning:
Non-Commutative Gröbner Bases in Algebras of Solvable Type. J. Symb. Comput. 9(1): 1-26 (1990) - [j11]Volker Weispfenning:
The Complexity of Almost Linear Diophantine Problems. J. Symb. Comput. 10(5): 395-404 (1990)
1980 – 1989
- 1988
- [j10]Volker Weispfenning:
The Complexity of Linear Problems in Fields. J. Symb. Comput. 5(1/2): 3-27 (1988) - [j9]Heinz Kredel, Volker Weispfenning:
Computing Dimension and Independent Sets for Polynomial Ideals. J. Symb. Comput. 6(2/3): 231-247 (1988) - [c7]Volker Weispfenning:
Efficient Decision Procedures for Locally Finite Theories II. ISSAC 1988: 390-401 - 1987
- [j8]Volker Weispfenning:
Admissible orders and linear forms. SIGSAM Bull. 21(2): 16-18 (1987) - [c6]Volker Weispfenning:
Constructing Universal Groebner Bases. AAECC 1987: 408-417 - [c5]Volker Weispfenning:
Gröbner bases for polynomial ideals over commutative regular rings. EUROCAL 1987: 336-347 - 1986
- [j7]Volker Weispfenning:
The Complexity of the Word Problem for Abelian l-Groups. Theor. Comput. Sci. 48(3): 127-132 (1986) - [c4]Volker Weispfenning:
Some Bounds for the Construction of Gröbner Bases. AAECC 1986: 195-201 - [c3]Volker Weispfenning:
Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs. CADE 1986: 564-571 - 1985
- [j6]Volker Weispfenning:
Quantifier elimination for modules. Arch. Math. Log. 25(1): 1-11 (1985) - [j5]Volker Weispfenning:
Quantifier Elimination for Distributive Lattices and Measure Algebras. Math. Log. Q. 31(14-18): 249-261 (1985) - [c2]Volker Weispfenning:
Efficient Decision Algorithms for Locally Finite Theories. AAECC 1985: 262-273 - [c1]Volker Weispfenning:
The Complexity of Elementary Problems in Archimedean Ordered Groups. European Conference on Computer Algebra (2) 1985: 87-88 - 1981
- [j4]Volker Weispfenning:
The Model-Theoretic Significance of Complemented Existential Formulas. J. Symb. Log. 46(4): 843-850 (1981)
1970 – 1979
- 1978
- [j3]Volker Weispfenning:
A note on ℵ0-categorical model-companions. Arch. Math. Log. 19(1): 23-29 (1978) - 1977
- [j2]Volker Weispfenning:
Nullstellensätze - A Model Theoretic Framework. Math. Log. Q. 23(36): 539-545 (1977) - 1976
- [j1]Volker Weispfenning:
Negative-Existentially Complete Structures and Definability in Free Extensions. J. Symb. Log. 41(1): 95-108 (1976)
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-05-02 21:46 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:
