Volker Weispfenning

Scott McCallum, Volker Weispfenning: Deciding polynomial-transcendental problems. J. Symb. Comput. 47(1): 16-31 (2012)

Melanie Achatz, Scott McCallum, Volker Weispfenning: Deciding polynomial-exponential problems. ISSAC 2008: 215-222

Andreas Dolzmann, Volker Weispfenning: Multiple object semilinear motion planning. J. Symb. Comput. 42(3): 324-337 (2007)

Volker Weispfenning: Robust Stability for Parametric Linear ODEs. CASC 2007: 402-422

Volker Weispfenning: Comprehensive Gröbner bases and regular rings. J. Symb. Comput. 41(3-4): 285-296 (2006)

Volker Weispfenning: Model Theory of Lattice Products. Algorithmic Algebra and Logic 2005: 315-554

Volker Weispfenning: Solving Linear Differential Problems with Parameters. CASC 2005: 469-488

Volker Weispfenning: Solving Constraints by Elimination Methods. IJCAR 2004: 336-341

Volker Weispfenning: Canonical comprehensive Gröbner bases. J. Symb. Comput. 36(3-4): 669-683 (2003)

Volker Weispfenning: Canonical comprehensive Gröbner bases. ISSAC 2002: 270-276

Volker Weispfenning: Semilinear Motion Planning in REDLOG. Appl. Algebra Eng. Commun. Comput. 12(6): 455-475 (2001)

Alexander Bockmayr, Volker Weispfenning: Solving Numerical Constraints. Handbook of Automated Reasoning 2001: 751-842

Hirokazu Anai, Volker Weispfenning: Reach Set Computations Using Real Quantifier Elimination. HSCC 2001: 63-76

Hirokazu Anai, Volker Weispfenning: Deciding linear-trigonometric problems. ISSAC 2000: 14-22

Andreas Dolzmann, Volker Weispfenning: Local quantifier elimination. ISSAC 2000: 86-94

Volker Weispfenning: Mixed Real-Integer Linear Quantifier Elimination. ISSAC 1999: 129-136

Andreas Dolzmann, Thomas Sturm, Volker Weispfenning: A New Approach for Automatic Theorem Proving in Real Geometry. J. Autom. Reasoning 21(3): 357-380 (1998)

Volker Weispfenning, Barry M. Trager (Eds.): 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

Volker Weispfenning: Quantifier Elimination for Real Algebra - the Quadratic Case and Beyond. Appl. Algebra Eng. Commun. Comput. 8(2): 85-101 (1997)

Volker Weispfenning: Simulation and Optimization by Quantifier Elimination. J. Symb. Comput. 24(2): 189-208 (1997)

Volker Weispfenning: Complexity and Uniformity of Elimination in Presburger Arithmetic. ISSAC 1997: 48-53

Thomas Sturm, Volker Weispfenning: Computational Geometry Problems in REDLOG. Automated Deduction in Geometry 1996: 58-86

Volker Weispfenning: Quantifier Elimination for Real Algebra - the Cubic Case. ISSAC 1994: 258-263

Rüdiger Loos, Volker Weispfenning: Applying Linear Quantifier Elimination. Comput. J. 36(5): 450-462 (1993)

Volker Weispfenning: Differential Term-Orders. ISSAC 1993: 245-253

Volker Weispfenning: Comprehensive Gröbner Bases. J. Symb. Comput. 14(1): 1-30 (1992)

Volker Weispfenning: Finite Gröbner Bases in Non-Noetherian Skew Polynomial Rings. ISSAC 1992: 329-334

Gunter Ritter, Volker Weispfenning: On the Number of Term Orders. Appl. Algebra Eng. Commun. Comput. 2: 55-79 (1991)

Thomas Becker, Volker Weispfenning: The Chinese Remainder Problem, Multivariate Interpolation, and Gröbner Bases. ISSAC 1991: 64-69

Abdelilah Kandri-Rody, Volker Weispfenning: Non-Commutative Gröbner Bases in Algebras of Solvable Type. J. Symb. Comput. 9(1): 1-26 (1990)

Volker Weispfenning: The Complexity of Almost Linear Diophantine Problems. J. Symb. Comput. 10(5): 395-404 (1990)

Volker Weispfenning: The Complexity of Linear Problems in Fields. J. Symb. Comput. 5(1/2): 3-27 (1988)

Heinz Kredel, Volker Weispfenning: Computing Dimension and Independent Sets for Polynomial Ideals. J. Symb. Comput. 6(2/3): 231-247 (1988)

Volker Weispfenning: Efficient Decision Procedures for Locally Finite Theories II. ISSAC 1988: 390-401

Volker Weispfenning: Constructing Universal Groebner Bases. AAECC 1987: 408-417

Volker Weispfenning: Gröbner bases for polynomial ideals over commutative regular rings. EUROCAL 1987: 336-347

Volker Weispfenning: The Complexity of the Word Problem for Abelian l-Groups. Theor. Comput. Sci. 48(3): 127-132 (1986)

Volker Weispfenning: Some Bounds for the Construction of Gröbner Bases. AAECC 1986: 195-201

Volker Weispfenning: Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs. CADE 1986: 564-571

Volker Weispfenning: Efficient Decision Algorithms for Locally Finite Theories. AAECC 1985: 262-273

Volker Weispfenning: The Complexity of Elementary Problems in Archimedean Ordered Groups. European Conference on Computer Algebra (2) 1985: 87-88

Volker Weispfenning: The Model-Theoretic Significance of Complemented Existential Formulas. J. Symb. Log. 46(4): 843-850 (1981)

Volker Weispfenning: Negative-Existentially Complete Structures and Definability in Free Extensions. J. Symb. Log. 41(1): 95-108 (1976)