Volker Weispfenning

53 papers A 2B 15Journal 25Unranked 9

Year	Rank	Type	Title / Venue / Authors
2012	J	`jnl`	Deciding polynomial-transcendental problems. J. Symb. Comput. Scott McCallum, Volker Weispfenning
2008	B	`conf`	Deciding polynomial-exponential problems. ISSAC Melanie Achatz, Scott McCallum, Volker Weispfenning
2007	J	`jnl`	Multiple object semilinear motion planning. J. Symb. Comput. Andreas Dolzmann, Volker Weispfenning
2007	B	`conf`	Robust Stability for Parametric Linear ODEs. CASC Volker Weispfenning
2006	J	`jnl`	Comprehensive Gröbner bases and regular rings. J. Symb. Comput. Volker Weispfenning
2005	—	`conf`	Model Theory of Lattice Products. Algorithmic Algebra and Logic Volker Weispfenning
2005	B	`conf`	Solving Linear Differential Problems with Parameters. CASC Volker Weispfenning
2004	A	`conf`	Solving Constraints by Elimination Methods. IJCAR Volker Weispfenning
2003	J	`jnl`	Canonical comprehensive Gröbner bases. J. Symb. Comput. Volker Weispfenning
2002	B	`conf`	Canonical comprehensive Gröbner bases. ISSAC Volker Weispfenning
2001	—	`conf`	Reach Set Computations Using Real Quantifier Elimination. HSCC Hirokazu Anai, Volker Weispfenning
2001	B	`conf`	Semilinear Motion Planning Among Moving Objects in REDLOG. CASC Volker Weispfenning
2001	J	`jnl`	Semilinear Motion Planning in REDLOG. Appl. Algebra Eng. Commun. Comput. Volker Weispfenning
2001	—	`ch.`	Solving Numerical Constraints. Handbook of Automated Reasoning Alexander Bockmayr, Volker Weispfenning
2000	J	`jnl`	Deciding linear-exponential problems. SIGSAM Bull. Volker Weispfenning
2000	B	`conf`	Deciding linear-trigonometric problems. ISSAC Hirokazu Anai, Volker Weispfenning
2000	B	`conf`	Local quantifier elimination. ISSAC Andreas Dolzmann, Volker Weispfenning
1999	B	`conf`	Mixed Real-Integer Linear Quantifier Elimination. ISSAC Volker Weispfenning
1998	J	`jnl`	A New Approach for Automatic Theorem Proving in Real Geometry. J. Autom. Reason. Andreas Dolzmann, Thomas Sturm, Volker Weispfenning
1998	B	`ed.`	Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC '98, Rostock, Germany, August 13-15, 1998 ISSAC Volker Weispfenning, Barry M. Trager
1997	B	`conf`	Complexity and Uniformity of Elimination in Presburger Arithmetic. ISSAC Volker Weispfenning
1997	J	`jnl`	Quantifier Elimination for Real Algebra - the Quadratic Case and Beyond. Appl. Algebra Eng. Commun. Comput. Volker Weispfenning
1997	—	`conf`	Real Quantifier Elimination in Practice. Algorithmic Algebra and Number Theory Andreas Dolzmann, Thomas Sturm, Volker Weispfenning
1997	J	`jnl`	Simulation and Optimization by Quantifier Elimination. J. Symb. Comput. Volker Weispfenning
1996	—	`conf`	Computational Geometry Problems in REDLOG. Automated Deduction in Geometry Thomas Sturm, Volker Weispfenning
1994	B	`conf`	Quantifier Elimination for Real Algebra - the Cubic Case. ISSAC Volker Weispfenning
1993	J	`jnl`	Applying Linear Quantifier Elimination. Comput. J. Rüdiger Loos, Volker Weispfenning
1993	B	`conf`	Differential Term-Orders. ISSAC Volker Weispfenning
1993	—	`book`	Gröbner bases - a computational approach to commutative algebra. Thomas Becker, Volker Weispfenning, Heinz Kredel
1992	J	`jnl`	Comprehensive Gröbner Bases. J. Symb. Comput. Volker Weispfenning
1992	B	`conf`	Finite Gröbner Bases in Non-Noetherian Skew Polynomial Rings. ISSAC Volker Weispfenning
1991	J	`jnl`	On the Number of Term Orders. Appl. Algebra Eng. Commun. Comput. Gunter Ritter, Volker Weispfenning
1991	B	`conf`	The Chinese Remainder Problem, Multivariate Interpolation, and Gröbner Bases. ISSAC Thomas Becker, Volker Weispfenning
1990	J	`jnl`	Existential equivalence of ordered abelian groups with parameters. Arch. Math. Log. Volker Weispfenning
1990	J	`jnl`	Non-Commutative Gröbner Bases in Algebras of Solvable Type. J. Symb. Comput. Abdelilah Kandri-Rody, Volker Weispfenning
1990	J	`jnl`	The Complexity of Almost Linear Diophantine Problems. J. Symb. Comput. Volker Weispfenning
1988	J	`jnl`	Computing Dimension and Independent Sets for Polynomial Ideals. J. Symb. Comput. Heinz Kredel, Volker Weispfenning
1988	B	`conf`	Efficient Decision Procedures for Locally Finite Theories II. ISSAC Volker Weispfenning
1988	J	`jnl`	The Complexity of Linear Problems in Fields. J. Symb. Comput. Volker Weispfenning
1987	J	`jnl`	Admissible orders and linear forms. SIGSAM Bull. Volker Weispfenning
1987	—	`conf`	Constructing Universal Groebner Bases. AAECC Volker Weispfenning
1987	—	`conf`	Gröbner bases for polynomial ideals over commutative regular rings. EUROCAL Volker Weispfenning
1986	A	`conf`	Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs. CADE Volker Weispfenning
1986	—	`conf`	Some Bounds for the Construction of Gröbner Bases. AAECC Volker Weispfenning
1986	J	`jnl`	The Complexity of the Word Problem for Abelian l-Groups. Theor. Comput. Sci. Volker Weispfenning
1985	—	`conf`	Efficient Decision Algorithms for Locally Finite Theories. AAECC Volker Weispfenning
1985	J	`jnl`	Quantifier Elimination for Distributive Lattices and Measure Algebras. Math. Log. Q. Volker Weispfenning
1985	J	`jnl`	Quantifier elimination for modules. Arch. Math. Log. Volker Weispfenning
1985	—	`conf`	The Complexity of Elementary Problems in Archimedean Ordered Groups. European Conference on Computer Algebra (2) Volker Weispfenning
1981	J	`jnl`	The Model-Theoretic Significance of Complemented Existential Formulas. J. Symb. Log. Volker Weispfenning
1978	J	`jnl`	A note on ℵ Arch. Math. Log. Volker Weispfenning
1977	J	`jnl`	Nullstellensätze - A Model Theoretic Framework. Math. Log. Q. Volker Weispfenning
1976	J	`jnl`	Negative-Existentially Complete Structures and Definability in Free Extensions. J. Symb. Log. Volker Weispfenning