The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Sturm: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas Sturm, Volker Weispfenning
    Computational Geometry Problems in REDLOG. [Citation Graph (0, 0)][DBLP]
    Automated Deduction in Geometry, 1996, pp:58-86 [Conf]
  2. Thomas Sturm
    Integration of Quantifier Elimination with Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    AISC, 2002, pp:7-11 [Conf]
  3. Thomas Sturm
    Quantifier Elimination for Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    CASC, 2005, pp:416-430 [Conf]
  4. Thomas Sturm
    New Domains for Applied Quantifier Elimination. [Citation Graph (0, 0)][DBLP]
    CASC, 2006, pp:295-301 [Conf]
  5. Andreas Dolzmann, Oliver Gloor, Thomas Sturm
    Approaches to Parallel Quantifier Elimination. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1998, pp:88-95 [Conf]
  6. Andreas Dolzmann, Thomas Sturm
    Guarded Expressions in Practice. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1997, pp:376-383 [Conf]
  7. Andreas Dolzmann, Thomas Sturm
    P-adic Constraint Solving. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1999, pp:151-158 [Conf]
  8. Andreas Dolzmann, Andreas Seidl, Thomas Sturm
    Efficient projection orders for CAD. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2004, pp:111-118 [Conf]
  9. Andreas Seidl, Thomas Sturm
    A generic projection operator for partial cylindrical algebraic decomposition. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2003, pp:240-247 [Conf]
  10. Thomas Sturm
    Reasoning over Networks by Symbolic Methods. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1999, v:10, n:1, pp:79-96 [Journal]
  11. 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]
  12. Andreas Dolzmann, Thomas Sturm
    Simplification of Quantifier-Free Formulae over Ordered Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1997, v:24, n:2, pp:209-231 [Journal]
  13. Thomas Sturm
    Linear Problems in Valued Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2000, v:30, n:2, pp:207-219 [Journal]
  14. Andreas Dolzmann, Thomas Sturm
    Editorial. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2006, v:41, n:11, pp:1155-1156 [Journal]
  15. Aless Lasaruk, Thomas Sturm
    Weak Integer Quantifier Elimination Beyond the Linear Case. [Citation Graph (0, 0)][DBLP]
    CASC, 2007, pp:275-294 [Conf]

  16. Effective Quantifier Elimination for Presburger Arithmetic with Infinity. [Citation Graph (, )][DBLP]


  17. Acronyms for a Database Design Course. [Citation Graph (, )][DBLP]


  18. Sudoku and A.I.. [Citation Graph (, )][DBLP]


  19. Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology. [Citation Graph (, )][DBLP]


  20. Editorial. [Citation Graph (, )][DBLP]


  21. Weak quantifier elimination for the full linear theory of the integers. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002