default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVyacheslav M. Abramov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i1]Vyacheslav M. Abramov:
Evaluating the sum of positive series. CoRR abs/2108.06480 (2021)- 2020
- [j15]Vyacheslav M. Abramov
:
Extension of the Bertrand-De Morgan Test and Its Application. Am. Math. Mon. 127(5): 444-448 (2020)
2010 – 2019
- 2019
- [j14]Chang Xing, Ronald G. Addie, Yu Peng, Rongping Lin, Fan Li, Wenjie Hu, Vyacheslav M. Abramov, Moshe Zukerman:
Resource Provisioning for a Multi-Layered Network. IEEE Access 7: 16226-16245 (2019) - 2016
- [c1]Yu Peng, Rongping Lin, Fan Li, Chang Xing, Jun Guo, Wenjie Hu, Vyacheslav M. Abramov, Ronald G. Addie, Moshe Zukerman:
Validation of multi-layer network optimization. ICTON 2016: 1-4 - 2013
- [j13]Shuo Li, Meiqian Wang, Eric W. M. Wong, Vyacheslav M. Abramov, Moshe Zukerman:
Bounds of the Overflow Priority Classification for Blocking Probability Approximation in OBS Networks. JOCN 5(4): 378-393 (2013) - [j12]Shuo Li, Meiqian Wang, Eric W. M. Wong, Vyacheslav M. Abramov, Moshe Zukerman:
Bounds of the Overflow Priority Classification for Blocking Probability Approximation in OBS Networks: Errata. JOCN 5(12): 1467 (2013) - [j11]Vyacheslav M. Abramov:
Characterization theorem on losses in GIX/GIY/1/n queues. Oper. Res. Lett. 41(2): 150-152 (2013) - 2012
- [j10]Vyacheslav M. Abramov, Shuo Li, Meiqian Wang, Eric W. M. Wong, Moshe Zukerman:
Computation of Blocking Probability for Large Circuit Switched Networks. IEEE Commun. Lett. 16(11): 1892-1895 (2012)
2000 – 2009
- 2008
- [j9]Vyacheslav M. Abramov:
Continuity theorems for the M / M /1/ n queueing system. Queueing Syst. Theory Appl. 59(1): 63-86 (2008) - 2006
- [j8]Vyacheslav M. Abramov:
Analysis of multiserver retrial queueing system: A martingale approach and an algorithm of solution. Ann. Oper. Res. 141(1): 19-50 (2006) - 2004
- [b1]Vyacheslav M. Abramov:
Asymptotic methods for queueing systems and networks with application to telecommunications. Tel Aviv University, Israel, 2004 - [j7]Vyacheslav M. Abramov, Robert Sh. Liptser:
On Existence of Limiting Distribution for Time-Nonhomogeneous Countable Markov Process. Queueing Syst. Theory Appl. 46(3-4): 353-361 (2004) - [j6]Vyacheslav M. Abramov:
A Large Closed Queueing Network Containing Two Types of Node and Multiple Customer Classes: One Bottleneck Station. Queueing Syst. Theory Appl. 48(1-2): 45-73 (2004) - [j5]Vyacheslav M. Abramov:
Asymptotic Behavior of the Number of Lost Messages. SIAM J. Appl. Math. 64(3): 746-761 (2004) - 2002
- [j4]Vyacheslav M. Abramov:
Asymptotic Analysis of the GI/M/1/n Loss System as n Increases to Infinity. Ann. Oper. Res. 112(1-4): 35-41 (2002) - [j3]Eitan Altman, Rachid El Azouzi, Vyacheslav M. Abramov:
Non-cooperative routing in loss networks. Perform. Evaluation 49(1/4): 257-272 (2002) - 2001
- [j2]Vyacheslav M. Abramov:
Some Results for Large Closed Queueing Networks with and without Bottleneck: Up- and Down-Crossings Approach. Queueing Syst. Theory Appl. 38(2): 149-184 (2001) - 2000
- [j1]Vyacheslav M. Abramov:
A large closed queueing network with autonomous service and bottleneck. Queueing Syst. Theory Appl. 35(1-4): 23-54 (2000)
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-03-04 22: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:
