Computational Geometry Problems in REDLOG. - Thomas Sturm 001; Volker Weispfenning (Automated Deduction in Geometry, 1996)

Real Quantifier Elimination in Practice. - Andreas Dolzmann; Thomas Sturm 001; Volker Weispfenning (Algorithmic Algebra and Number Theory, 1997)

Guarded Expressions in Practice. - Andreas Dolzmann; Thomas Sturm 001 (ISSAC, 1997)

REDLOG: computer algebra meets computer logic. - Andreas Dolzmann; Thomas Sturm 001 (SIGSAM Bull., 1997)

Simplification of Quantifier-Free Formulae over Ordered Fields. - Andreas Dolzmann; Thomas Sturm 001 (J. Symb. Comput., 1997)

Approaches to Parallel Quantifier Elimination. - Andreas Dolzmann; Oliver Gloor; Thomas Sturm 001 (ISSAC, 1998)

A New Approach for Automatic Theorem Proving in Real Geometry. - Andreas Dolzmann; Thomas Sturm 001; Volker Weispfenning (J. Autom. Reason., 1998)

P-adic Constraint Solving. - Andreas Dolzmann; Thomas Sturm 001 (ISSAC, 1999)

Reasoning over Networks by Symbolic Methods. - Thomas Sturm 001 (Appl. Algebra Eng. Commun. Comput., 1999)

Linear Problems in Valued Fields. - Thomas Sturm 001 (J. Symb. Comput., 2000)

Parametric Systems of Linear Congruences. - Andreas Dolzmann; Thomas Sturm 001 (CASC, 2001)

Integration of Quantifier Elimination with Constraint Logic Programming. - Thomas Sturm 001 (AISC, 2002)

A generic projection operator for partial cylindrical algebraic decomposition. - Andreas Seidl; Thomas Sturm 001 (ISSAC, 2003)

Efficient projection orders for CAD. - Andreas Dolzmann; Andreas Seidl; Thomas Sturm 001 (ISSAC, 2004)

Quantifier Elimination for Constraint Logic Programming. - Thomas Sturm 001 (CASC, 2005)

New Domains for Applied Quantifier Elimination. - Thomas Sturm 001 (CASC, 2006)

Editorial. - Andreas Dolzmann; Thomas Sturm 001 (J. Symb. Comput., 2006)

Weak Integer Quantifier Elimination Beyond the Linear Case. - Aless Lasaruk; Thomas Sturm 001 (CASC, 2007)

Editorial. - Hirokazu Anai; Thomas Sturm 001 (Appl. Algebra Eng. Commun. Comput., 2007)

Weak quantifier elimination for the full linear theory of the integers. - Aless Lasaruk; Thomas Sturm 001 (Appl. Algebra Eng. Commun. Comput., 2007)

Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology. - Thomas Sturm 001; Andreas Weber 004 (AB, 2008)

Automatic Verification of the Adequacy of Models for Families of Geometric Objects. - Aless Lasaruk; Thomas Sturm 001 (Automated Deduction in Geometry, 2008)

Effective Quantifier Elimination for Presburger Arithmetic with Infinity. - Aless Lasaruk; Thomas Sturm 001 (CASC, 2009)

Investigating Algebraic and Logical Algorithms to Solve Hopf Bifurcation Problems in Algebraic Biology. - Thomas Sturm 001; Andreas Weber 004; Essam O. Abdel-Rahman; M'hammed El Kahoui (Math. Comput. Sci., 2009)

Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests. - Winfried Neun; Thomas Sturm 001; Stefan Vigerske (CASC, 2010)

Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk). - Andreas Weber 004; Thomas Sturm 001; Werner M. Seiler; Essam O. Abdel-Rahman (CASC, 2010)

A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra. - Erika Ábrahám; Florian Corzilius; Ulrich Loup; Thomas Sturm 001 (Verification over discrete-continuous boundaries, 2010)

Parametric quantified SAT solving. - Thomas Sturm 001; Christoph Zengler (ISSAC, 2010)

On Muldowney's Criteria for Polynomial Vector Fields with Constraints. - Hassan Errami; Werner M. Seiler; Thomas Sturm 001; Andreas Weber 004 (CASC, 2011)

Verification and synthesis using real quantifier elimination. - Thomas Sturm 001; Ashish Tiwari 001 (ISSAC, 2011)

Symbolic Methods for Chemical Reaction Networks (Dagstuhl Seminar 12462). - François Boulier; Anne Shiu; Thomas Sturm 001; Andreas Weber 004 (Dagstuhl Reports, 2012)

Foreword. - Stefan Ratschan; Thomas Sturm 001 (Math. Comput. Sci., 2012)

Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates. - Hassan Errami; Markus Eiswirth; Dima Grigoriev; Werner M. Seiler; Thomas Sturm 001; Andreas Weber 004 (CASC, 2013)

Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages. - Ralf Karrenberg; Marek Kosta; Thomas Sturm 001 (FroCos, 2013)

Towards Conflict-Driven Learning for Virtual Substitution. - Konstantin Korovin; Marek Kosta; Thomas Sturm 001 (CASC, 2014)

Linear Integer Arithmetic Revisited. - Martin Bromberger; Thomas Sturm 001; Christoph Weidenbach (CADE, 2015)

Subtropical Real Root Finding. - Thomas Sturm 001 (ISSAC, 2015)

A Generalized Framework for Virtual Substitution. - Marek Kosta; Thomas Sturm 001 (CoRR, 2015)

Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471). - Erika Ábrahám; Pascal Fontaine; Thomas Sturm 001; Dongming Wang 001 (Dagstuhl Reports, 2015)

Detection of Hopf bifurcations in chemical reaction networks using convex coordinates. - Hassan Errami; Markus Eiswirth; Dima Grigoriev; Werner M. Seiler; Thomas Sturm 001; Andreas Weber 004 (J. Comput. Phys., 2015)

Foreword to the Special Focus on Constraints and Combinations. - Pascal Fontaine; Thomas Sturm 001; Uwe Waldmann (Math. Comput. Sci., 2015)

Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. - Thomas Sturm 001; Marco Voigt; Christoph Weidenbach (LICS, 2016)

SC2: Satisfiability Checking Meets Symbolic Computation - (Project Paper). - Erika Ábrahám; John Abbott; Bernd Becker 001; Anna Maria Bigatti; Martin Brain; Bruno Buchberger; Alessandro Cimatti; James H. Davenport; Matthew England 001; Pascal Fontaine; Stephen Forrest; Alberto Griggio; et al. (CICM, 2016)

Satisfiability checking and symbolic computation. - Erika Ábrahám; John Abbott; Bernd Becker 001; Anna Maria Bigatti; Martin Brain; Bruno Buchberger; Alessandro Cimatti; James H. Davenport; Matthew England 001; Pascal Fontaine; Stephen Forrest; Alberto Griggio; et al. (ACM Commun. Comput. Algebra, 2016)

Satisfiability Checking meets Symbolic Computation (Project Paper). - Erika Ábrahám; John Abbott; Bernd Becker 001; Anna Maria Bigatti; Martin Brain; Bruno Buchberger; Alessandro Cimatti; James H. Davenport; Matthew England 001; Pascal Fontaine; Stephen Forrest; Alberto Griggio; et al. (CoRR, 2016)

Better answers to real questions. - Marek Kosta; Thomas Sturm 001; Andreas Dolzmann (J. Symb. Comput., 2016)

Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks. - Matthew England 001; Hassan Errami; Dima Grigoriev; Ovidiu Radulescu; Thomas Sturm 001; Andreas Weber 004 (CASC, 2017)

Subtropical Satisfiability. - Pascal Fontaine; Mizuhito Ogawa; Thomas Sturm 001; Xuan-Tung Vu (FroCoS, 2017)

A Case Study on the Parametric Occurrence of Multiple Steady States. - Russell J. Bradford; James H. Davenport; Matthew England 001; Hassan Errami; Vladimir P. Gerdt; Dima Grigoriev; Charles Tapley Hoyt; Marek Kosta; Ovidiu Radulescu; Thomas Sturm 001; Andreas Weber 004 (ISSAC, 2017)

A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications. - Thomas Sturm 001 (Math. Comput. Sci., 2017)

Positive Solutions of Systems of Signed Parametric Polynomial Inequalities. - Hoon Hong; Thomas Sturm 001 (CASC, 2018)

Thirty Years of Virtual Substitution: Foundations, Techniques, Applications. - Thomas Sturm 001 (ISSAC, 2018)

Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT. - Pascal Fontaine; Mizuhito Ogawa; Thomas Sturm 001; To Van Khanh; Xuan-Tung Vu (SC-Square@FLOC, 2018)

The SYMBIONT project: symbolic methods for biological networks. - François Boulier; François Fages; Ovidiu Radulescu; Satya Swarup Samal; Andreas Schuppert; Werner M. Seiler; Thomas Sturm 001; Sebastian Walcher; Andreas Weber 004 (ACM Commun. Comput. Algebra, 2018)

A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks. - Hamid Rahkooy; Ovidiu Radulescu; Thomas Sturm 001 (CASC, 2020)

First-Order Tests for Toricity. - Hamid Rahkooy; Thomas Sturm 001 (CASC, 2020)

A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks. - Hamid Rahkooy; Thomas Sturm 001 (CoRR, 2020)

Identifying the parametric occurrence of multiple steady states for some biological networks. - Russell J. Bradford; James H. Davenport; Matthew England 001; Hassan Errami; Vladimir P. Gerdt; Dima Grigoriev; Charles Tapley Hoyt; Marek Kosta; Ovidiu Radulescu; Thomas Sturm 001; Andreas Weber 004 (J. Symb. Comput., 2020)

A complete and terminating approach to linear integer solving. - Martin Bromberger; Thomas Sturm 001; Christoph Weidenbach (J. Symb. Comput., 2020)

Symbolic computation and satisfiability checking. - James H. Davenport; Matthew England 001; Alberto Griggio; Thomas Sturm 001; Cesare Tinelli (J. Symb. Comput., 2020)

Parametric Toricity of Steady State Varieties of Reaction Networks. - Hamid Rahkooy; Thomas Sturm 001 (CASC, 2021)

Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems. - Hamid Rahkooy; Thomas Sturm 001 (CASC, 2021)

Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner System. - Hamid Rahkooy; Thomas Sturm 001 (CoRR, 2021)

Foreword, with a Dedication to Vladimir Gerdt. - Matthew England 001; François Boulier; Timur M. Sadykov 001; Thomas Sturm 001 (Math. Comput. Sci., 2021)

Foreword, with a Dedication to Andreas Weber. - Matthew England 001; Wolfram Koepf; Timur M. Sadykov 001; Werner M. Seiler; Thomas Sturm 001 (Math. Comput. Sci., 2021)

Efficiently and Effectively Recognizing Toricity of Steady State Varieties. - Dima Grigoriev; Alexandru Iosif; Hamid Rahkooy; Thomas Sturm 001; Andreas Weber 004 (Math. Comput. Sci., 2021)

Algorithmic Reduction of Biological Networks with Multiple Time Scales. - Niclas Kruff; Christoph Lüders; Ovidiu Radulescu; Thomas Sturm 001; Sebastian Walcher (Math. Comput. Sci., 2021)

A Logic Based Approach to Finding Real Singularities of Implicit Ordinary Differential Equations. - Werner M. Seiler; Matthias Seiß; Thomas Sturm 001 (Math. Comput. Sci., 2021)

ODEbase: A Repository of ODE Systems for Systems Biology. - Christoph Lüders; Thomas Sturm 001; Ovidiu Radulescu (CoRR, 2022)

Foreword. - Matthew England 001; François Boulier; Timur M. Sadykov 001; Thomas Sturm 001 (Math. Comput. Sci., 2022)

Reduction of Chemical Reaction Networks with Approximate Conservation Laws. - Aurélien Desoeuvres; Alexandru Iosif; Christoph Lüders; Ovidiu Radulescu; Hamid Rahkooy; Matthias Seiß; Thomas Sturm 001 (SIAM J. Appl. Dyn. Syst., 2024)

A Computational Approach to Polynomial Conservation Laws. - Aurélien Desoeuvres; Alexandru Iosif; Christoph Lüders; Ovidiu Radulescu; Hamid Rahkooy; Matthias Seiß; Thomas Sturm 001 (SIAM J. Appl. Dyn. Syst., 2024)