Negative-Existentially Complete Structures and Definability in Free Extensions. - Volker Weispfenning (J. Symb. Log., 1976)

Nullstellensätze - A Model Theoretic Framework. - Volker Weispfenning (Math. Log. Q., 1977)

A note on ℵ0-categorical model-companions. - Volker Weispfenning (Arch. Math. Log., 1978)

The Model-Theoretic Significance of Complemented Existential Formulas. - Volker Weispfenning (J. Symb. Log., 1981)

Efficient Decision Algorithms for Locally Finite Theories. - Volker Weispfenning (AAECC, 1985)

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

Quantifier elimination for modules. - Volker Weispfenning (Arch. Math. Log., 1985)

Quantifier Elimination for Distributive Lattices and Measure Algebras. - Volker Weispfenning (Math. Log. Q., 1985)

Some Bounds for the Construction of Gröbner Bases. - Volker Weispfenning (AAECC, 1986)

Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs. - Volker Weispfenning (CADE, 1986)

The Complexity of the Word Problem for Abelian l-Groups. - Volker Weispfenning (Theor. Comput. Sci., 1986)

Constructing Universal Groebner Bases. - Volker Weispfenning (AAECC, 1987)

Gröbner bases for polynomial ideals over commutative regular rings. - Volker Weispfenning (EUROCAL, 1987)

Admissible orders and linear forms. - Volker Weispfenning (SIGSAM Bull., 1987)

Efficient Decision Procedures for Locally Finite Theories II. - Volker Weispfenning (ISSAC, 1988)

Computing Dimension and Independent Sets for Polynomial Ideals. - Heinz Kredel; Volker Weispfenning (J. Symb. Comput., 1988)

The Complexity of Linear Problems in Fields. - Volker Weispfenning (J. Symb. Comput., 1988)

Existential equivalence of ordered abelian groups with parameters. - Volker Weispfenning (Arch. Math. Log., 1990)

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

The Complexity of Almost Linear Diophantine Problems. - Volker Weispfenning (J. Symb. Comput., 1990)

The Chinese Remainder Problem, Multivariate Interpolation, and Gröbner Bases. - Thomas Becker 001; Volker Weispfenning (ISSAC, 1991)

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

Finite Gröbner Bases in Non-Noetherian Skew Polynomial Rings. - Volker Weispfenning (ISSAC, 1992)

Comprehensive Gröbner Bases. - Volker Weispfenning (J. Symb. Comput., 1992)

Gröbner bases - a computational approach to commutative algebra. - Thomas Becker 001; Volker Weispfenning; Heinz Kredel (Springer, 1993)

Differential Term-Orders. - Volker Weispfenning (ISSAC, 1993)

Applying Linear Quantifier Elimination. - Rüdiger Loos; Volker Weispfenning (Comput. J., 1993)

Quantifier Elimination for Real Algebra - the Cubic Case. - Volker Weispfenning (ISSAC, 1994)

Computational Geometry Problems in REDLOG. - Thomas Sturm 001; Volker Weispfenning (Automated Deduction in Geometry, 1996)

Real Quantifier Elimination in Practice. - Andreas Dolzmann; Thomas Sturm 001; Volker Weispfenning (Algorithmic Algebra and Number Theory, 1997)

Complexity and Uniformity of Elimination in Presburger Arithmetic. - Volker Weispfenning (ISSAC, 1997)

Quantifier Elimination for Real Algebra - the Quadratic Case and Beyond. - Volker Weispfenning (Appl. Algebra Eng. Commun. Comput., 1997)

Simulation and Optimization by Quantifier Elimination. - Volker Weispfenning (J. Symb. Comput., 1997)

A New Approach for Automatic Theorem Proving in Real Geometry. - Andreas Dolzmann; Thomas Sturm 001; Volker Weispfenning (J. Autom. Reason., 1998)

Mixed Real-Integer Linear Quantifier Elimination. - Volker Weispfenning (ISSAC, 1999)

Deciding linear-trigonometric problems. - Hirokazu Anai; Volker Weispfenning (ISSAC, 2000)

Local quantifier elimination. - Andreas Dolzmann; Volker Weispfenning (ISSAC, 2000)

Deciding linear-exponential problems. - Volker Weispfenning (SIGSAM Bull., 2000)

Solving Numerical Constraints. - Alexander Bockmayr; Volker Weispfenning (Handbook of Automated Reasoning, 2001)

Semilinear Motion Planning Among Moving Objects in REDLOG. - Volker Weispfenning (CASC, 2001)

Reach Set Computations Using Real Quantifier Elimination. - Hirokazu Anai; Volker Weispfenning (HSCC, 2001)

Semilinear Motion Planning in REDLOG. - Volker Weispfenning (Appl. Algebra Eng. Commun. Comput., 2001)

Canonical comprehensive Gröbner bases. - Volker Weispfenning (J. Symb. Comput., 2003)

Solving Constraints by Elimination Methods. - Volker Weispfenning (IJCAR, 2004)

Model Theory of Lattice Products. - Volker Weispfenning (Algorithmic Algebra and Logic, 2005)

Solving Linear Differential Problems with Parameters. - Volker Weispfenning (CASC, 2005)

Comprehensive Gröbner bases and regular rings. - Volker Weispfenning (J. Symb. Comput., 2006)

Robust Stability for Parametric Linear ODEs. - Volker Weispfenning (CASC, 2007)

Multiple object semilinear motion planning. - Andreas Dolzmann; Volker Weispfenning (J. Symb. Comput., 2007)

Deciding polynomial-exponential problems. - Melanie Achatz; Scott McCallum; Volker Weispfenning (ISSAC, 2008)

Deciding polynomial-transcendental problems. - Scott McCallum; Volker Weispfenning (J. Symb. Comput., 2012)