Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Kendall, David G.
1951.
Some Problems in the Theory of Queues.
Journal of the Royal Statistical Society Series B: Statistical Methodology,
Vol. 13,
Issue. 2,
p.
151.
Foster, F. G.
1952.
On Markov chains with an enumerable infinity of states.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 48,
Issue. 4,
p.
587.
Mauldon, J. G.
1957.
On non-dissipative Markov chains.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 53,
Issue. 4,
p.
825.
Nash-Williams, C. St J. A.
1959.
Random walk and electric currents in networks.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 55,
Issue. 2,
p.
181.
Tweedie, Richard L.
1973.
The calculation of limit probabilities for denumerable Markov processes from infinitesimal properties.
Journal of Applied Probability,
Vol. 10,
Issue. 1,
p.
84.
Tweedie, Richard L.
1973.
The calculation of limit probabilities for denumerable Markov processes from infinitesimal properties.
Journal of Applied Probability,
Vol. 10,
Issue. 01,
p.
84.
Iosifescu, M.
and
Tăutu, P.
1973.
Stochastic processes and applications in biology and medicine I.
Vol. 3,
Issue. ,
p.
11.
Tweedie, Richard L.
1975.
Sufficient conditions for regularity, recurrence and ergodicity of Markov processes.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 78,
Issue. 1,
p.
125.
Tweedie, Richard L.
1975.
Sufficient conditions for ergodicity and recurrence of Markov chains on a general state space.
Stochastic Processes and their Applications,
Vol. 3,
Issue. 4,
p.
385.
Locker, V.F.
and
Wang, P.P.
1997.
The computation of steady-state distribution of parallel systems with two servers.
p.
256.
Mukherjea, Arunava
2004.
Encyclopedia of Statistical Sciences.
Mukherjea, Arunava
2005.
Encyclopedia of Statistical Sciences.
Mukherjea, Arunava
2014.
Wiley StatsRef: Statistics Reference Online.
McIver, Annabelle
Morgan, Carroll
Kaminski, Benjamin Lucien
and
Katoen, Joost-Pieter
2018.
A new proof rule for almost-sure termination.
Proceedings of the ACM on Programming Languages,
Vol. 2,
Issue. POPL,
p.
1.