default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Korotysheva
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j3]Alexander I. Zeifman
, Rostislav Razumchik, Yacov Satin, Ksenia Kiseleva, Anna Korotysheva, Victor Korolev:
Bounds on the rate of convergence for one class of inhomogeneous Markovian queueing models with possible batch arrivals and services. Int. J. Appl. Math. Comput. Sci. 28(1): 141-154 (2018)- 2017
- [c10]Alexander I. Zeifman, Anna Korotysheva, Yacov Satin, Ksenia Kiseleva, Victor Korolev, Sergey Shorgin:
Bounds For Markovian Queues With Possible Catastrophes. ECMS 2017: 628-634 - [c9]Yacov Satin, Anna Korotysheva, Galina Shilova, Alexander Sipin, Elena Fokicheva, Ksenia Kiseleva, Alexander I. Zeifman, Victor Korolev, Sergey Shorgin:
Two-Sided Truncations For The Mt/Mt/S Queueing Model. ECMS 2017: 635-641 - [c8]Alexander I. Zeifman, Alexander Sipin, Victor Korolev, Galina Shilova, Ksenia Kiseleva, Anna Korotysheva, Yacov Satin:
On Sharp Bounds on the Rate of Convergence for Finite Continuous-Time Markovian Queueing Models. EUROCAST (2) 2017: 20-28 - 2016
- [c7]Yacov Satin, Anna Korotysheva, Ksenia Kiseleva, Galina Shilova, Elena Fokicheva, Alexander I. Zeifman, Victor Korolev:
Two-Sided Truncations Of Inhomogeneous Birth-Death Processes. ECMS 2016: 663-668 - [c6]Alexander I. Zeifman, Anna Korotysheva, Yacov Satin, Galina Shilova, Rostislav Razumchik, Victor Korolev, Sergey Shorgin:
Uniform In Time Bounds For "No-Wait" Probability In Queues Of Mt/Mt/S Type. ECMS 2016: 676-684 - [c5]Irina A. Gudkova, Anna Korotysheva, Alexander I. Zeifman, Galina Shilova, Victor Korolev, Sergey Shorgin, Rostislav Razumchik:
Modeling and analyzing licensed shared access operation for 5G network as an inhomogeneous queue with catastrophes. ICUMT 2016: 282-287 - 2015
- [j2]Alexander I. Zeifman, Anna Korotysheva, Yacov Satin, Victor Korolev, Sergey Shorgin, Rostislav Razumchik:
Ergodicity And Perturbation Bounds For Inhomogeneous Birth And Death Processes With Additional Transitions From And To The Origin. Int. J. Appl. Math. Comput. Sci. 25(4): 787-802 (2015) - [c4]Yacov Satin, Alexander I. Zeifman, Anna Korotysheva, Ksenia Kiseleva, Victor Korolev:
On Truncations For A Class Of Finite Markovian Queuing Models. ECMS 2015: 626-630 - [c3]Alexander I. Zeifman, Anna Korotysheva, Rostislav Razumchik, Victor Korolev, Sergey Shorgin:
Some results for inhomogeneous birth-and-death process with application to staffing problem in telecommunication service systems. ICUMT 2015: 243-246 - 2014
- [j1]Alexander I. Zeifman, Victor Korolev, Yacov Satin, Anna Korotysheva, Vladimir Bening:
Perturbation bounds and truncations for a class of Markovian queues. Queueing Syst. Theory Appl. 76(2): 205-221 (2014) - 2011
- [c2]Alexander I. Zeifman, Sergey Shorgin, Anna Korotysheva, Vladimir Bening:
Stability bounds for Mt/Mt/N/N + R queue. VALUETOOLS 2011: 434-438 - 2010
- [c1]Alexander I. Zeifman, Anna Korotysheva, Yakov Satin:
On stability for Mt/Mt/N/N queue. ICUMT 2010: 1102-1105
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-04-24 23:02 CEST 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:
