Thomas Sturm

发表

A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra

Erika Ábrahám, Florian Corzilius, Ulrich Loup, 2010, Verification over discrete-continuous boundaries.

Detection of Hopf bifurcations in chemical reaction networks using convex coordinates

Dima Grigoriev, Thomas Sturm, Werner M. Seiler, 2015, J. Comput. Phys..

Subtropical Satisfiability pdf

Mizuhito Ogawa, Thomas Sturm, Pascal Fontaine, 2017, FroCoS.

Design and Completion of the PMDIS/TRAC Table

Thomas Sturm, 2003 .

Guarded expressions in practice

Thomas Sturm, Andreas Dolzmann, Andreas Dolzmann, 1997, ISSAC.

Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology

Thomas Sturm, Andreas Weber, A. Weber, 2008, AB.

Reasoning over Networks by Symbolic Methods

Thomas Sturm, T. Sturm, 1999, Applicable Algebra in Engineering, Communication and Computing.

Investigating Algebraic and Logical Algorithms to Solve Hopf Bifurcation Problems in Algebraic Biology

Thomas Sturm, M'hammed El Kahoui, Andreas Weber, 2009, Math. Comput. Sci..

A New Approach for Automatic Theorem Proving in Real Geometry

Thomas Sturm, Volker Weispfenning, Andreas Dolzmann, 1998, Journal of Automated Reasoning.

Thirty Years of Virtual Substitution

Thomas Sturm, 2018 .

Parametric quantified SAT solving

Thomas Sturm, Christoph Zengler, T. Sturm, 2010, ISSAC.

SC2: Satisfiability Checking Meets Symbolic Computation - (Project Paper)

Daniel Kroening, Bernd Becker, Matthew England, 2016, CICM.

Simplification of Quantifier-Free Formulae over Ordered Fields

Thomas Sturm, Andreas Dolzmann, Andreas Dolzmann, 1997, J. Symb. Comput..

Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471)

Dongming Wang, Erika Ábrahám, Thomas Sturm, 2015, Dagstuhl Reports.

Weak Integer Quantifier Elimination Beyond the Linear Case

Thomas Sturm, Aless Lasaruk, T. Sturm, 2007, CASC.

Analysis and Implementation of LIA solvers: CutSAT and BBSAT

Christoph Weidenbach, Thomas Sturm, Martin Bromberger, 2016 .

A Case Study on the Parametric Occurrence of Multiple Steady States

Matthew England, James H. Davenport, Dima Grigoriev, 2017, ISSAC.

Deciding First-Order Satisfiability when Universal and Existential Variables are Separated

Christoph Weidenbach, Thomas Sturm, Marco Voigt, 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

New Domains for Applied Quantifier Elimination

Thomas Sturm, T. Sturm, 2006, CASC.

Subtropical Real Root Finding

Thomas Sturm, T. Sturm, 2015, ISSAC.

Computational Geometry Problems in REDLOG

Thomas Sturm, Volker Weispfenning, V. Weispfenning, 1996, Automated Deduction in Geometry.

Linear Problems in Valued Fields

Thomas Sturm, T. Sturm, 2000, J. Symb. Comput..

Positive Solutions of Systems of Signed Parametric Polynomial Inequalities

Thomas Sturm, Hoon Hong, H. Hong, 2018, CASC.

REDLOG: computer algebra meets computer logic

Thomas Sturm, Andreas Dolzmann, Andreas Dolzmann, 1997, SIGS.

Symbolic Methods for Chemical Reaction Networks (Dagstuhl Seminar 12462)

Thomas Sturm, François Boulier, Andreas Weber, 2012, Dagstuhl Reports.

Towards Conflict-Driven Learning for Virtual Substitution

Thomas Sturm, Konstantin Korovin, Marek Kosta, 2014, SMT.

Intelligent Computer Mathematics

Daniel Kroening, Bernd Becker, Matthew England, 2016, Lecture Notes in Computer Science.

Efficient projection orders for CAD

Andreas Seidl, Thomas Sturm, Andreas Dolzmann, 2004, ISSAC '04.

Satisfiability checking and symbolic computation pdf

Daniel Kroening, Bernd Becker, Matthew England, 2016, ACCA.

P-adic constraint solving

Thomas Sturm, Andreas Dolzmann, Andreas Dolzmann, 1999, ISSAC '99.

Better Answers to Real Questions pdf

Thomas Sturm, Andreas Dolzmann, Marek Kosta, 2014, SMT.

Proceedings of the 7th international conference on Automated deduction in geometry

Thomas Sturm, Christoph Zengler, 2008 .

Quantifier Elimination for Constraint Logic Programming

Thomas Sturm, T. Sturm, 2005, CASC.

Linear Integer Arithmetic Revisited pdf

Christoph Weidenbach, Thomas Sturm, Martin Bromberger, 2015, CADE.

Automated Deduction in Geometry

Thomas Sturm, Christoph Zengler, 2008, Lecture Notes in Computer Science.

Effective Quantifier Elimination for Presburger Arithmetic with Infinity

Thomas Sturm, Aless Lasaruk, T. Sturm, 2009, CASC.

Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests

Thomas Sturm, Winfried Neun, Stefan Vigerske, 2022 .

Weak quantifier elimination for the full linear theory of the integers

Thomas Sturm, Aless Lasaruk, T. Sturm, 2007, Applicable Algebra in Engineering, Communication and Computing.

Approaches to parallel quantifier elimination

Thomas Sturm, Andreas Dolzmann, Oliver Gloor, 1998, ISSAC '98.

Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates

Dima Grigoriev, Thomas Sturm, Werner M. Seiler, 2013, CASC.

Thirty Years of Virtual Substitution: Foundations, Techniques, Applications

Thomas Sturm, T. Sturm, 2018, ISSAC.

On Muldowney's Criteria for Polynomial Vector Fields with Constraints

Thomas Sturm, Werner M. Seiler, Hassan Errami, 2011, CASC.

Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks pdf

Matthew England, Dima Grigoriev, Thomas Sturm, 2017, CASC.

The SYMBIONT project: symbolic methods for biological networks

Thomas Sturm, François Fages, François Boulier, 2018, ACCA.

Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages

Thomas Sturm, Ralf Karrenberg, Marek Kosta, 2013, FroCos.

Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and Information Sciences

Thomas Sturm, Marek Košta, 2013 .

Automatic Verification of the Adequacy of Models for Families of Geometric Objects

Thomas Sturm, Aless Lasaruk, T. Sturm, 2008, Automated Deduction in Geometry.

Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks pdf

Matthew England, James H. Davenport, Dima Grigoriev, 2019, J. Symb. Comput..

A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications

Thomas Sturm, T. Sturm, 2017, Math. Comput. Sci..

Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)

Thomas Sturm, Werner M. Seiler, Andreas Weber, 2010, CASC.

Verification and synthesis using real quantifier elimination

Ashish Tiwari, Thomas Sturm, A. Tiwari, 2011, ISSAC '11.

Satisfiability Checking meets Symbolic Computation (Project Paper) pdf

Daniel Kroening, Bernd Becker, Matthew England, 2016, CICM.

A generic projection operator for partial cylindrical algebraic decomposition

Andreas Seidl, Thomas Sturm, T. Sturm, 2003, ISSAC '03.

Integration of Quantifier Elimination with Constraint Logic Programming

Thomas Sturm, 2002, AISC.

A Generalized Framework for Virtual Substitution pdf

Thomas Sturm, Marek Kosta, T. Sturm, 2015, ArXiv.

Foreword

Thomas Sturm, Stefan Ratschan, S. Ratschan, 2012, Math. Comput. Sci..

11th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning In conjunction with TPHOL 2003 and TABLEAUX 2003

Stephen M. Watt, James H. Davenport, William M. Farmer, 2003 .

A Logic Based Approach to Finding Real Singularities of Implicit Ordinary Differential Equations

Thomas Sturm, Werner M. Seiler, Matthias Seiss, 2021, Math. Comput. Sci..

Parametric Toricity of Steady State Varieties of Reaction Networks

Thomas Sturm, Hamid Rahkooy, 2021, CASC.

ODEbase: a repository of ODE systems for systems biology

Thomas Sturm, Ovidiu Radulescu, Christoph Luders, 2022, Bioinformatics advances.

Algorithmic Reduction of Biological Networks With Multiple Time Scales pdf

Thomas Sturm, Sebastian Walcher, Ovidiu Radulescu, 2021, Math. Comput. Sci..

Efficiently and Effectively Recognizing Toricity of Steady State Varieties

Dima Grigoriev, Thomas Sturm, Hamid Rahkooy, 2019, Mathematics in Computer Science.

Foreword, with a Dedication to Vladimir Gerdt

Matthew England, Thomas Sturm, Timur M. Sadykov, 2021, Math. Comput. Sci..

Foreword, with a Dedication to Andreas Weber

Matthew England, Thomas Sturm, Wolfram Koepf, 2021, Math. Comput. Sci..

Real Quantifier Elimination in Practice

Thomas Sturm, Volker Weispfenning, Andreas Dolzmann, 1997, Algorithmic Algebra and Number Theory.

Real Quantifier Elimination in Geometry 1

Thomas Sturm, T. Sturm, 1999 .

An Algebraic Approach to Offsetting and Blending of Solids

Thomas Sturm, T. Sturm, 2000 .

Real Quanti er Elimination in PracticeAndreas

Thomas Sturm, T. Sturm, Volker, 1998 .

Boolean Quantification in a First-Order Context

Andreas Seidl, Thomas Sturm, T. Sturm, 2006 .

Quantifier Elimination in Term Algebras The Case of Finite Languages

Thomas Sturm, Volker Weispfenning, V. Weispfenning, 2002 .

Quantifier Elimination-Based Constraint Logic Programming

Thomas Sturm, T. Sturm, 2002 .

Rounding and Blending of Solids by a Real Elimination Method

Thomas Sturm, Volker Weispfenning, 1997 .

Algorithmic Global Criteria for Excluding Oscillations

Thomas Sturm, Andreas Weber, Essam O. Abdel-Rahman, 2011, Bulletin of mathematical biology.