Thomas Sturm

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 42

Top Topics

Integer Arithmetic

Frequently Asked Questions

Universally Quantified

Top Venues

Math. Comput. Sci.

J. Symb. Comput.

Publications

Aurélien Desoeuvres, Alexandru Iosif, Christoph Lüders, Ovidiu Radulescu, Hamid Rahkooy, Matthias Seiß, Thomas Sturm
Reduction of Chemical Reaction Networks with Approximate Conservation Laws. SIAM J. Appl. Dyn. Syst. 23 (1) (2024)
Aurélien Desoeuvres, Alexandru Iosif, Christoph Lüders, Ovidiu Radulescu, Hamid Rahkooy, Matthias Seiß, Thomas Sturm
A Computational Approach to Polynomial Conservation Laws. SIAM J. Appl. Dyn. Syst. 23 (1) (2024)
Matthew England, François Boulier, Timur M. Sadykov, Thomas Sturm
Foreword. Math. Comput. Sci. 17 (3) (2023)
Christoph Lüders, Thomas Sturm, Ovidiu Radulescu
ODEbase: A Repository of ODE Systems for Systems Biology. CoRR (2022)
Matthew England, François Boulier, Timur M. Sadykov, Thomas Sturm
Foreword. Math. Comput. Sci. 16 (2) (2022)
Hamid Rahkooy, Thomas Sturm
Parametric Toricity of Steady State Varieties of Reaction Networks. CoRR (2021)
Niclas Kruff, Christoph Lüders, Ovidiu Radulescu, Thomas Sturm, Sebastian Walcher
Algorithmic Reduction of Biological Networks with Multiple Time Scales. Math. Comput. Sci. 15 (3) (2021)
Matthew England, François Boulier, Timur M. Sadykov, Thomas Sturm
Foreword, with a Dedication to Vladimir Gerdt. Math. Comput. Sci. 15 (3) (2021)
Hamid Rahkooy, Thomas Sturm
Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems. CASC (2021)
Matthew England, Wolfram Koepf, Timur M. Sadykov, Werner M. Seiler, Thomas Sturm
Foreword, with a Dedication to Andreas Weber. Math. Comput. Sci. 15 (2) (2021)
Werner M. Seiler, Matthias Seiß, Thomas Sturm
A Logic Based Approach to Finding Real Singularities of Implicit Ordinary Differential Equations. Math. Comput. Sci. 15 (2) (2021)
Dima Grigoriev, Alexandru Iosif, Hamid Rahkooy, Thomas Sturm, Andreas Weber
Efficiently and Effectively Recognizing Toricity of Steady State Varieties. Math. Comput. Sci. 15 (2) (2021)
Hamid Rahkooy, Thomas Sturm
Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner System. CoRR (2021)
Hamid Rahkooy, Thomas Sturm
Parametric Toricity of Steady State Varieties of Reaction Networks. CASC (2021)
James H. Davenport, Matthew England, Alberto Griggio, Thomas Sturm, Cesare Tinelli
Symbolic computation and satisfiability checking. J. Symb. Comput. 100 (2020)
Russell J. Bradford, James H. Davenport, Matthew England, Hassan Errami, Vladimir P. Gerdt, Dima Grigoriev, Charles Tapley Hoyt, Marek Kosta, Ovidiu Radulescu, Thomas Sturm, Andreas Weber
Identifying the parametric occurrence of multiple steady states for some biological networks. J. Symb. Comput. 98 (2020)
Hamid Rahkooy, Thomas Sturm
First-Order Tests for Toricity. CoRR (2020)
Niclas Kruff, Christoph Lüders, Ovidiu Radulescu, Thomas Sturm, Sebastian Walcher
Algorithmic Reduction of Biological Networks With Multiple Time Scales. CoRR (2020)
Hamid Rahkooy, Ovidiu Radulescu, Thomas Sturm
A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks. CASC (2020)
Martin Bromberger, Thomas Sturm, Christoph Weidenbach
A complete and terminating approach to linear integer solving. J. Symb. Comput. 100 (2020)
Hamid Rahkooy, Thomas Sturm
A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks. CoRR (2020)
Hamid Rahkooy, Thomas Sturm
First-Order Tests for Toricity. CASC (2020)
Russell J. Bradford, James H. Davenport, Matthew England, Hassan Errami, Vladimir P. Gerdt, Dima Grigoriev, Charles Tapley Hoyt, Marek Kosta, Ovidiu Radulescu, Thomas Sturm, Andreas Weber
Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks. CoRR (2019)
Dima Grigoriev, Alexandru Iosif, Hamid Rahkooy, Thomas Sturm, Andreas Weber
Efficiently and Effectively Recognizing Toricity of Steady State Varieties. CoRR (2019)
François Boulier, François Fages, Ovidiu Radulescu, Satya Swarup Samal, Andreas Schuppert, Werner M. Seiler, Thomas Sturm, Sebastian Walcher, Andreas Weber
The SYMBIONT project: symbolic methods for biological networks. ACM Commun. Comput. Algebra 52 (3) (2018)
Thomas Sturm
Thirty Years of Virtual Substitution: Foundations, Techniques, Applications. ISSAC (2018)
Hoon Hong, Thomas Sturm
Positive Solutions of Systems of Signed Parametric Polynomial Inequalities. CoRR (2018)
Hoon Hong, Thomas Sturm
Positive Solutions of Systems of Signed Parametric Polynomial Inequalities. CASC (2018)
Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, To Van Khanh, Xuan-Tung Vu
Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT. SC-Square@FLOC (2018)
Matthew England, Hassan Errami, Dima Grigoriev, Ovidiu Radulescu, Thomas Sturm, Andreas Weber
Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks. CASC (2017)
Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan-Tung Vu
Subtropical Satisfiability. FroCoS (2017)
Thomas Sturm
A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications. Math. Comput. Sci. 11 (3-4) (2017)
Matthew England, Hassan Errami, Dima Grigoriev, Ovidiu Radulescu, Thomas Sturm, Andreas Weber
Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks. CoRR (2017)
Russell J. Bradford, James H. Davenport, Matthew England, Hassan Errami, Vladimir P. Gerdt, Dima Grigoriev, Charles Tapley Hoyt, Marek Kosta, Ovidiu Radulescu, Thomas Sturm, Andreas Weber
A Case Study on the Parametric Occurrence of Multiple Steady States. ISSAC (2017)
Russell J. Bradford, James H. Davenport, Matthew England, Hassan Errami, Vladimir P. Gerdt, Dima Grigoriev, Charles Tapley Hoyt, Marek Kosta, Ovidiu Radulescu, Thomas Sturm, Andreas Weber
A Case Study on the Parametric Occurrence of Multiple Steady States. CoRR (2017)
Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan-Tung Vu
Subtropical Satisfiability. CoRR (2017)
Thomas Sturm, Marco Voigt, Christoph Weidenbach
Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. LICS (2016)
Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm
Satisfiability Checking meets Symbolic Computation (Project Paper). CoRR (2016)
Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm
Satisfiability Checking and Symbolic Computation. CoRR (2016)
Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm
Satisfiability checking and symbolic computation. ACM Commun. Comput. Algebra 50 (4) (2016)
Marek Kosta, Thomas Sturm, Andreas Dolzmann
Better answers to real questions. J. Symb. Comput. 74 (2016)
Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm
: Satisfiability Checking Meets Symbolic Computation - (Project Paper). CICM (2016)
Thomas Sturm, Marco Voigt, Christoph Weidenbach
Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. CoRR (2015)
Thomas Sturm
Subtropical Real Root Finding. ISSAC (2015)
Marek Kosta, Thomas Sturm
A Generalized Framework for Virtual Substitution. CoRR (2015)
Martin Bromberger, Thomas Sturm, Christoph Weidenbach
Linear Integer Arithmetic Revisited. CADE (2015)
Erika Ábrahám, Pascal Fontaine, Thomas Sturm, Dongming Wang
Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471). Dagstuhl Reports 5 (11) (2015)
Hassan Errami, Markus Eiswirth, Dima Grigoriev, Werner M. Seiler, Thomas Sturm, Andreas Weber
Detection of Hopf bifurcations in chemical reaction networks using convex coordinates. J. Comput. Phys. 291 (2015)
Thomas Sturm
Subtropical Real Root Finding. CoRR (2015)
Pascal Fontaine, Thomas Sturm, Uwe Waldmann
Foreword to the Special Focus on Constraints and Combinations. Math. Comput. Sci. 9 (3) (2015)
Martin Bromberger, Thomas Sturm, Christoph Weidenbach
Linear Integer Arithmetic Revisited. CoRR (2015)
Marek Kosta, Thomas Sturm, Andreas Dolzmann
Better Answers to Real Questions. CoRR (2015)
Konstantin Korovin, Marek Kosta, Thomas Sturm
Towards Conflict-Driven Learning for Virtual Substitution. CASC (2014)
Konstantin Korovin, Marek Kosta, Thomas Sturm
Towards Conflict-Driven Learning for Virtual Substitution. SMT (2014)
Marek Kosta, Thomas Sturm, Andreas Dolzmann
Better Answers to Real Questions. SMT (2014)
Hassan Errami, Markus Eiswirth, Dima Grigoriev, Werner M. Seiler, Thomas Sturm, Andreas Weber
Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates. CASC (2013)
Ralf Karrenberg, Marek Kosta, Thomas Sturm
Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages. FroCos (2013)
Stefan Ratschan, Thomas Sturm
Foreword. Math. Comput. Sci. 6 (4) (2012)
François Boulier, Anne Shiu, Thomas Sturm, Andreas Weber
Symbolic Methods for Chemical Reaction Networks (Dagstuhl Seminar 12462). Dagstuhl Reports 2 (11) (2012)
Thomas Sturm, Ashish Tiwari
Verification and synthesis using real quantifier elimination. ISSAC (2011)
Hassan Errami, Werner M. Seiler, Thomas Sturm, Andreas Weber
On Muldowney's Criteria for Polynomial Vector Fields with Constraints. CASC (2011)
Winfried Neun, Thomas Sturm, Stefan Vigerske
Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests. CASC (2010)
Erika Ábrahám, Florian Corzilius, Ulrich Loup, Thomas Sturm
A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra. Verification over discrete-continuous boundaries (2010)
Thomas Sturm, Christoph Zengler
Parametric quantified SAT solving. ISSAC (2010)
Andreas Weber, Thomas Sturm, Werner M. Seiler, Essam O. Abdel-Rahman
Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk). CASC (2010)
Aless Lasaruk, Thomas Sturm
Effective Quantifier Elimination for Presburger Arithmetic with Infinity. CASC (2009)
Thomas Sturm, Andreas Weber, Essam O. Abdel-Rahman, M'hammed El Kahoui
Investigating Algebraic and Logical Algorithms to Solve Hopf Bifurcation Problems in Algebraic Biology. Math. Comput. Sci. 2 (3) (2009)
Aless Lasaruk, Thomas Sturm
Automatic Verification of the Adequacy of Models for Families of Geometric Objects. Automated Deduction in Geometry (2008)
Thomas Sturm, Andreas Weber
Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology. AB (2008)
Aless Lasaruk, Thomas Sturm
Weak quantifier elimination for the full linear theory of the integers. Appl. Algebra Eng. Commun. Comput. 18 (6) (2007)
Aless Lasaruk, Thomas Sturm
Weak Integer Quantifier Elimination Beyond the Linear Case. CASC (2007)
Hirokazu Anai, Thomas Sturm
Editorial. Appl. Algebra Eng. Commun. Comput. 18 (6) (2007)
Thomas Sturm
New Domains for Applied Quantifier Elimination. CASC (2006)
Andreas Dolzmann, Thomas Sturm
Editorial. J. Symb. Comput. 41 (11) (2006)
Thomas Sturm
Quantifier Elimination for Constraint Logic Programming. CASC (2005)
Andreas Dolzmann, Andreas Seidl, Thomas Sturm
Efficient projection orders for CAD. ISSAC (2004)
Andreas Seidl, Thomas Sturm
A generic projection operator for partial cylindrical algebraic decomposition. ISSAC (2003)
Thomas Sturm
Integration of Quantifier Elimination with Constraint Logic Programming. AISC (2002)
Andreas Dolzmann, Thomas Sturm
Parametric Systems of Linear Congruences. CASC (2001)
Thomas Sturm
Linear Problems in Valued Fields. J. Symb. Comput. 30 (2) (2000)
Andreas Dolzmann, Thomas Sturm
P-adic Constraint Solving. ISSAC (1999)
Thomas Sturm
Reasoning over Networks by Symbolic Methods. Appl. Algebra Eng. Commun. Comput. 10 (1) (1999)
Andreas Dolzmann, Thomas Sturm, Volker Weispfenning
A New Approach for Automatic Theorem Proving in Real Geometry. J. Autom. Reason. 21 (3) (1998)
Andreas Dolzmann, Oliver Gloor, Thomas Sturm
Approaches to Parallel Quantifier Elimination. ISSAC (1998)
Andreas Dolzmann, Thomas Sturm
Simplification of Quantifier-Free Formulae over Ordered Fields. J. Symb. Comput. 24 (2) (1997)
Andreas Dolzmann, Thomas Sturm
Guarded Expressions in Practice. ISSAC (1997)
Andreas Dolzmann, Thomas Sturm, Volker Weispfenning
Real Quantifier Elimination in Practice. Algorithmic Algebra and Number Theory (1997)
Andreas Dolzmann, Thomas Sturm
REDLOG: computer algebra meets computer logic. SIGSAM Bull. 31 (2) (1997)
Thomas Sturm, Volker Weispfenning
Computational Geometry Problems in REDLOG. Automated Deduction in Geometry (1996)