Majid Jaberi Douraki

Orcid: 0000-0002-8505-6550

According to our database1, Majid Jaberi Douraki authored at least 12 papers between 2005 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Hybrid computational modeling demonstrates the utility of simulating complex cellular networks in type 1 diabetes.
PLoS Comput. Biol., 2021

Large-Scale Data Mining of Rapid Residue Detection Assay Data From HTML and PDF Documents: Improving Data Access and Visualization for Veterinarians.
CoRR, 2021

2008
Dynamics of the difference equation x<sub>n+1</sub> = (x<sub>n</sub>+px<sub>n-k</sub>)/(x<sub>n</sub>+q).
Comput. Math. Appl., 2008

2006
Oscillation and asymptotic behavior of a class of higher order nonlinear recursive sequences.
Appl. Math. Comput., 2006

On the higher order rational recursive sequence x<sub>n</sub>=(A/n<sub>n-k</sub>) + (B/x<sub>n-3k</sub>).
Appl. Math. Comput., 2006

Global stability of a higher order rational recursive sequence.
Appl. Math. Comput., 2006

The oscillatory character of the recursive sequence x<sub>n+1</sub>=(alpha+beta x<sub>n-k+1</sub>)/(A+Bx<sub>n-2k+1</sub>).
Appl. Math. Comput., 2006

2005
Study of a system of non-linear difference equations arising in a deterministic model for HIV infection.
Appl. Math. Comput., 2005

The qualitative behavior of solutions of a nonlinear difference equation.
Appl. Math. Comput., 2005

On the global behavior of higher order recursive sequences.
Appl. Math. Comput., 2005

Dynamics of a rational difference equation using both theoretical and computational approaches.
Appl. Math. Comput., 2005

On the recursive sequence x<sub>n+1</sub> = (a + bx<sub>n-k+1</sub>gx<sub>n-2k+1</sub>) / (Bx<sub>n-k+1</sub> + Cx<sub>n-2k+1</sub>).
Appl. Math. Comput., 2005


  Loading...