default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJavad Tavakoli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i4]Ze Chen, Ruichao Jiang, Javad Tavakoli, Yiqiang Zhao:
Robbed withdrawal. CoRR abs/2307.05992 (2023)- 2022
- [i3]Ruichao Jiang, Javad Tavakoli, Yiqiang Zhao:
Laplacian operator on statistical manifold. CoRR abs/2202.08386 (2022) - [i2]Ruichao Jiang, Javad Tavakoli, Yiqiang Zhao:
Hitting time for Markov decision process. CoRR abs/2205.03476 (2022) - 2021
- [j13]Bahram Jafari, Javad Tavakoli
, Samad Sheikhaei:
BISH-QVCO: A Low-Power, Low-Phase noise Bulk-Injected Super-Harmonic coupling QVCO. Microelectron. J. 111: 105001 (2021) - [j12]Hossein Yaghobi, Javad Tavakoli, Samad Sheikhaei:
A 1.2 GHz jitter-peaking-free Integer-N PLL. Microelectron. J. 116: 105246 (2021) - 2020
- [j11]Ruichao Jiang, Javad Tavakoli, Yiqiang Zhao:
Weyl Prior and Bayesian Statistics. Entropy 22(4): 467 (2020) - [j10]Araz Sholehkerdar, Javad Tavakoli, Zheng Liu:
Theoretical analysis of Tsallis entropy-based quality measure for weighted averaging image fusion. Inf. Fusion 58: 69-81 (2020) - [i1]Ruichao Jiang, Javad Tavakoli, Yiqiang Zhao:
Information geometry and Frobenius algebra. CoRR abs/2010.05110 (2020)
2010 – 2019
- 2019
- [j9]Winfried K. Grassmann, Javad Tavakoli:
A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails. INFOR Inf. Syst. Oper. Res. 57(2): 286-295 (2019) - [j8]Winfried K. Grassmann, Javad Tavakoli:
The distribution of the line length in a discrete time GI∕G∕1 queue. Perform. Evaluation 131: 43-53 (2019) - 2017
- [j7]Javad Tavakoli:
Region-media coupling in characterization and modelling of the disc annulus single lamella swelling. Medical Biol. Eng. Comput. 55(8): 1483-1492 (2017) - 2016
- [j6]Ali Tirdad, Winfried K. Grassmann, Javad Tavakoli:
Optimal policies of M(t)/M/c/c queues with two different levels of servers. Eur. J. Oper. Res. 249(3): 1124-1130 (2016) - 2014
- [j5]Winfried K. Grassmann, Javad Tavakoli:
Efficient Methods to find the Equilibrium Distribution of the Number of Customers in GI/M/c Queues. INFOR Inf. Syst. Oper. Res. 52(4): 197-205 (2014) - 2013
- [j4]Hui Li, Javad Tavakoli, Yiqiang Q. Zhao:
Analysis of exact tail asymptotics for singular random walks in the quarter plane. Queueing Syst. Theory Appl. 74(2-3): 151-179 (2013) - 2010
- [j3]Winfried K. Grassmann, Javad Tavakoli:
Comparing Some Algorithms for Solving QBD Processes Exhibiting Special Structures. INFOR Inf. Syst. Oper. Res. 48(3): 133-141 (2010)
2000 – 2009
- 2009
- [j2]Winfried K. Grassmann, Javad Tavakoli:
Transient solutions for multi-server queues with finite buffers. Queueing Syst. Theory Appl. 62(1-2): 35-49 (2009) - 2002
- [j1]Winfried K. Grassmann, Javad Tavakoli:
A Tandem Queuewith a Movable Server: An Eigenvalue Approach. SIAM J. Matrix Anal. Appl. 24(2): 465-474 (2002)
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 2025-01-09 12:50 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:
