default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlos Spieksma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Eugene A. Feinberg, Michael N. Katehakis, Floske Spieksma:
Probability methods in business and industry in honor of Benjamin Avi-Itzhak and Matthew J. Sobel. Ann. Oper. Res. 317(1): 1-4 (2022)- [j12]Stella Kapodistria, Michael N. Katehakis, Sheldon M. Ross, Floske Spieksma:
Stochastic models and algorithms dedicated to the 60th birthday of Professor Eugene A. Feinberg. Ann. Oper. Res. 317(2): 331-333 (2022) - [j11]Sandjai Bhulai, H. Blok, Flora M. Spieksma
:
K competing queues with customer abandonment: optimality of a generalised c μ-rule by the Smoothed Rate Truncation method. Ann. Oper. Res. 317(2): 387-416 (2022) - [j10]Mark J. H. van den Bergh, Walter A. Kosters, Flora M. Spieksma:
Nim variants. J. Int. Comput. Games Assoc. 44(1): 2-17 (2022)
2010 – 2019
- 2016
- [j9]F. M. Spieksma:
Kolmogorov forward equation and explosiveness in countable state Markov processes. Ann. Oper. Res. 241(1-2): 3-22 (2016) - [j8]Michael N. Katehakis, Laurens C. Smit, Floske Spieksma:
A comparative analysis of the successive lumping and the lattice path counting algorithms. J. Appl. Probab. 53(1): 106-120 (2016) - [c1]Mark J. H. van den Bergh, Anne Hommelberg, Walter A. Kosters, Flora M. Spieksma:
Aspects of the Cooperative Card Game Hanabi. BNCAI 2016: 93-105 - 2014
- [j7]Sandjai Bhulai, A. C. Brooms, Flora M. Spieksma:
On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue. Queueing Syst. Theory Appl. 76(4): 425-446 (2014)
2000 – 2009
- 2005
- [j6]Lodewijk C. M. Kallenberg, Ger Koole, Flos Spieksma:
Special issue in honor of Arie Hordijk Editorial introduction. Math. Methods Oper. Res. 62(3): 347-349 (2005) - 2003
- [j5]Sandjai Bhulai, Flora M. Spieksma:
On the uniqueness of solutions to the Poisson equations for average cost Markov chains with unbounded cost functions. Math. Methods Oper. Res. 58(2): 221-236 (2003)
1990 – 1999
- 1997
- [j4]Arie Hordijk, Olaf Passchier, Floske Spieksma:
Optimal service control against worst case admission policies: A multichained stochastic game. Math. Methods Oper. Res. 45(2): 281-301 (1997) - [j3]Eitan Altman, Arie Hordijk, F. M. Spieksma:
Contraction Conditions for Average and α-Discount Optimality in Countable State Markov Games with Unbounded Rewards. Math. Oper. Res. 22(3): 588-618 (1997) - 1995
- [j2]Eitan Altman, Flos Spieksma:
The Linear Program approach in multi-chain Markov Decision Processes revisited. Math. Methods Oper. Res. 42(2): 169-188 (1995) - 1994
- [j1]Rommert Dekker, Arie Hordijk, F. M. Spieksma:
On the Relation Between Recurrence and Ergodicity Properties in Denumerable Markov Decision Chains. Math. Oper. Res. 19(3): 539-559 (1994)
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-01-09 12:57 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:
