Volker Weispfenning

According to our database1, Volker Weispfenning
  • authored at least 49 papers between 1976 and 2012.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2012
Deciding polynomial-transcendental problems.
J. Symb. Comput., 2012

2008
Deciding polynomial-exponential problems.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007
Multiple object semilinear motion planning.
J. Symb. Comput., 2007

Robust Stability for Parametric Linear ODEs.
Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

2006
Comprehensive Gröbner bases and regular rings.
J. Symb. Comput., 2006

2005
Solving Linear Differential Problems with Parameters.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

Model Theory of Lattice Products.
Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

2004
Solving Constraints by Elimination Methods.
Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2003
Canonical comprehensive Gröbner bases.
J. Symb. Comput., 2003

2002
Canonical comprehensive Gröbner bases.
Proceedings of the Symbolic and Algebraic Computation, 2002

2001
Semilinear Motion Planning in REDLOG.
Appl. Algebra Eng. Commun. Comput., 2001

Reach Set Computations Using Real Quantifier Elimination.
Proceedings of the Hybrid Systems: Computation and Control, 4th International Workshop, 2001

Solving Numerical Constraints.
Proceedings of the Handbook of Automated Reasoning (in 2 volumes), 2001

2000
Deciding linear-exponential problems.
ACM SIGSAM Bulletin, 2000

Local quantifier elimination.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

Deciding linear-trigonometric problems.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1999
Mixed Real-Integer Linear Quantifier Elimination.
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1998
A New Approach for Automatic Theorem Proving in Real Geometry.
J. Autom. Reasoning, 1998

1997
Simulation and Optimization by Quantifier Elimination.
J. Symb. Comput., 1997

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

Complexity and Uniformity of Elimination in Presburger Arithmetic.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

1996
Computational Geometry Problems in REDLOG.
Proceedings of the Automated Deduction in Geometry, 1996

1994
Quantifier Elimination for Real Algebra - the Cubic Case.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993
Applying Linear Quantifier Elimination.
Comput. J., 1993

Differential Term-Orders.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1992
Comprehensive Gröbner Bases.
J. Symb. Comput., 1992

Finite Gröbner Bases in Non-Noetherian Skew Polynomial Rings.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

1991
On the Number of Term Orders.
Appl. Algebra Eng. Commun. Comput., 1991

The Chinese Remainder Problem, Multivariate Interpolation, and Gröbner Bases.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990
The Complexity of Almost Linear Diophantine Problems.
J. Symb. Comput., 1990

Non-Commutative Gröbner Bases in Algebras of Solvable Type.
J. Symb. Comput., 1990

Existential equivalence of ordered abelian groups with parameters.
Arch. Math. Log., 1990

1988
The Complexity of Linear Problems in Fields.
J. Symb. Comput., 1988

Computing Dimension and Independent Sets for Polynomial Ideals.
J. Symb. Comput., 1988

Efficient Decision Procedures for Locally Finite Theories II.
Proceedings of the Symbolic and Algebraic Computation, 1988

1987
Admissible orders and linear forms.
ACM SIGSAM Bulletin, 1987

Gröbner bases for polynomial ideals over commutative regular rings.
Proceedings of the EUROCAL '87, 1987

Constructing Universal Groebner Bases.
Proceedings of the Applied Algebra, 1987

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

Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

Some Bounds for the Construction of Gröbner Bases.
Proceedings of the Applied Algebra, 1986

1985
Quantifier Elimination for Distributive Lattices and Measure Algebras.
Math. Log. Q., 1985

Quantifier elimination for modules.
Arch. Math. Log., 1985

The Complexity of Elementary Problems in Archimedean Ordered Groups.
Proceedings of the EUROCAL '85, 1985

Efficient Decision Algorithms for Locally Finite Theories.
Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985

1981
The Model-Theoretic Significance of Complemented Existential Formulas.
J. Symb. Log., 1981

1978
A note on ℵ0-categorical model-companions.
Arch. Math. Log., 1978

1977
Nullstellensätze - A Model Theoretic Framework.
Math. Log. Q., 1977

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


  Loading...