default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvgueni Gordienko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j15]Evgueni Gordienko, Yury Gryazin:
A note on the convergence rate in regularized stochastic programming. Kybernetika 57(1): 38-45 (2021)- 2009
- [j14]Hugo Cruz-Suárez
, Evgueni Gordienko, Raúl Montes-de-Oca:
A note on deterministic approximation of discounted Markov decision processes. Appl. Math. Lett. 22(8): 1252-1256 (2009) - [j13]Evgueni Gordienko, Andrey Novikov, Elena Zaitseva:
Stability Estimating in Optimal Sequential Hypotheses Testing. Kybernetika 45(2): 331-344 (2009) - [j12]Evgueni Gordienko, Antonio Garcia, Juan Ruiz de Chávez:
Asymptotic Properties and Optimization of Some Non-Markovian Stochastic Processes. Kybernetika 45(3): 475-490 (2009) - [j11]Evgueni Gordienko, Enrique Lemus-Rodríguez, Raúl Montes-de-Oca:
Average cost Markov control processes: stability with respect to the Kantorovich metric. Math. Methods Oper. Res. 70(1): 13-33 (2009) - 2008
- [j10]Evgueni Gordienko, Enrique Lemus-Rodríguez, Raúl Montes-de-Oca:
Discounted cost optimality problem: stability with respect to weak metrics. Math. Methods Oper. Res. 68(1): 77-96 (2008) - 2005
- [j9]Evgueni Gordienko:
Comparing the distributions of sums of independent random vectors. Kybernetika 41(4): 519-529 (2005) - 2004
- [j8]Evgueni Gordienko:
Stability estimates of generalized geometric sums and their applications. Kybernetika 40(2): 257-272 (2004) - 2003
- [j7]Evgueni Gordienko, Alexander Yushkevich:
Stability estimates in the problem of average optimal switching of a Markov chain. Math. Methods Oper. Res. 57(3): 345-365 (2003) - 2002
- [j6]Alexander Yushkevich, Evgueni Gordienko:
Average optimal switching of a Markov chain with a Borel state space. Math. Methods Oper. Res. 55(1): 143-159 (2002) - 2000
- [j5]Evgueni Gordienko, Francisco Salem-Silva:
Estimates of stability of Markov control processes with unbounded costs. Kybernetika 36(2): 195-210 (2000) - 1998
- [j4]Evgueni Gordienko, J. Adolfo Minjárez-Sosa:
Adaptive control for discrete-time Markov processes with unbounded costs: Discounted criterion. Kybernetika 34(2): 217-234 (1998) - [j3]Evgueni Gordienko, J. Adolfo Minjárez-Sosa:
Adaptive control for discrete-time Markov processes with unbounded costs: Average criterion. Math. Methods Oper. Res. 48(1): 37-55 (1998) - [j2]Evgueni Gordienko, Juan Ruiz de Chávez:
New estimates of continuity in M/GI/1/Y queues. Queueing Syst. Theory Appl. 29(2-4): 175-188 (1998) - 1997
- [j1]Evgueni Gordienko, Raúl Montes-de-Oca, J. Adolfo Minjárez-Sosa:
Approximation of average cost optimal policies for general Markov decision processes with unbounded costs. Math. Methods Oper. Res. 45(2): 245-263 (1997)
Conference and Workshop Papers
- 2012
- [c2]Evgueni Gordienko, Juan Ruiz de Chávez:
Quantitative Estimates of Stability in Controlled GI | D | 1 | ∞ Queueing Systems and in Control of Water Release in a Simple Dam Model. ICINCO (1) 2012: 309-312 - 1998
- [c1]Igor Ushakov, Sumantra Chakravarty, Evgueni Gordienko:
Novel simulation technique for spare kit optimization. SMC 1998: 4728-4733
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:15 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:
