default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHamid Rahkooy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]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)- [j6]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) - [i12]Helen M. Byrne, Heather A. Harrington, Alexey Ovchinnikov, Gleb Pogudin, Hamid Rahkooy, Pedro Soto:
Algebraic identifiability of partial differential equation models. CoRR abs/2402.04241 (2024) - [i11]Hamid Rahkooy:
On Recurrence Relations of Multi-dimensional Sequences. CoRR abs/2410.17208 (2024) - 2021
- [j5]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) - [c6]Hamid Rahkooy, Thomas Sturm:
Parametric Toricity of Steady State Varieties of Reaction Networks. CASC 2021: 314-333 - [c5]Hamid Rahkooy, Thomas Sturm:
Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems. CASC 2021: 334-352 - [i10]Hamid Rahkooy, Thomas Sturm:
Parametric Toricity of Steady State Varieties of Reaction Networks. CoRR abs/2105.10853 (2021) - [i9]Hamid Rahkooy, Thomas Sturm:
Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner System. CoRR abs/2107.01706 (2021) - 2020
- [j4]Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost:
Block-Krylov techniques in the context of sparse-FGLM algorithms. J. Symb. Comput. 98: 163-191 (2020) - [c4]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 - [c3]Hamid Rahkooy, Thomas Sturm:
First-Order Tests for Toricity. CASC 2020: 510-527 - [c2]Hamid Rahkooy, Cristian Vargas Montero:
A Graph Theoretical Approach for Testing Binomiality of Reversible Chemical Reaction Networks. SYNASC 2020: 101-108 - [i8]Hamid Rahkooy, Thomas Sturm:
First-Order Tests for Toricity. CoRR abs/2002.03586 (2020) - [i7]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) - [i6]Hamid Rahkooy, Cristian Vargas Montero:
A Graph Theoretical Approach for Testing Binomiality of Reversible Chemical Reaction Networks. CoRR abs/2010.12615 (2020)
2010 – 2019
- 2019
- [i5]Dima Grigoriev, Alexandru Iosif, Hamid Rahkooy, Thomas Sturm, Andreas Weber:
Efficiently and Effectively Recognizing Toricity of Steady State Varieties. CoRR abs/1910.04100 (2019) - [i4]Alexandru Iosif, Hamid Rahkooy:
Analysis of the Conradi-Kahle Algorithm for Detecting Binomiality on Biological Models. CoRR abs/1912.06896 (2019) - 2018
- [j3]Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost:
Sparse FGLM using the block Wiedemann algorithm. ACM Commun. Comput. Algebra 52(4): 123-125 (2018) - 2017
- [c1]Vincent Neiger, Hamid Rahkooy, Éric Schost:
Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences. CASC 2017: 313-328 - [i3]Vincent Neiger, Hamid Rahkooy, Éric Schost:
Algorithms for zero-dimensional ideals using linear recurrent sequences. CoRR abs/1707.01971 (2017) - [i2]Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost:
Block-Krylov techniques in the context of sparse-FGLM algorithms. CoRR abs/1712.04177 (2017) - 2016
- [j2]Angelos Mantzaflaris, Hamid Rahkooy, Zafeirakis Zafeirakopoulos:
Efficient computation of dual space and directional multiplicity of an isolated point. Comput. Aided Geom. Des. 47: 114-129 (2016) - 2013
- [i1]Matteo Gallet, Hamid Rahkooy, Zafeirakis Zafeirakopoulos:
On Computing the Elimination Ideal Using Resultants with Applications to Gröbner Bases. CoRR abs/1307.5330 (2013) - 2011
- [j1]Hamid Rahkooy, Zafeirakis Zafeirakopoulos:
Using resultants for inductive Gröbner bases computation. ACM Commun. Comput. Algebra 45(1/2): 135-136 (2011)
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-11-28 21:26 CET 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:
