default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Sturm 0001
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation: Saarland University, Saarbrücken, Germany
- affiliation: CNRS, Nancy, France
- affiliation (former): University of Cantabria, Department of Mathematics, Statistics and Computing, Santander, Spain
- affiliation (former): University of Passau, Department of Informatics and Mathematics, Germany
Other persons with the same name
- Thomas Sturm — disambiguation page
- Thomas Sturm 0002
![[0000-0001-5698-3542]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-5698-3542")
— Autonomous University of Barcelona, Spain (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j28]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): 256-296 (2024)- [j27]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): 813-854 (2024) - 2023
- [j26]Matthew England, François Boulier, Timur M. Sadykov, Thomas Sturm:
Foreword. Math. Comput. Sci. 17(3): 22 (2023) - [e3]Erika Ábrahám, Thomas Sturm:
Proceedings of the 8th SC-Square Workshop co-located with the 48th International Symposium on Symbolic and Algebraic Computation, SC-Square@ISSAC 2023, Tromsø, Norway, July 28, 2023. CEUR Workshop Proceedings 3455, CEUR-WS.org 2023 [contents] - 2022
- [j25]Matthew England, François Boulier, Timur M. Sadykov, Thomas Sturm:
Foreword. Math. Comput. Sci. 16(2-3): 16 (2022) - [i22]Christoph Lüders, Thomas Sturm, Ovidiu Radulescu:
ODEbase: A Repository of ODE Systems for Systems Biology. CoRR abs/2201.08980 (2022) - 2021
- [j24]Matthew England, Wolfram Koepf, Timur M. Sadykov, Werner M. Seiler, Thomas Sturm:
Foreword, with a Dedication to Andreas Weber. Math. Comput. Sci. 15(2): 173-175 (2021) - [j23]Dima Grigoriev, Alexandru Iosif, Hamid Rahkooy, Thomas Sturm, Andreas Weber:
Efficiently and Effectively Recognizing Toricity of Steady State Varieties. Math. Comput. Sci. 15(2): 199-232 (2021) - [j22]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): 333-352 (2021) - [j21]Matthew England, François Boulier, Timur M. Sadykov, Thomas Sturm:
Foreword, with a Dedication to Vladimir Gerdt. Math. Comput. Sci. 15(3): 369-371 (2021) - [j20]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): 499-534 (2021) - [c39]Hamid Rahkooy, Thomas Sturm:
Parametric Toricity of Steady State Varieties of Reaction Networks. CASC 2021: 314-333 - [c38]Hamid Rahkooy, Thomas Sturm:
Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems. CASC 2021: 334-352 - [i21]Hamid Rahkooy, Thomas Sturm:
Parametric Toricity of Steady State Varieties of Reaction Networks. CoRR abs/2105.10853 (2021) - [i20]Hamid Rahkooy, Thomas Sturm:
Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner System. CoRR abs/2107.01706 (2021) - 2020
- [j19]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: 84-119 (2020) - [j18]James H. Davenport, Matthew England, Alberto Griggio, Thomas Sturm, Cesare Tinelli:
Symbolic computation and satisfiability checking. J. Symb. Comput. 100: 1-10 (2020) - [j17]Martin Bromberger, Thomas Sturm, Christoph Weidenbach:
A complete and terminating approach to linear integer solving. J. Symb. Comput. 100: 102-136 (2020) - [c37]Hamid Rahkooy, Ovidiu Radulescu, Thomas Sturm:
A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks. CASC 2020: 492-509 - [c36]Hamid Rahkooy, Thomas Sturm:
First-Order Tests for Toricity. CASC 2020: 510-527 - [i19]Hamid Rahkooy, Thomas Sturm:
First-Order Tests for Toricity. CoRR abs/2002.03586 (2020) - [i18]Hamid Rahkooy, Thomas Sturm:
A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks. CoRR abs/2002.12693 (2020) - [i17]Niclas Kruff, Christoph Lüders, Ovidiu Radulescu, Thomas Sturm, Sebastian Walcher:
Algorithmic Reduction of Biological Networks With Multiple Time Scales. CoRR abs/2010.10129 (2020)
2010 – 2019
- 2019
- [i16]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 abs/1902.04882 (2019) - [i15]Dima Grigoriev, Alexandru Iosif, Hamid Rahkooy, Thomas Sturm, Andreas Weber:
Efficiently and Effectively Recognizing Toricity of Steady State Varieties. CoRR abs/1910.04100 (2019) - 2018
- [j16]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): 67-70 (2018) - [c35]Hoon Hong, Thomas Sturm:
Positive Solutions of Systems of Signed Parametric Polynomial Inequalities. CASC 2018: 238-253 - [c34]Thomas Sturm:
Thirty Years of Virtual Substitution: Foundations, Techniques, Applications. ISSAC 2018: 11-16 - [c33]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: 110 - [i14]Hoon Hong, Thomas Sturm:
Positive Solutions of Systems of Signed Parametric Polynomial Inequalities. CoRR abs/1804.09705 (2018) - 2017
- [j15]Thomas Sturm:
A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications. Math. Comput. Sci. 11(3-4): 483-502 (2017) - [c32]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: 93-108 - [c31]Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan-Tung Vu:
Subtropical Satisfiability. FroCoS 2017: 189-206 - [c30]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: 45-52 - [i13]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 abs/1704.08997 (2017) - [i12]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 abs/1706.08794 (2017) - [i11]Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan-Tung Vu:
Subtropical Satisfiability. CoRR abs/1706.09236 (2017) - 2016
- [j14]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): 145-147 (2016) - [j13]Marek Kosta, Thomas Sturm, Andreas Dolzmann:
Better answers to real questions. J. Symb. Comput. 74: 255-275 (2016) - [c29]Thomas Sturm, Marco Voigt, Christoph Weidenbach:
Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. LICS 2016: 86-95 - [c28]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:
SC2: Satisfiability Checking Meets Symbolic Computation - (Project Paper). CICM 2016: 28-43 - [i10]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 abs/1607.06945 (2016) - [i9]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 abs/1607.08028 (2016) - 2015
- [j12]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: 279-302 (2015) - [j11]Pascal Fontaine, Thomas Sturm, Uwe Waldmann:
Foreword to the Special Focus on Constraints and Combinations. Math. Comput. Sci. 9(3): 265 (2015) - [c27]Martin Bromberger, Thomas Sturm, Christoph Weidenbach:
Linear Integer Arithmetic Revisited. CADE 2015: 623-637 - [c26]Thomas Sturm:
Subtropical Real Root Finding. ISSAC 2015: 347-354 - [i8]Thomas Sturm:
Subtropical Real Root Finding. CoRR abs/1501.04836 (2015) - [i7]Marek Kosta, Thomas Sturm, Andreas Dolzmann:
Better Answers to Real Questions. CoRR abs/1501.05098 (2015) - [i6]Marek Kosta, Thomas Sturm:
A Generalized Framework for Virtual Substitution. CoRR abs/1501.05826 (2015) - [i5]Martin Bromberger, Thomas Sturm, Christoph Weidenbach:
Linear Integer Arithmetic Revisited. CoRR abs/1503.02948 (2015) - [i4]Thomas Sturm, Marco Voigt, Christoph Weidenbach:
Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. CoRR abs/1511.08999 (2015) - [i3]Erika Ábrahám, Pascal Fontaine, Thomas Sturm, Dongming Wang:
Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471). Dagstuhl Reports 5(11): 71-89 (2015) - 2014
- [c25]Konstantin Korovin, Marek Kosta, Thomas Sturm:
Towards Conflict-Driven Learning for Virtual Substitution. CASC 2014: 256-270 - [c24]Marek Kosta, Thomas Sturm, Andreas Dolzmann:
Better Answers to Real Questions. SMT 2014: 69 - [c23]Konstantin Korovin, Marek Kosta, Thomas Sturm:
Towards Conflict-Driven Learning for Virtual Substitution. SMT 2014: 71 - 2013
- [c22]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: 88-99 - [c21]Ralf Karrenberg, Marek Kosta, Thomas Sturm:
Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages. FroCos 2013: 56-70 - 2012
- [j10]Stefan Ratschan, Thomas Sturm:
Foreword. Math. Comput. Sci. 6(4): 345 (2012) - [i2]François Boulier, Anne Shiu, Thomas Sturm, Andreas Weber:
Symbolic Methods for Chemical Reaction Networks (Dagstuhl Seminar 12462). Dagstuhl Reports 2(11): 66-86 (2012) - 2011
- [c20]Hassan Errami, Werner M. Seiler, Thomas Sturm, Andreas Weber:
On Muldowney's Criteria for Polynomial Vector Fields with Constraints. CASC 2011: 135-143 - [c19]Thomas Sturm, Ashish Tiwari:
Verification and synthesis using real quantifier elimination. ISSAC 2011: 329-336 - [e2]Thomas Sturm, Christoph Zengler:
Automated Deduction in Geometry - 7th International Workshop, ADG 2008, Shanghai, China, September 22-24, 2008. Revised Papers. Lecture Notes in Computer Science 6301, Springer 2011, ISBN 978-3-642-21045-7 [contents] - 2010
- [c18]Winfried Neun, Thomas Sturm, Stefan Vigerske:
Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests. CASC 2010: 205-219 - [c17]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: 267-279 - [c16]Thomas Sturm, Christoph Zengler:
Parametric quantified SAT solving. ISSAC 2010: 77-84 - [i1]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
2000 – 2009
- 2009
- [j9]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): 493-515 (2009) - [c15]Aless Lasaruk, Thomas Sturm:
Effective Quantifier Elimination for Presburger Arithmetic with Infinity. CASC 2009: 195-212 - 2008
- [c14]Thomas Sturm, Andreas Weber:
Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology. AB 2008: 200-215 - [c13]Aless Lasaruk, Thomas Sturm:
Automatic Verification of the Adequacy of Models for Families of Geometric Objects. Automated Deduction in Geometry 2008: 116-140 - 2007
- [j8]Hirokazu Anai, Thomas Sturm:
Editorial. Appl. Algebra Eng. Commun. Comput. 18(6): 495-496 (2007) - [j7]Aless Lasaruk, Thomas Sturm:
Weak quantifier elimination for the full linear theory of the integers. Appl. Algebra Eng. Commun. Comput. 18(6): 545-574 (2007) - [c12]Aless Lasaruk, Thomas Sturm:
Weak Integer Quantifier Elimination Beyond the Linear Case. CASC 2007: 275-294 - 2006
- [j6]Andreas Dolzmann, Thomas Sturm:
Editorial. J. Symb. Comput. 41(11): 1155-1156 (2006) - [c11]Thomas Sturm:
New Domains for Applied Quantifier Elimination. CASC 2006: 295-301 - 2005
- [c10]Thomas Sturm:
Quantifier Elimination for Constraint Logic Programming. CASC 2005: 416-430 - [e1]Andreas Dolzmann, Andreas Seidl, Thomas Sturm:
Algorithmic Algebra and Logic. Proceedings of the A3L 2005, April 3-6, Passau, Germany; Conference in Honor of the 60th Birthday of Volker Weispfenning. Books on Demand 2005, ISBN 3-8334-2669-1, pp. i-xii, 1-558 [contents] - 2004
- [c9]Andreas Dolzmann, Andreas Seidl, Thomas Sturm:
Efficient projection orders for CAD. ISSAC 2004: 111-118 - 2003
- [c8]Andreas Seidl, Thomas Sturm:
A generic projection operator for partial cylindrical algebraic decomposition. ISSAC 2003: 240-247 - 2002
- [c7]Thomas Sturm:
Integration of Quantifier Elimination with Constraint Logic Programming. AISC 2002: 7-11 - 2001
- [c6]Andreas Dolzmann, Thomas Sturm:
Parametric Systems of Linear Congruences. CASC 2001: 149-166 - 2000
- [j5]Thomas Sturm:
Linear Problems in Valued Fields. J. Symb. Comput. 30(2): 207-219 (2000)
1990 – 1999
- 1999
- [j4]Thomas Sturm:
Reasoning over Networks by Symbolic Methods. Appl. Algebra Eng. Commun. Comput. 10(1): 79-96 (1999) - [c5]Andreas Dolzmann, Thomas Sturm:
P-adic Constraint Solving. ISSAC 1999: 151-158 - 1998
- [j3]Andreas Dolzmann, Thomas Sturm, Volker Weispfenning:
A New Approach for Automatic Theorem Proving in Real Geometry. J. Autom. Reason. 21(3): 357-380 (1998) - [c4]Andreas Dolzmann, Oliver Gloor, Thomas Sturm:
Approaches to Parallel Quantifier Elimination. ISSAC 1998: 88-95 - 1997
- [j2]Andreas Dolzmann, Thomas Sturm:
REDLOG: computer algebra meets computer logic. SIGSAM Bull. 31(2): 2-9 (1997) - [j1]Andreas Dolzmann, Thomas Sturm:
Simplification of Quantifier-Free Formulae over Ordered Fields. J. Symb. Comput. 24(2): 209-231 (1997) - [c3]Andreas Dolzmann, Thomas Sturm, Volker Weispfenning:
Real Quantifier Elimination in Practice. Algorithmic Algebra and Number Theory 1997: 221-247 - [c2]Andreas Dolzmann, Thomas Sturm:
Guarded Expressions in Practice. ISSAC 1997: 376-383 - 1996
- [c1]Thomas Sturm, Volker Weispfenning:
Computational Geometry Problems in REDLOG. Automated Deduction in Geometry 1996: 58-86
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 18:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
