Thomas Sturm

From MaRDI portal
Person:349839

Available identifiers

zbMath Open sturm.thomasDBLP23/636-1WikidataQ62051645 ScholiaQ62051645MaRDI QIDQ349839

List of research outcomes





PublicationDate of PublicationType
Reduction of Chemical Reaction Networks with Approximate Conservation Laws2024-01-29Paper
A Computational Approach to Polynomial Conservation Laws2022-12-30Paper
A linear algebra approach for detecting binomiality of steady state ideals of reversible chemical reaction networks2022-12-21Paper
First-order tests for toricity2022-12-21Paper
Parametric toricity of steady state varieties of reaction networks2022-03-24Paper
Testing binomiality of chemical reaction networks using comprehensive Gröbner systems2022-03-24Paper
Algorithmic reduction of biological networks with multiple time scales2021-11-24Paper
A logic based approach to finding real singularities of implicit ordinary differential equations2021-06-25Paper
Efficiently and effectively recognizing toricity of steady state varieties2021-06-25Paper
A Case Study on the Parametric Occurrence of Multiple Steady States2020-09-09Paper
Thirty Years of Virtual Substitution2020-09-09Paper
A complete and terminating approach to linear integer solving2020-03-24Paper
Identifying the parametric occurrence of multiple steady states for some biological networks2020-01-15Paper
Positive solutions of systems of signed parametric polynomial inequalities2018-10-23Paper
Deciding First-Order Satisfiability when Universal and Existential Variables are Separated2018-04-23Paper
A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications2018-02-27Paper
Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks2018-02-23Paper
Subtropical satisfiability2018-01-04Paper
Satisfiability checking and symbolic computation2017-06-21Paper
Detection of Hopf bifurcations in chemical reaction networks using convex coordinates2016-12-05Paper
Subtropical real root finding2016-09-29Paper
$$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation2016-08-30Paper
Better answers to real questions2015-12-08Paper
Linear Integer Arithmetic Revisited2015-12-02Paper
Parametric quantified SAT solving2015-09-17Paper
Verification and synthesis using real quantifier elimination2015-06-09Paper
Towards Conflict-Driven Learning for Virtual Substitution2014-09-08Paper
Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates2014-07-07Paper
Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages2013-09-20Paper
On Muldowney’s Criteria for Polynomial Vector Fields with Constraints2011-09-02Paper
Algorithmic global criteria for excluding oscillations2011-06-08Paper
Automatic Verification of the Adequacy of Models for Families of Geometric Objects2011-05-26Paper
Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology2011-02-19Paper
Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests2010-09-10Paper
Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)2010-09-10Paper
Effective Quantifier Elimination for Presburger Arithmetic with Infinity2009-11-10Paper
Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology2009-02-03Paper
Weak quantifier elimination for the full linear theory of the integers2008-09-10Paper
New Domains for Applied Quantifier Elimination2008-07-04Paper
Weak Integer Quantifier Elimination Beyond the Linear Case2008-07-01Paper
Computer Algebra in Scientific Computing2006-07-07Paper
https://portal.mardi4nfdi.de/entity/Q46606732005-04-04Paper
Efficient projection orders for CAD2005-03-14Paper
https://portal.mardi4nfdi.de/entity/Q48087002004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q27602012003-03-13Paper
https://portal.mardi4nfdi.de/entity/Q27020252001-10-03Paper
Linear problems in valued fields2001-02-06Paper
Reasoning over networks by symbolic methods2000-03-08Paper
https://portal.mardi4nfdi.de/entity/Q42477901999-08-31Paper
https://portal.mardi4nfdi.de/entity/Q42324801999-08-23Paper
A new approach for automatic theorem proving in real geometry1999-04-11Paper
https://portal.mardi4nfdi.de/entity/Q42269911999-02-23Paper
https://portal.mardi4nfdi.de/entity/Q38387721998-10-26Paper
Simplification of quantifier-free formulae over ordered fields1997-09-29Paper

Research outcomes over time

This page was built for person: Thomas Sturm