default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry Korshunov 0001
Person information
- affiliation: Lancaster University, School of Mathematical Sciences, Lancaster, UK
- affiliation (PhD 1990): Sobolev Institute of Mathematics, Novosibirsk, Russia
Other persons with the same name
- Dmitry Korshunov — disambiguation page
- Dmitry Korshunov 0002
![[0000-0002-8500-7193]](https://devdomain4test.ir/img/orcid-mark.12x12.png "0000-0002-8500-7193")
— Russian Academy of Sciences, Geological Institute, Moscow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j9]Takis Konstantopoulos, Dmitry Korshunov:
Editorial: Special issue on the workshop 'Modern Applied Probability'. Queueing Syst. Theory Appl. 98(3-4): 209-210 (2021)- 2020
- [j8]Dmitry Korshunov, Alexander Yur'evich Veretennikov:
Special issue on 'Analytical and computational methods in probability theory and its applications conference'. Queueing Syst. Theory Appl. 94(3-4): 211-212 (2020)
2010 – 2019
- 2019
- [j7]Denis Denisov, Dmitry Korshunov, Vitali Wachtel:
Markov chains on ℤ+ : analysis of stationary measure via harmonic functions approach. Queueing Syst. Theory Appl. 91(3-4): 265-295 (2019) - 2014
- [j6]Larisa Afanasyeva, Dmitry Korshunov, Dmitry A. Shabanov:
A special issue on the Boris V. Gnedenko Centennial. Queueing Syst. Theory Appl. 76(2): 111-112 (2014) - 2012
- [j5]Sergey Foss, Dmitry Korshunov:
On Large Delays in Multi-Server Queues with Heavy Tails. Math. Oper. Res. 37(2): 201-218 (2012) - 2011
- [j4]Dmitry Korshunov:
How to measure the accuracy of the subexponential approximation for the stationary single server queue. Queueing Syst. Theory Appl. 68(3-4): 261-266 (2011)
2000 – 2009
- 2008
- [c1]Dmitry Korshunov, Sergey Foss:
Bounds and moments for stationary delay in GI/GI/s queue. VALUETOOLS 2008: 59 - 2006
- [j3]Serguei Foss, Dmitry Korshunov:
Heavy Tails in Multi-Server Queue. Queueing Syst. Theory Appl. 52(1): 31-48 (2006) - 2004
- [j2]Denis Denisov, Serguei Foss, Dima Korshunov:
Tail Asymptotics for the Supremum of a Random Walk when the Mean Is not Finite. Queueing Syst. Theory Appl. 46(1-2): 15-33 (2004)
1990 – 1999
- 1999
- [j1]Alexandr A. Borovkov, Dmitry Korshunov, Rolf Schassberger:
Ergodicity of a polling network with an infinite number of stations. Queueing Syst. Theory Appl. 32(1-3): 169-193 (1999)
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 2026-02-03 23:36 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:
