default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRostislav Razumchik
Person information
- affiliation: Russian Academy of Sciences, Federal Research Center Informatics and Management, Moscow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j14]Mikhail Konovalov, Rostislav Razumchik
:
Finite capacity single-server queue with Poisson input, general service and delayed renovation. Eur. J. Oper. Res. 304(3): 1075-1083 (2023)- 2022
- [j13]Yacov Satin, Rostislav V. Razumchik, Alexander I. Zeifman, I. A. Kovalev:
Upper bound on the rate of convergence and truncation bound for non-homogeneous birth and death processes on Z. Appl. Math. Comput. 423: 127009 (2022) - 2021
- [j12]Alexander I. Zeifman, Rostislav V. Razumchik, Yacov Satin, I. A. Kovalev:
Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy. Appl. Math. Comput. 395: 125846 (2021) - 2020
- [j11]Alexander I. Zeifman, Yacov Satin, Anastasia Kryukova, Rostislav Razumchik, Ksenia Kiseleva, Galina Shilova:
On three methods for bounding the rate of convergence for some continuous-time Markov chains. Int. J. Appl. Math. Comput. Sci. 30(2): 251-266 (2020) - 2019
- [j10]Illés Horváth, Rostislav Razumchik, Miklós Telek:
The resampling M/G/1 non-preemptive LIFO queue and its application to systems with uncertain service time. Perform. Evaluation 134 (2019) - 2018
- [j9]Dhanya Shajin, B. Benny, Rostislav V. Razumchik, Achyutha Krishnamoorthy:
Discrete Product Inventory Control System with Positive Service Time and Two Operation Modes. Autom. Remote. Control. 79(9): 1593-1608 (2018) - [j8]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) - [j7]Mikhail Konovalov, Rostislav Razumchik:
Improving routing decisions in parallel non-observable queues. Computing 100(10): 1059-1079 (2018) - 2016
- [j6]Ilaria Caraccio, Alexander V. Pechinkin, Rostislav V. Razumchik:
Two-channel MAP/PH/2 system with customer resequencing. Autom. Remote. Control. 77(5): 789-801 (2016) - [j5]Rostislav Razumchik, Miklós Telek:
Delay analysis of a queue with re-sequencing buffer and Markov environment. Queueing Syst. Theory Appl. 82(1-2): 7-28 (2016) - 2015
- [j4]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) - 2014
- [j3]Yuliya V. Gaidamaka, Alexander Pechinkin, Rostislav Razumchik, Konstantin E. Samouylov, Eduard S. Sopin:
Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies. Int. J. Appl. Math. Comput. Sci. 24(3): 519-534 (2014) - [j2]Rostislav Razumchik:
Analysis of Finite Capacity Queue with Negative Customers and bunker for Ousted Customers using Chebyshev and Gegenbauer polynomials. Asia Pac. J. Oper. Res. 31(4) (2014) - [j1]Pavel O. Abaev, Yulia V. Gaidamaka, Konstantin E. Samouylov, Alexander Pechinkin, Rostislav Razumchik, Sergey Shorgin:
Hysteretic Control Technique for Overload Problem Solution in Network of SIP Servers. Comput. Informatics 33(1): 218-236 (2014)
Conference and Workshop Papers
- 2022
- [c26]Rostislav Razumchik, Alexander S. Rumyantsev:
Some Ergodicity And Truncation Bounds For A Small Scale Markovian Supercomputer Model. ECMS 2022: 324-330 - 2021
- [c25]Mikhail Konovalov, Rostislav Razumchik:
Minimizing Mean Response Time In Batch-Arrival Non-Observable Systems With Single-Server FIFO Queues Operating In Parallel. ECMS 2021: 272-278 - 2020
- [c24]Mikhail Konovalov, Rostislav Razumchik:
A Simple Dispatching Policy For Minimizing Mean Response Time In Non-Observable Queues With SRPT Policy Operating In Parallel. ECMS 2020: 398-402 - [c23]Anastasiya Kryukova, Viktoriya Oshushkova, Alexander I. Zeifman, Rostislav Razumchik:
Method For Bounding The Rate Of Convergence For One Class Of Finite-Capacity Markovian Time-Dependent Queues With Batch Arrivals When Empty. ECMS 2020: 403-406 - 2019
- [c22]Natalia M. Markovich, Rostislav Razumchik:
Cluster Modeling of Lindley Process with Application to Queuing. DCCN 2019: 330-341 - [c21]Mikhail Konovalov, Rostislav Razumchik:
Minimizing Mean Response Time In Non-Observable Distributed Systems With Processor Sharing Nodes. ECMS 2019: 456-461 - [c20]Alexander I. Zeifman, Yacov Satin, Rostislav Razumchik, Anastasia Kryukova, Galina Shilova:
Bounding the Rate of Convergence for One Class of Finite Capacity Time Varying Markov Queues. EPEW 2019: 148-159 - 2018
- [c19]Franco Cicirelli, Agostino Forestiero, Andrea Giordano, Carlo Mastroianni, Rostislav V. Razumchik:
Global And Local Synchronization In Parallel Space-Aware Applications. ECMS 2018: 491-497 - 2017
- [c18]Mikhail Konovalov, Rostislav Razumchik:
Using Inter-Arrival Times For Scheduling In Non-Observable Queues. ECMS 2017: 667-672 - [c17]Rostislav Razumchik, Miklós Telek:
Delay Analysis of Resequencing Buffer in Markov Environment with HOQ-FIFO-LIFO Policy. EPEW 2017: 53-68 - 2016
- [c16]Mikhail Konovalov, Rostislav Razumchik:
Simulation And Selection Of Efficient Decision Rules In Bank's Manual Underwriting Process. ECMS 2016: 651-657 - [c15]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 - [c14]Lusine Meykhanadzhyan, Rostislav Razumchik:
New Scheduling Policy For Estimation Of Stationary Performance Characteristics In Single Server Queues With Inaccurate Job Size Information. ECMS 2016: 710-716 - [c13]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 - [c12]Rostislav Razumchik:
Analysis of finite MAP|PH|1 queue with hysteretic control of arrivals. ICUMT 2016: 288-293 - 2015
- [c11]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
- [c10]Ilaria Caraccio, Alexander V. Pechinkin, Rostislav Razumchik:
Joint Stationary Distribution Of Queues In Homogenous M|M|3 Queue With Resequencing. ECMS 2014: 558-564 - [c9]Konstantin E. Samouylov, Pavel O. Abaev, Yuliya V. Gaidamaka, Alexander Pechinkin, Rostislav Razumchik:
Analytical Modelling And Simulation For Performance Evaluation Of SIP Server With Hysteretic Overload Control. ECMS 2014: 603-609 - [c8]Yuliya V. Gaidamaka, Alexander V. Pechinkin, Rostislav Razumchik:
Time-related stationary characteristics in queueing system with constant service time under hysteretic policy. ICUMT 2014: 534-540 - [c7]Mikhail Konovalov, Rostislav Razumchik:
Simulation of job allocation in distributed processing systems. ICUMT 2014: 563-569 - 2013
- [c6]Alexander Pechinkin, Rostislav Razumchik:
Approach For Analysis Of Finite M2/M2/1/R With Hysteric Policy For Sip Server Hop-By-Hop Overload Control. ECMS 2013: 573-579 - [c5]Carmine De Nicola, Alexander V. Pechinkin, Rostislav Razumchik:
Stationary Characteristics Of Homogenous Geo/Geo/2 Queue With Resequencing In Discrete Time. ECMS 2013: 594-600 - [c4]Pavel O. Abaev, Rostislav Valerievich Razumchik:
Queuing Model for SIP Server Hysteretic Overload Control with Bursty Traffic. NEW2AN 2013: 383-396 - 2012
- [c3]Pavel O. Abaev, Yuliya V. Gaidamaka, Alexander Pechinkin, Rostislav Razumchik, Sergey Shorgin:
Simulation Of Overload Control In SIP Server Networks. ECMS 2012: 533-539 - [c2]Pavel O. Abaev, Alexander Pechinkin, Rostislav Razumchik:
On analytical model for optimal SIP server hop-by-hop overload control. ICUMT 2012: 286-291 - 2010
- [c1]Alexander Pechinkin, Rostislav Razumchik:
Waiting characteristics of queueing system Geo/Geo/1/∞ with negative claims and a bunker for superseded claims in discrete time. ICUMT 2010: 1051-1055
Editorship
- 2020
- [e1]Marco Gribaudo, Mauro Iacono, Tuan Phung-Duc, Rostislav Razumchik:
Computer Performance Engineering - 16th European Workshop, EPEW 2019, Milan, Italy, November 28-29, 2019, Revised Selected Papers. Lecture Notes in Computer Science 12039, Springer 2020, ISBN 978-3-030-44410-5 [contents]
Informal and Other Publications
- 2017
- [i1]Mikhail Konovalov, Rostislav Razumchik:
Queueing systems with renovation vs. queues with RED. Supplementary Material. CoRR abs/1709.01477 (2017)
Coauthor Index
aka: Alexander V. Pechinkin
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-08-05 21:20 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:
