Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Csörgő, M.
and
Horváth, L.
1988.
Rate of convergence of transport processes with an application to stochastic differential equations.
Probability Theory and Related Fields,
Vol. 78,
Issue. 3,
p.
379.
Steinebach, Josef
1988.
Invariance principles for renewal processes when only moments of low order exist.
Journal of Multivariate Analysis,
Vol. 26,
Issue. 2,
p.
169.
Steinebach, Josef
1988.
On the optimality of strong approximation rates for compound renewal processes.
Statistics & Probability Letters,
Vol. 6,
Issue. 4,
p.
263.
Alex, Michael
and
Steinebach, Josef
1989.
Invariance principles in queueing theory.
Journal of Applied Probability,
Vol. 26,
Issue. 4,
p.
845.
Hanqin, Zhang
Guanghui, Hsu
and
Rongxin, Wang
1990.
Strong approximations for multiple channel queues in heavy traffic.
Journal of Applied Probability,
Vol. 27,
Issue. 3,
p.
658.
Glynn, Peter W.
and
Whitt, Ward
1991.
A new view of the heavy-traffic limit theorem for infinite-server queues.
Advances in Applied Probability,
Vol. 23,
Issue. 1,
p.
188.
Zhang, Han-Qin
and
Hsu, Guang-Hui
1992.
Strong approximations for priority queues; head-of-the-line-first discipline.
Queueing Systems,
Vol. 10,
Issue. 3,
p.
213.
Szyszkowicz, Barbara
1992.
Asymptotic distributions of weighted compound Poisson bridges.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 112,
Issue. 3,
p.
613.
Sharma, Vinod
1995.
Reliable estimation via simulation.
Queueing Systems,
Vol. 19,
Issue. 1-2,
p.
169.
Ennadifi, Gratiane
1995.
Strong approximation of the number of renewal paced record times.
Journal of Statistical Planning and Inference,
Vol. 45,
Issue. 1-2,
p.
113.
Zhang, Hanqin
1997.
Strong Approximations of Irreducible Closed Queueing Networks.
Advances in Applied Probability,
Vol. 29,
Issue. 2,
p.
498.
Csörgő, Miklós
Horváth, Lajos
and
Kokoszka, Piotr
1999.
Approximation for bootstrapped empirical processes.
Proceedings of the American Mathematical Society,
Vol. 128,
Issue. 8,
p.
2457.
Chen, Hong
and
Yao, David D.
2001.
Fundamentals of Queueing Networks.
Vol. 46,
Issue. ,
p.
125.
Csáki, Endre
Révész, Pál
and
Shi, Zhan
2004.
Large void zones and occupation times for coalescing random walks.
Stochastic Processes and their Applications,
Vol. 111,
Issue. 1,
p.
97.
Yin, George
and
Zhang, Hanqin
2007.
Singularly perturbed Markov chains: Limit results and applications.
The Annals of Applied Probability,
Vol. 17,
Issue. 1,
Minkevičius, S.
2008.
On the Analysis of the Virtual Waiting Time in Open Queueing Networks.
Acta Applicandae Mathematicae,
Vol. 104,
Issue. 3,
p.
271.
Minkevičius, Saulius
2009.
On extreme values in open queueing networks.
Mathematical and Computer Modelling,
Vol. 50,
Issue. 7-8,
p.
1058.
Guo, Yongjiang
and
Liu, Yunan
2015.
A law of iterated logarithm for multiclass queues with preemptive priority service discipline.
Queueing Systems,
Vol. 79,
Issue. 3-4,
p.
251.
Guo, Yongjiang
and
Li, Zhongzhi
2017.
Asymptotic variability analysis for a two-stage tandem queue, part II: The law of the iterated logarithm.
Journal of Mathematical Analysis and Applications,
Vol. 450,
Issue. 2,
p.
1510.
Guo, Yongjiang
and
Li, Zhongzhi
2017.
Asymptotic variability analysis for a two-stage tandem queue, part I: The functional law of the iterated logarithm.
Journal of Mathematical Analysis and Applications,
Vol. 450,
Issue. 2,
p.
1479.