default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOleg M. Tikhonenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j7]Oleg M. Tikhonenko
, Marcin Ziólkowski, Wojciech M. Kempa:
Queueing Systems with Random Volume Customers and a Sectorized Unlimited Memory Buffer. Int. J. Appl. Math. Comput. Sci. 31(3): 471-486 (2021)- 2016
- [j6]Oleg M. Tikhonenko, Wojciech M. Kempa:
Performance evaluation of an M/G/n-type queue with bounded capacity and packet dropping. Int. J. Appl. Math. Comput. Sci. 26(4): 841-854 (2016) - 2015
- [j5]Oleg M. Tikhonenko, Wojciech M. Kempa:
Queueing system with processor sharing and limited memory under control of the AQM Mechanism. Autom. Remote. Control. 76(10): 1784-1796 (2015) - 2013
- [j4]Oleg M. Tikhonenko, Wojciech M. Kempa:
On the queue-size distribution in the multi-server system with bounded capacity and packet dropping. Kybernetika 49(6): 855-867 (2013) - 2005
- [j3]Oleg M. Tikhonenko:
Generalized Erlang Problem for Service Systems with Finite Total Capacity. Probl. Inf. Transm. 41(3): 243-253 (2005) - 2001
- [j2]Oleg M. Tikhonenko, Kanstantsin G. Klimovich:
Analysis of Queuing Systems for Random-Length Arrivals with Limited Cumulative Volume. Probl. Inf. Transm. 37(1): 70-79 (2001) - 1987
- [j1]Oleg M. Tikhonenko:
The Problem of Determination of the Summarized Messages Volume in Queueing Systems and its Applications. J. Inf. Process. Cybern. 23(7): 339-352 (1987)
Conference and Workshop Papers
- 2020
- [c11]Oleg M. Tikhonenko, Marcin Ziólkowski:
Unreliable Single-Server Queueing System with Customers of Random Capacity. CN 2020: 153-170 - 2019
- [c10]Oleg M. Tikhonenko, Marcin Ziólkowski:
Queueing Systems with Non-homogeneous Customers and Infinite Sectorized Memory Space. CN 2019: 316-329 - 2018
- [c9]Marcin Ziólkowski, Oleg M. Tikhonenko:
Multiserver Queueing System with Non-homogeneous Customers and Sectorized Memory Space. CN 2018: 272-285 - 2017
- [c8]Oleg M. Tikhonenko, Wojciech M. Kempa:
Erlang Service System with Limited Memory Space Under Control of AQM Mechanizm. CN 2017: 366-379 - [c7]Oleg M. Tikhonenko, Pawel Zajac:
Queueing Systems with Demands of Random Space Requirement and Limited Queueing or Sojourn Time. CN 2017: 380-391 - 2015
- [c6]Oleg M. Tikhonenko:
Egalitarian Processor Sharing System with Demands of Random Space Requirement. CN 2015: 347-356 - 2014
- [c5]Evsey Morozov, Ruslana Nekrasova, Lyubov Potakhina, Oleg M. Tikhonenko:
Asymptotic Analysis of Queueing Systems with Finite Buffer Space. CN 2014: 223-232 - 2013
- [c4]Oleg M. Tikhonenko, Magdalena Kawecka:
Total Volume Distribution for Multiserver Queueing Systems with Random Capacity Demands. CN 2013: 394-405 - 2012
- [c3]Oleg M. Tikhonenko, Magdalena Kawecka:
Busy Period Characteristics for Single Server Queue with Random Capacity Demands. CN 2012: 393-400 - 2011
- [c2]Oleg M. Tikhonenko:
Queueing Systems with Common Buffer: A Theoretical Treatment. CN 2011: 61-69 - [c1]Oleg M. Tikhonenko, Wojciech M. Kempa:
The Generalization of AQM Algorithms for Queueing Systems with Bounded Capacity. PPAM (2) 2011: 242-251
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 22:54 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:
