Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
- Thomas Sturm 0001
Max Planck Institute for Informatics, Saarbrücken, Germany
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 92 matches
- 2024
- 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) - 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
- Matthew England, François Boulier, Timur M. Sadykov, Thomas Sturm:
Foreword. Math. Comput. Sci. 17(3): 22 (2023) - 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
- Matthew England, François Boulier, Timur M. Sadykov, Thomas Sturm:
Foreword. Math. Comput. Sci. 16(2-3): 16 (2022) - Christoph Lüders, Thomas Sturm, Ovidiu Radulescu:
ODEbase: A Repository of ODE Systems for Systems Biology. CoRR abs/2201.08980 (2022) - 2021
- 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) - 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) - 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) - 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) - 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) - Hamid Rahkooy, Thomas Sturm:
Parametric Toricity of Steady State Varieties of Reaction Networks. CASC 2021: 314-333 - Hamid Rahkooy, Thomas Sturm:
Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems. CASC 2021: 334-352 - Hamid Rahkooy, Thomas Sturm:
Parametric Toricity of Steady State Varieties of Reaction Networks. CoRR abs/2105.10853 (2021) - Hamid Rahkooy, Thomas Sturm:
Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner System. CoRR abs/2107.01706 (2021) - 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: 84-119 (2020) - Martin Bromberger, Thomas Sturm, Christoph Weidenbach:
A complete and terminating approach to linear integer solving. J. Symb. Comput. 100: 102-136 (2020) - James H. Davenport, Matthew England, Alberto Griggio, Thomas Sturm, Cesare Tinelli:
Symbolic computation and satisfiability checking. J. Symb. Comput. 100: 1-10 (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: 492-509 - Hamid Rahkooy, Thomas Sturm:
First-Order Tests for Toricity. CASC 2020: 510-527 - Hamid Rahkooy, Thomas Sturm:
First-Order Tests for Toricity. CoRR abs/2002.03586 (2020) - 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) - 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) - 2019
- 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) - 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
- 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) - Hoon Hong, Thomas Sturm:
Positive Solutions of Systems of Signed Parametric Polynomial Inequalities. CASC 2018: 238-253 - Thomas Sturm:
Thirty Years of Virtual Substitution: Foundations, Techniques, Applications. ISSAC 2018: 11-16 - 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 - Hoon Hong, Thomas Sturm:
Positive Solutions of Systems of Signed Parametric Polynomial Inequalities. CoRR abs/1804.09705 (2018)
skipping 62 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-19 05:13 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint