Thomas Sturm

Thomas Sturm

Université de Lorraine

H-index: 24

Europe-France

About Thomas Sturm

Thomas Sturm, With an exceptional h-index of 24 and a recent h-index of 13 (since 2020), a distinguished researcher at Université de Lorraine, specializes in the field of Symbolic Computation, Automated Reasoning.

His recent articles reflect a diverse array of research interests and contributions to the field:

ODEbase: a repository of ODE systems for systems biology

Algorithmic reduction of biological networks with multiple time scales

Foreword, with a Dedication to Andreas Weber

A logic based approach to finding real singularities of implicit ordinary differential equations

Efficiently and effectively recognizing toricity of steady state varieties

Foreword, with a Dedication to Vladimir Gerdt

A complete and terminating approach to linear integer solving

Symbolic computation and satisfiability checking

Thomas Sturm Information

University

Position

Research Director, CNRS

Citations(all)

2321

Citations(since 2020)

577

Cited By

2002

hIndex(all)

24

hIndex(since 2020)

13

i10Index(all)

47

i10Index(since 2020)

20

Email

University Profile Page

Université de Lorraine

Google Scholar

View Google Scholar Profile

Thomas Sturm Skills & Research Interests

Symbolic Computation

Automated Reasoning

Top articles of Thomas Sturm

Title

Journal

Author(s)

Publication Date

ODEbase: a repository of ODE systems for systems biology

Bioinformatics Advances

Christoph Lüders

Thomas Sturm

Ovidiu Radulescu

2022

Algorithmic reduction of biological networks with multiple time scales

Mathematics in Computer Science

Niclas Kruff

Christoph Lüders

Ovidiu Radulescu

Thomas Sturm

Sebastian Walcher

2021/9

Foreword, with a Dedication to Andreas Weber

Mathematics in Computer Science

Matthew England

Wolfram Koepf

Timur Sadykov

Werner M Seiler

Thomas Sturm

2021/6

A logic based approach to finding real singularities of implicit ordinary differential equations

Mathematics in Computer Science

Werner M Seiler

Matthias Seiß

Thomas Sturm

2021/6

Efficiently and effectively recognizing toricity of steady state varieties

Mathematics in Computer Science

Dima Grigoriev

Alexandru Iosif

Hamid Rahkooy

Thomas Sturm

Andreas Weber

2021/6

Foreword, with a Dedication to Vladimir Gerdt

Mathematics in Computer Science

Matthew England

François Boulier

Timur Sadykov

Thomas Sturm

2021/9

A complete and terminating approach to linear integer solving

Journal of Symbolic Computation

Martin Bromberger

Thomas Sturm

Christoph Weidenbach

2020/9/1

Symbolic computation and satisfiability checking

James H Davenport

Matthew England

Alberto Griggio

Thomas Sturm

Cesare Tinelli

2020/9/1

Identifying the parametric occurrence of multiple steady states for some biological networks

Journal of Symbolic Computation

Russell Bradford

James H Davenport

Matthew England

Hassan Errami

Vladimir Gerdt

...

2020/5/1

A linear algebra approach for detecting binomiality of steady state ideals of reversible chemical reaction networks

Hamid Rahkooy

Ovidiu Radulescu

Thomas Sturm

2020

First-order tests for toricity

Hamid Rahkooy

Thomas Sturm

2020/9/14

See List of Professors in Thomas Sturm University(Université de Lorraine)

Co-Authors

H-index: 51
Bernd Becker

Bernd Becker

Albert-Ludwigs-Universität Freiburg

H-index: 41
Bruno Buchberger

Bruno Buchberger

Johannes Kepler Universität Linz

H-index: 38
Dima Grigoriev

Dima Grigoriev

Université de Lille

H-index: 33
James Davenport

James Davenport

University of Bath

H-index: 29
Andreas Weber

Andreas Weber

Rheinische Friedrich-Wilhelms-Universität Bonn

H-index: 28
Ovidiu Radulescu

Ovidiu Radulescu

Université de Montpellier

academic-engine