1. Agresti, A. & Coull, B. A. (1998). Approximate is Better than “Exact” for Interval Estimation of Binomial Proportions. The American Statistician, 52(2), 119–126.
2. Beume, N. & Rudolph, G. (2006). Faster S-Metric Calculation by Considering Dominated Hypervolume as Klee’s Measure Problem. Technical Report CI-216/06, Sonderforschungsbereich 531 Computational Intelligence, Universität Dortmund. shorter version published at IASTED International Conference on Computational Intelligence (CI 2006).
3. Bleuler, S., Laumanns, M., Thiele, L., & Zitzler, E. (2002). PISA – A Platform and Programming Language Independent Interface for Search Algorithms. TIK Report 154, Computer Engineering and Networks Laboratory (TIK), ETH Zurich.
4. Branke, J., Chick, S. E., & Schmidt, C. (2005). New developments in ranking and selection: an empirical comparison of the three main approaches. In Proceedings of the 37th conference on Winter simulation (WSC 2005) (pp. 708–717). Winter Simulation Conference.
5. Bringmann, K. & Friedrich, T. (2008). Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. In S. H. Hong, H. Nagamochi, & T. Fukunaga, editors, International Symposium on Algorithms and Computation (ISAAC 2008) (Vol. 5369) of LNCS (pp. 436–447). Berlin, Germany: Springer.