Search the dblp DataBase
Volker Weispfenning :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Volker Weispfenning Efficient Decision Algorithms for Locally Finite Theories. [Citation Graph (0, 0)][DBLP ] AAECC, 1985, pp:262-273 [Conf ] Volker Weispfenning Some Bounds for the Construction of Gröbner Bases. [Citation Graph (0, 0)][DBLP ] AAECC, 1986, pp:195-201 [Conf ] Volker Weispfenning Constructing Universal Groebner Bases. [Citation Graph (0, 0)][DBLP ] AAECC, 1987, pp:408-417 [Conf ] Thomas Sturm , Volker Weispfenning Computational Geometry Problems in REDLOG. [Citation Graph (0, 0)][DBLP ] Automated Deduction in Geometry, 1996, pp:58-86 [Conf ] Volker Weispfenning Solving Constraints by Elimination Methods. [Citation Graph (0, 0)][DBLP ] IJCAR, 2004, pp:336-341 [Conf ] Volker Weispfenning Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs. [Citation Graph (0, 0)][DBLP ] CADE, 1986, pp:564-571 [Conf ] Volker Weispfenning Solving Linear Differential Problems with Parameters. [Citation Graph (0, 0)][DBLP ] CASC, 2005, pp:469-488 [Conf ] Volker Weispfenning The Complexity of Elementary Problems in Archimedean Ordered Groups. [Citation Graph (0, 0)][DBLP ] European Conference on Computer Algebra (2), 1985, pp:87-88 [Conf ] Volker Weispfenning Gröbner bases for polynomial ideals over commutative regular rings. [Citation Graph (0, 0)][DBLP ] EUROCAL, 1987, pp:336-347 [Conf ] Hirokazu Anai , Volker Weispfenning Reach Set Computations Using Real Quantifier Elimination. [Citation Graph (0, 0)][DBLP ] HSCC, 2001, pp:63-76 [Conf ] Thomas Becker , Volker Weispfenning The Chinese Remainder Problem, Multivariate Interpolation, and Gröbner Bases. [Citation Graph (0, 0)][DBLP ] ISSAC, 1991, pp:64-69 [Conf ] Hirokazu Anai , Volker Weispfenning Deciding linear-trigonometric problems. [Citation Graph (0, 0)][DBLP ] ISSAC, 2000, pp:14-22 [Conf ] Andreas Dolzmann , Volker Weispfenning Local quantifier elimination. [Citation Graph (0, 0)][DBLP ] ISSAC, 2000, pp:86-94 [Conf ] Volker Weispfenning Canonical comprehensive Gröbner bases. [Citation Graph (0, 0)][DBLP ] ISSAC, 2002, pp:270-276 [Conf ] Volker Weispfenning Efficient Decision Procedures for Locally Finite Theories II. [Citation Graph (0, 0)][DBLP ] ISSAC, 1988, pp:390-401 [Conf ] Volker Weispfenning Finite Gröbner Bases in Non-Noetherian Skew Polynomial Rings. [Citation Graph (0, 0)][DBLP ] ISSAC, 1992, pp:329-334 [Conf ] Volker Weispfenning Differential Term-Orders. [Citation Graph (0, 0)][DBLP ] ISSAC, 1993, pp:245-253 [Conf ] Volker Weispfenning Quantifier Elimination for Real Algebra - the Cubic Case. [Citation Graph (0, 0)][DBLP ] ISSAC, 1994, pp:258-263 [Conf ] Volker Weispfenning Complexity and Uniformity of Elimination in Presburger Arithmetic. [Citation Graph (0, 0)][DBLP ] ISSAC, 1997, pp:48-53 [Conf ] Volker Weispfenning Mixed Real-Integer Linear Quantifier Elimination. [Citation Graph (0, 0)][DBLP ] ISSAC, 1999, pp:129-136 [Conf ] Gunter Ritter , Volker Weispfenning On the Number of Term Orders. [Citation Graph (0, 0)][DBLP ] Appl. Algebra Eng. Commun. Comput., 1991, v:2, n:, pp:55-79 [Journal ] Volker Weispfenning Semilinear Motion Planning in REDLOG. [Citation Graph (0, 0)][DBLP ] Appl. Algebra Eng. Commun. Comput., 2001, v:12, n:6, pp:455-475 [Journal ] Volker Weispfenning Quantifier Elimination for Real Algebra - the Quadratic Case and Beyond. [Citation Graph (0, 0)][DBLP ] Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:2, pp:85-101 [Journal ] Rüdiger Loos , Volker Weispfenning Applying Linear Quantifier Elimination. [Citation Graph (0, 0)][DBLP ] Comput. J., 1993, v:36, n:5, pp:450-462 [Journal ] Andreas Dolzmann , Thomas Sturm , Volker Weispfenning A New Approach for Automatic Theorem Proving in Real Geometry. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 1998, v:21, n:3, pp:357-380 [Journal ] Abdelilah Kandri-Rody , Volker Weispfenning Non-Commutative Gröbner Bases in Algebras of Solvable Type. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1990, v:9, n:1, pp:1-26 [Journal ] Heinz Kredel , Volker Weispfenning Computing Dimension and Independent Sets for Polynomial Ideals. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1988, v:6, n:2/3, pp:231-247 [Journal ] Volker Weispfenning Canonical comprehensive Gröbner bases. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2003, v:36, n:3-4, pp:669-683 [Journal ] Volker Weispfenning Comprehensive Gröbner bases and regular rings. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2006, v:41, n:3-4, pp:285-296 [Journal ] Volker Weispfenning The Complexity of Linear Problems in Fields. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1988, v:5, n:1/2, pp:3-27 [Journal ] Volker Weispfenning The Complexity of Almost Linear Diophantine Problems. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1990, v:10, n:5, pp:395-404 [Journal ] Volker Weispfenning Comprehensive Gröbner Bases. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1992, v:14, n:1, pp:1-30 [Journal ] Volker Weispfenning Simulation and Optimization by Quantifier Elimination. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1997, v:24, n:2, pp:189-208 [Journal ] Andreas Dolzmann , Volker Weispfenning Multiple object semilinear motion planning. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2007, v:42, n:3, pp:324-337 [Journal ] Volker Weispfenning Negative-Existentially Complete Structures and Definability in Free Extensions. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1976, v:41, n:1, pp:95-108 [Journal ] Volker Weispfenning The Model-Theoretic Significance of Complemented Existential Formulas. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1981, v:46, n:4, pp:843-850 [Journal ] Volker Weispfenning The Complexity of the Word Problem for Abelian l-Groups. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1986, v:48, n:3, pp:127-132 [Journal ] Volker Weispfenning Robust Stability for Parametric Linear ODEs. [Citation Graph (0, 0)][DBLP ] CASC, 2007, pp:402-422 [Conf ] Deciding polynomial-exponential problems. [Citation Graph (, )][DBLP ] Search in 0.077secs, Finished in 0.079secs