F. M. Spieksma

861 total citations
29 papers, 551 citations indexed

About

F. M. Spieksma is a scholar working on Management Information Systems, Statistics and Probability and Management Science and Operations Research. According to data from OpenAlex, F. M. Spieksma has authored 29 papers receiving a total of 551 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Management Information Systems, 13 papers in Statistics and Probability and 10 papers in Management Science and Operations Research. Recurrent topics in F. M. Spieksma's work include Advanced Queuing Theory Analysis (16 papers), Markov Chains and Monte Carlo Methods (12 papers) and Probability and Risk Models (5 papers). F. M. Spieksma is often cited by papers focused on Advanced Queuing Theory Analysis (16 papers), Markov Chains and Monte Carlo Methods (12 papers) and Probability and Risk Models (5 papers). F. M. Spieksma collaborates with scholars based in Netherlands, United States and France. F. M. Spieksma's co-authors include Arie Hordijk, Wendy Ellens, Robert E. Kooij, Almerima Jamakovic, Piet Van Mieghem, Eitan Altman, Sandjai Bhulai, Richard L. Tweedie, Rommert Dekker and Ger Koole and has published in prestigious journals such as Journal of Mathematical Analysis and Applications, Annals of Operations Research and Mathematics of Operations Research.

In The Last Decade

F. M. Spieksma

25 papers receiving 497 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
F. M. Spieksma Netherlands 11 181 123 116 95 94 29 551
Boris Alexandrovich Sevast'yanov Russia 11 167 0.9× 128 1.0× 50 0.4× 27 0.3× 88 0.9× 47 554
J. Michael Steele United States 9 20 0.1× 118 1.0× 89 0.8× 38 0.4× 61 0.6× 32 513
Gerardo Rubino France 9 78 0.4× 95 0.8× 67 0.6× 17 0.2× 115 1.2× 18 474
Geoffrey Yeo Australia 15 85 0.5× 135 1.1× 39 0.3× 33 0.3× 92 1.0× 64 676
J. Th. Runnenburg Netherlands 10 92 0.5× 79 0.6× 49 0.4× 17 0.2× 76 0.8× 20 361
M. P. Quine Australia 15 28 0.2× 209 1.7× 33 0.3× 27 0.3× 83 0.9× 59 611
Vladimir Ejov Australia 10 30 0.2× 42 0.3× 31 0.3× 49 0.5× 11 0.1× 28 272
Hua Xu Japan 14 28 0.2× 12 0.1× 71 0.6× 30 0.3× 35 0.4× 120 662
Harry Cohn Australia 12 13 0.1× 139 1.1× 41 0.4× 38 0.4× 103 1.1× 49 454
Joanne Wendelberger United States 12 38 0.2× 62 0.5× 102 0.9× 11 0.1× 67 0.7× 33 422

Countries citing papers authored by F. M. Spieksma

Since Specialization
Citations

This map shows the geographic impact of F. M. Spieksma's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by F. M. Spieksma with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites F. M. Spieksma more than expected).

Fields of papers citing papers by F. M. Spieksma

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by F. M. Spieksma. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by F. M. Spieksma. The network helps show where F. M. Spieksma may publish in the future.

Co-authorship network of co-authors of F. M. Spieksma

This figure shows the co-authorship network connecting the top 25 collaborators of F. M. Spieksma. A scholar is included among the top collaborators of F. M. Spieksma based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with F. M. Spieksma. F. M. Spieksma is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Feinberg, Eugene A., Michael N. Katehakis, & F. M. Spieksma. (2022). Probability methods in business and industry in honor of Benjamin Avi-Itzhak and Matthew J. Sobel. Annals of Operations Research. 317(1). 1–4.
2.
Bhulai, Sandjai, et al.. (2018). A novel use of value iteration for deriving bounds for threshold and switching curve optimal policies. Naval Research Logistics (NRL). 65(8). 638–659.
3.
Katehakis, Michael N., et al.. (2016). A comparative analysis of the successive lumping and the lattice path counting algorithms. Journal of Applied Probability. 53(1). 106–120. 3 indexed citations
4.
Katehakis, Michael N., et al.. (2016). Level product form QSF processes and an analysis of queues with Coxian interarrival distribution. Naval Research Logistics (NRL). 66(1). 57–72. 2 indexed citations
5.
Spieksma, F. M., et al.. (2015). Countable state Markov decision processes with unbounded jump rates and discounted cost: optimality equation and approximations. Advances in Applied Probability. 47(4). 1088–1107.
6.
Spieksma, F. M.. (2015). COUNTABLE STATE MARKOV PROCESSES: NON-EXPLOSIVENESS AND MOMENT FUNCTION. Probability in the Engineering and Informational Sciences. 29(4). 623–637. 7 indexed citations
7.
8.
Ellens, Wendy, F. M. Spieksma, Piet Van Mieghem, Almerima Jamakovic, & Robert E. Kooij. (2011). Effective graph resistance. Linear Algebra and its Applications. 435(10). 2491–2506. 171 indexed citations
9.
Ejov, Vladimir, Jerzy A. Filar, & F. M. Spieksma. (2007). On regularly perturbed fundamental matrices. Journal of Mathematical Analysis and Applications. 336(1). 18–30.
10.
Koole, Ger & F. M. Spieksma. (2001). ON DEVIATION MATRICES FOR BIRTH–DEATH PROCESSES. Probability in the Engineering and Informational Sciences. 15(2). 239–258. 16 indexed citations
11.
Spieksma, F. M., et al.. (1998). Airborne grass pollen in Leiden, The Netherlands: annual variations and trends in quantities and season starts over 26 years. Aerobiologia. 14(4). 347–358. 45 indexed citations
12.
Altman, Eitan, Arie Hordijk, & F. M. Spieksma. (1997). Contraction Conditions for Average and α-Discount Optimality in Countable State Markov Games with Unbounded Rewards. Mathematics of Operations Research. 22(3). 588–618. 40 indexed citations
13.
Altman, Eitan & F. M. Spieksma. (1996). Ergodicity, moment stability and central limit theorems of station times in polling systems. Communications in Statistics Stochastic Models. 12(2). 307–328. 6 indexed citations
14.
Altman, Eitan & F. M. Spieksma. (1995). The Linear Program approach in multi-chain Markov Decision Processes revisited. Mathematical Methods of Operations Research. 42(2). 169–188. 18 indexed citations
15.
Malyshev, V. A. & F. M. Spieksma. (1994). Intrinsic convergence rate of countable Markov chains. University of Minnesota Digital Conservancy (University of Minnesota). 5 indexed citations
16.
Dekker, Rommert, Arie Hordijk, & F. M. Spieksma. (1994). On the Relation Between Recurrence and Ergodicity Properties in Denumerable Markov Decision Chains. Mathematics of Operations Research. 19(3). 539–559. 30 indexed citations
17.
Hordijk, Arie & F. M. Spieksma. (1992). On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network. Advances in Applied Probability. 24(2). 343–376. 1 indexed citations
18.
Hordijk, Arie & F. M. Spieksma. (1992). On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network. Advances in Applied Probability. 24(2). 343–376. 41 indexed citations
19.
Spieksma, F. M.. (1991). Geometric Ergodicity of the ALOHA-system and a Coupled Processors Model. Probability in the Engineering and Informational Sciences. 5(1). 15–42. 8 indexed citations
20.
Hordijk, Arie & F. M. Spieksma. (1989). Constrained admission control to a queueing system. Advances in Applied Probability. 21(2). 409–431. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026