Volker Weispfenning - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 52 from 52

2012

Deciding polynomial-transcendental problemsScott McCallum, Volker Weispfenning. JSC, 47(1):16-31, 2012. [doi]

2008

Deciding polynomial-exponential problemsMelanie Achatz, Scott McCallum, Volker Weispfenning. issac 2008: 215-222 [doi]

2007

Multiple object semilinear motion planningAndreas Dolzmann, Volker Weispfenning. JSC, 42(3):324-337, 2007. [doi]

Robust Stability for Parametric Linear ODEsVolker Weispfenning. cascon 2007: 402-422 [doi]

2006

Comprehensive Gröbner bases and regular ringsVolker Weispfenning. JSC, 41(3-4):285-296, 2006. [doi]

2005

Solving Linear Differential Problems with ParametersVolker Weispfenning. cascon 2005: 469-488 [doi]

Model Theory of Lattice ProductsVolker Weispfenning. BIRTHDAY 2005: 315-554

2004

Solving Constraints by Elimination MethodsVolker Weispfenning. cade 2004: 336-341 [doi]

2003

Canonical comprehensive Gröbner basesVolker Weispfenning. JSC, 36(3-4):669-683, 2003. [doi]

2002

Canonical comprehensive Gröbner basesVolker Weispfenning. issac 2002: 270-276 [doi]

2001

Reach Set Computations Using Real Quantifier EliminationHirokazu Anai, Volker Weispfenning. hybrid 2001: 63-76 [doi]

Solving Numerical ConstraintsAlexander Bockmayr, Volker Weispfenning. In John Alan Robinson, Andrei Voronkov, editors, Handbook of Automated Reasoning (in 2 volumes). pages 751-842, Elsevier and MIT Press, 2001.

Semilinear Motion Planning in REDLOGVolker Weispfenning. aaecc, 12(6):455-475, 2001. [doi]

Semilinear Motion Planning Among Moving Objects in REDLOGVolker Weispfenning. casc 2001: 541-553 [doi]

2000

Deciding linear-trigonometric problemsHirokazu Anai, Volker Weispfenning. issac 2000: 14-22 [doi]

Local quantifier eliminationAndreas Dolzmann, Volker Weispfenning. issac 2000: 86-94 [doi]

Deciding linear-exponential problemsVolker Weispfenning. cca, 34(1):30-31, 2000. [doi]

1999

Mixed Real-Integer Linear Quantifier EliminationVolker Weispfenning. issac 1999: 129-136 [doi]

1998

A New Approach for Automatic Theorem Proving in Real GeometryAndreas Dolzmann, Thomas Sturm, Volker Weispfenning. JAR, 21(3):357-380, 1998.

1997

Real Quantifier Elimination in PracticeAndreas Dolzmann, Thomas Sturm 0001, Volker Weispfenning. aant 1999: 221-247 [doi]

Complexity and Uniformity of Elimination in Presburger ArithmeticVolker Weispfenning. issac 1997: 48-53

Quantifier Elimination for Real Algebra - the Quadratic Case and BeyondVolker Weispfenning. aaecc, 8(2):85-101, 1997. [doi]

Simulation and Optimization by Quantifier EliminationVolker Weispfenning. JSC, 24(2):189-208, 1997.

1996

Computational Geometry Problems in REDLOGThomas Sturm, Volker Weispfenning. adg 1997: 58-86

1994

Quantifier Elimination for Real Algebra - the Cubic CaseVolker Weispfenning. issac 1994: 258-263 [doi]

1993

Gröbner bases - a computational approach to commutative algebraThomas Becker, Volker Weispfenning, Heinz Kredel. Volume 141 of Graduate texts in mathematics, Springer, 1993.

Applying Linear Quantifier EliminationRüdiger Loos, Volker Weispfenning. cj, 36(5):450-462, 1993.

Differential Term-OrdersVolker Weispfenning. issac 1993: 245-253 [doi]

1992

Finite Gröbner Bases in Non-Noetherian Skew Polynomial RingsVolker Weispfenning. issac 1992: 329-334 [doi]

Comprehensive Gröbner BasesVolker Weispfenning. JSC, 14(1):1-30, 1992.

1991

The Chinese Remainder Problem, Multivariate Interpolation, and Gröbner BasesThomas Becker, Volker Weispfenning. issac 1991: 64-69 [doi]

On the Number of Term OrdersGunter Ritter, Volker Weispfenning. aaecc, 2:55-79, 1991.

1990

Non-Commutative Gröbner Bases in Algebras of Solvable TypeAbdelilah Kandri-Rody, Volker Weispfenning. JSC, 9(1):1-26, 1990.

The Complexity of Almost Linear Diophantine ProblemsVolker Weispfenning. JSC, 10(5):395-404, 1990.

Existential equivalence of ordered abelian groups with parametersVolker Weispfenning. AML, 29(4):237-248, 1990. [doi]

1988

Computing Dimension and Independent Sets for Polynomial IdealsHeinz Kredel, Volker Weispfenning. JSC, 6(2/3):231-247, 1988.

Efficient Decision Procedures for Locally Finite Theories IIVolker Weispfenning. issac 1989: 390-401

The Complexity of Linear Problems in FieldsVolker Weispfenning. JSC, 5(1/2):3-27, 1988.

1987

Constructing Universal Groebner BasesVolker Weispfenning. AAECC 1989: 408-417

Gröbner bases for polynomial ideals over commutative regular ringsVolker Weispfenning. eurocal 1989: 336-347

Admissible orders and linear formsVolker Weispfenning. cca, 21(2):16-18, 1987. [doi]

1986

Diamond Formulas in the Dynamic Logic of Recursively Enumerable ProgramsVolker Weispfenning. cade 1986: 564-571

Some Bounds for the Construction of Gröbner BasesVolker Weispfenning. AAECC 1988: 195-201

The Complexity of the Word Problem for Abelian l-GroupsVolker Weispfenning. TCS, 48(3):127-132, 1986.

1985

Efficient Decision Algorithms for Locally Finite TheoriesVolker Weispfenning. AAECC 1986: 262-273

The Complexity of Elementary Problems in Archimedean Ordered GroupsVolker Weispfenning. eurocal 1985: 87-88

Quantifier Elimination for Distributive Lattices and Measure AlgebrasVolker Weispfenning. mlq, 31(14-18):249-261, 1985. [doi]

Quantifier elimination for modulesVolker Weispfenning. AML, 25(1):1-11, 1985. [doi]

1981

The Model-Theoretic Significance of Complemented Existential FormulasVolker Weispfenning. JSYML, 46(4):843-850, 1981.

1978

0-categorical model-companionsVolker Weispfenning. AML, 19(1):23-29, 1978. [doi]

1977

Nullstellensätze - A Model Theoretic FrameworkVolker Weispfenning. mlq, 23(36):539-545, 1977. [doi]

1976

Negative-Existentially Complete Structures and Definability in Free ExtensionsVolker Weispfenning. JSYML, 41(1):95-108, 1976.

Sign in or sign up to see more results.

runs on WebDSL