Information Technology Reference
In-Depth Information
52. Dick, J., Sloan, I.H., Wang, X., Wozniakowski, H.: Liberating the weights. Journal
of Complexity 20(5), 593-623 (2004)
53. Kuo, F.Y., Sloan, I.H.: Lifting the curse of dimensionality. Notices of the
AMS 52(11), 1320-1328 (2005)
54. Sobol', I.M.: The distribution of points in a cube and the approximate evaluation
of integrals. U.S.S.R. Comput. Math. and Math. Phys. 7, 86-112 (1967)
55. Faure, H.: Discrepance des suites associees `aunsysteme de num´erationendimen-
sion
. Acta Arithmetica 61, 337-351 (1982)
56. Niederreiter, H.: Point sets and sequences with small discrepancy. Monatshefte fur
Mathematik 104, 273-337 (1987)
57. Niederreiter, H., Xing, C.: The algebraic-geometry approach to low-discrepancy
sequences. In: Hellekalek, P., Larcher, G., Niederreiter, H., Zinterhof, P. (eds.)
Monte Carlo and Quasi-Monte Carlo Methods 1996. Lecture Notes in Statistics,
vol. 127, pp. 139-160. Springer, New York (1998)
58. L'Ecuyer, P.: Polynomial integration lattices. In: Niederreiter, H. (ed.) Monte Carlo
and Quasi-Monte Carlo Methods 2002, pp. 73-98. Springer, Berlin (2004)
59. Lemieux, C., L'Ecuyer, P.: Randomized polynomial lattice rules for multivariate
integration and simulation. SIAM Journal on Scientific Computing 24(5), 1768-
1789 (2003)
60. L'Ecuyer, P., Touzin, R.: On the Deng-Lin random number generators and related
methods. Statistics and Computing 14, 5-9 (2004)
61. Niederreiter, H., Pirsic, G.: Duality for digital nets and its applications. Acta Arith-
metica 97, 173-182 (2001)
62. Schmid, W.C., Schurer, R.: MinT, the database for optimal (t, m, s)-net parameters
(2005),
http://mint.sbg.ac.at
63. Panneton, F., L'Ecuyer, P.: Infinite-dimensional highly-uniform point sets defined
via linear recurrences in
F
2
w
. In: Niederreiter, H., Talay, D. (eds.) Monte Carlo
and Quasi-Monte Carlo Methods 2004, pp. 419-429. Springer, Berlin (2006)
64. Joe, S., Kuo, F.Y.: Constructing Sobol sequences with better two-dimensional pro-
jections. SIAM Journal on Scientific Computing (to appear, 2008)
65. Lemieux, C.: L'utilisation de regles de reseau en simulation comme technique de
reduction de la variance. PhD thesis, Universit´edeMontreal (May 2000)
66. L'Ecuyer, P., Panneton, F.: Fast random number generators based on linear recur-
rences modulo 2: Overview and comparison. In: Proceedings of the 2005 Winter
Simulation Conference, pp. 110-119. IEEE Press, Los Alamitos (2005)
67. Panneton, F., L'Ecuyer, P.: On the xorshift random number generators. ACM
Transactions on Modeling and Computer Simulation 15(4), 346-361 (2005)
s
