Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Latouche, Guy
and
Neuts, Marcel F.
1980.
Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking.
SIAM Journal on Algebraic Discrete Methods,
Vol. 1,
Issue. 1,
p.
93.
Neuts, Marcel F.
1981.
Stationary waiting-time distributions in the GI/PH/1 queue.
Journal of Applied Probability,
Vol. 18,
Issue. 04,
p.
901.
Latouche, Guy
1981.
On a Markovian queue with weakly correlated interarrival times.
Journal of Applied Probability,
Vol. 18,
Issue. 01,
p.
190.
Neuts, Marcel F.
and
Takahashi, Yukio
1981.
Asymptotic behavior of the stationary distributions in the GI/PH/c queue with heterogeneous servers.
Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete,
Vol. 57,
Issue. 4,
p.
441.
Takahashi, Yukio
1981.
Asymptotic exponentiality of the tail of the waiting-time distribution in a Ph/Ph/C queue.
Advances in Applied Probability,
Vol. 13,
Issue. 03,
p.
619.
Neuts, M.F.
and
Chakravarthy, S.
1981.
A single server queue with platooned arrivals and phase type services.
European Journal of Operational Research,
Vol. 8,
Issue. 4,
p.
379.
Tweedie, R. L.
1982.
Operator-geometric stationary distributions for markov chains, with application to queueing models.
Advances in Applied Probability,
Vol. 14,
Issue. 2,
p.
368.
Tweedie, R. L.
1982.
Operator-geometric stationary distributions for markov chains, with application to queueing models.
Advances in Applied Probability,
Vol. 14,
Issue. 2,
p.
368.
Shanthikumar, J. G.
Varshney, P. K.
and
Sriram, K.
1982.
A priority cutoff flow control scheme for integrated voice-data multiplexers.
ACM SIGMETRICS Performance Evaluation Review,
Vol. 11,
Issue. 3,
p.
8.
Miller, Douglas R.
1982.
Applied Probability— Computer Science: The Interface.
p.
207.
Hajek, Bruce
1982.
Birth-and-death processes on the integers with phases and general boundaries.
Journal of Applied Probability,
Vol. 19,
Issue. 03,
p.
488.
Gillent, Fablenne
and
Latouche, Guy
1983.
Semi-explicit solutions for M/PH/1-like queuing systems.
European Journal of Operational Research,
Vol. 13,
Issue. 2,
p.
151.
Latouche, G.
Jacobs, P. A.
and
Gaver, D. P.
1984.
Finite Markov chain models skip‐free in one direction.
Naval Research Logistics Quarterly,
Vol. 31,
Issue. 4,
p.
571.
Gaver, D. P.
Jacobs, P. A.
and
Latouche, G.
1984.
Finite birth-and-death models in randomly changing environments.
Advances in Applied Probability,
Vol. 16,
Issue. 04,
p.
715.
Coyle, E.
and
Liu, B.
1985.
A Matrix Representation of CSMA/CD Networks.
IEEE Transactions on Communications,
Vol. 33,
Issue. 1,
p.
53.
Lucantoni, David M.
and
Ramaswami, V.
1985.
Opsearch.
Communications in Statistics. Stochastic Models,
Vol. 1,
Issue. 1,
p.
29.
Yang, Tao
and
Chaudhry, M. L.
1996.
On steady-state queue size distributions of the discrete-time GI/G/1 queue.
Advances in Applied Probability,
Vol. 28,
Issue. 04,
p.
1177.
Sapna Isotupa, K. P.
and
Stanford, David A.
2002.
AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITYM/PH/1 QUEUE.
Stochastic Models,
Vol. 18,
Issue. 3,
p.
387.
Drekic, Steve
and
Woolford, Douglas G.
2005.
A preemptive priority queue with balking.
European Journal of Operational Research,
Vol. 164,
Issue. 2,
p.
387.
Shah, Syed Asif Ali
Shah, Wajiha
Hayat, M. Faisal
and
Menghwar, Gordhan Das
2009.
Modelling Finite Buffer Slotted Ring Network Using Matrix Geometric Method.
p.
535.