Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Galambos, Janos
1981.
Statistical Distributions in Scientific Work.
p.
309.
Galambos, Janos
1984.
Nonparametric Methods.
Vol. 4,
Issue. ,
p.
359.
Platz, Ole
1985.
A sharp upper probability bound for the occurrence of at least m out of n events.
Journal of Applied Probability,
Vol. 22,
Issue. 4,
p.
978.
Móri, Tamás F.
and
Székely, Gábor J.
1985.
A note on the background of several Bonferroni–Galambos-type inequalities.
Journal of Applied Probability,
Vol. 22,
Issue. 04,
p.
836.
Szántai, T.
1986.
Stochastic Programming 84 Part I.
Vol. 27,
Issue. ,
p.
1.
McArthur, David L.
1987.
Alternative Approaches to the Assessment of Achievement.
p.
159.
1988.
Extreme Value Theory in Engineering.
p.
341.
Samuels, Stephen M.
and
Studden, William J.
1989.
Probability, Statistics, and Mathematics.
p.
271.
Pint�r, J.
1989.
Deterministic approximations of probability inequalities.
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research,
Vol. 33,
Issue. 4,
p.
219.
Sibuya, Masaaki
1991.
Bonferroni-type inequalities; Chebyshev-type inequalities for the distributions on [0, n].
Annals of the Institute of Statistical Mathematics,
Vol. 43,
Issue. 2,
p.
261.
Sibuya, Masaaki
1992.
Probability Theory and Applications.
p.
165.
Kounias, S.
and
Sotirakoglou, K.
1993.
Upper and lower bounds for the probability that r events occur.
Optimization,
Vol. 27,
Issue. 1-2,
p.
63.
Lai, C.D.
1993.
Bounds on reliability of a k-out-of-n system.
Microelectronics Reliability,
Vol. 33,
Issue. 5,
p.
697.
Grable, David A.
1994.
Hypergraphs and sharpened sieve inequalities.
Discrete Mathematics,
Vol. 132,
Issue. 1-3,
p.
75.
Bukszár, József
2001.
Optimization Theory.
Vol. 59,
Issue. ,
p.
33.
Prékopa, András
2003.
Stochastic Programming.
Vol. 10,
Issue. ,
p.
267.
Prékopa, András
Long, Jianmin
and
Szántai, Tamás
2004.
Dynamic Stochastic Optimization.
Vol. 532,
Issue. ,
p.
293.
Costigan, T.
2005.
Encyclopedia of Biostatistics.
Prékopa, András
and
Gao, Linchun
2005.
Bounding the probability of the union of events by aggregation and disaggregation in linear programs.
Discrete Applied Mathematics,
Vol. 145,
Issue. 3,
p.
444.
Tong, Yongxin
Chen, Lei
and
Ding, Bolin
2012.
Discovering Threshold-based Frequent Closed Itemsets over Probabilistic Data.
p.
270.