Maxima in hypercubes

Random Structures and Algorithms

Volumn 27, Issue 3, 2005, Pages 290-309

  Bai, Zhi Dong ^a,b   Devroye, Luc ^c   Hwang, Hsien Kuei ^d   Tsai, Tsung Hsi ^d  

^a NORTHEAST NORMAL UNIVERSITY   (China)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c MCGILL UNIVERSITY   (Canada)

^d INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27844562630     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20053     Document Type: Article

References (33)

1. Z.-D. Bai, C.-C. Chao, H.-K. Hwang, and W.-Q. Liang, On the variance of the number of maxima in random vectors and its applications, Ann Appl Probab 8 (1998), 886-895.
2. Z.-D. Bai, H.-K. Hwang, W.-Q. Liang, and T.-H. Tsai, Limit theorems for the number of maxima in random samples from planar regions, Electron J Probab 6 (2001), http://www.math. washington.edu/~ejpecp/EjpVol6/paper3.pdf, Paper 3, 41 pp.
3. Z.-D. Bai, H.-K. Hwang, and T.-H. Tsai, Berry-Esseen bounds for the number of maxima in planar regions, Electron J Probab 8 (2003), http://www.math.washington.edu/~ejpecp/EjpVol8/paper9.pdf, Paper 9, 26 pp.
4. A. D. Barbour, L. Holst, and S. Janson, Poisson approximation, Oxford University Press, New York, 1992.
5. A. D. Barbour and A. Xia, The number of two dimensional maxima, Adv Appl Probab 33 (2001), 727-750.
6. O. Barndorff-Nielsen and M. Sobel, On the distribution of the number of admissible points in a vector random sample, Theory Probab Appl 11 (1966), 249-269.
7. Y. Baryshnikov, Supporting-points processes and some of their applications, Probab Theory Related Fields 117 (2000), 163-182.
8. J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson, On the average number of maxima in a set of vectors and applications, J ACM 25 (1978), 536-543.
9. B. A. Berezovskiǐ and S. I. Travkin, Supervision of queues of requests in computer systems, Autom Remote Control 36 (1975), 1719-1725.
10. C. Blair, Random inequality constraint systems with few variables, Math Program 35 (1986), 133-139.
11. C. Buchta, On the average number of maxima in a set of vectors, Inform Process Lett 33 (1989), 63-65.
12. H. C. Calpine and A. Golding, Some properties of Pareto-optimal choices in decision problems, Omega Int J Management Sci 4 (1976), 141-147.
13. A. Carlsund, Notes on the variance of the number of maxima in three dimensions, Random Structures Algorithms 22 (2003), 440-447.
14. W.-M. Chen, H.-K. Hwang, and T.-H. Tsai, Efficient maxima-finding algorithms for random planar samples, Discrete Math Theor Comput Sci (Electron) 6 (2003), 107-122.
15. L. Devroye, A note on finding convex hulls via maximal vectors, Inform Process Lett 11 (1980), 53-56.
16. L. Devroye, Lecture notes on bucket algorithms, Birkhäuser Boston, Boston, MA, 1986.
17. L. Devroye, A note on the expected time for finding maxima by list algorithms, Algorithmica 23 (1999), 97-108.
18. M. E. Dyer and J. Walker, Dominance in multi-dimensional multiple-choice knapsack problems, Asia-Pacific J Oper Res 15 (1998), 159-168.
19. P. Flajolet, G. Labelle, L. Laforest, and B. Salvy, Hypergeometrics and the cost structure of quadtrees, Random Structures Algorithms 7 (1995), 117-144.
20. P. Flajolet and B. Salvy, Euler sums and contour integral representations, Experiment Math 7 (1998), 15-35.
21. P. Flajolet and R. Sedgewick, Mellin transforms and asymptotics: Finite differences and Rice's integrals, Theoret Comput Sci 144 (1995), 101-124.
22. M. J. Golin, A provably fast linear-expected-time maxima-finding algorithm, Algorithmica 11 (1994), 501-524.
23. H.-K. Hwang, "Phase changes in random recursive structures and algorithms," Proceedings of the Workshop on Probability with Applications to Finance and Insurance (Hong Kong, July, 2002), T. L. Lai, H. Yang, and S. P. Yung (Editors), 82-97. World Scientific, Singapore, June 2004. (Preprint available at algo.stat.sinica.edu.tw)
24. V. M. Ivanin, Estimate of the mathematical expectation of the number of elements of the Pareto set, Kibernetika (Kiev) 3 (1975), 145-146 (in Russian);
25. English translation: Cybernetics 11 (1976), 506-507.
26. V. M. Ivanin, "Calculation of the dispersion of the number of elements of the Pareto set for the choice of independent vectors with independent components," Theory of optimal decisions, 90-100. Akad. Nauk. Ukr. SSR Inst. Kibernet., Kiev, 1976 (in Russian).
27. S. Janson, T. Łuczak, and A. Rucinski, Random graphs, Wiley, New York, 2000.
28. A. I. Kuksa and N. Z. Šor, The method of estimating the number of conditionally optimal trajectories of discrete separable dynamic programming (in Russian), Kibernetika (Kiev) 6 (1972), 37-44.
29. G. Labelle and L. Laforest, Combinatorial variations on multidimensional quadtrees, J Combinat Theory Ser A 69 (1995), 1-16.
30. B. O'Neill, The number of outcomes in the Pareto-optimal set of discrete bargaining games, Math Oper Res 6 (1980), 571-578.
31. Yu. V. Prohorov, "Asymptotic behavior of the binomial distribution," Selected translations in mathematical statistics and probability, Volume 1, 87-95. ISM and AMS, Providence, RI, 1961
32. [transl. from Russian Usp Mat Nauk 8 (1953), no. 3 (35), 135-142.
33. C. Vout, Randomly collecting sets of objects or ... It's another spear-thrower! Eureka 36 (18-20 October, 1973).