AbstractWe construct families of digital (t,m,s)-nets over F4 improving the best known parameters of (t,m,s)-nets. We also improve the bound of Niederreiter and Xing in the asymptotic theory of digital (t,m,s)-nets
AbstractIn an article of A. B. Owen (1998, J. Complexity14, 466–489) the question about the distribu...
Digital nets (in base $2$) are the subsets of $[0,1]^d$ that contain the expected number of points i...
(t, m, s)-nets are point sets in Euclidean s-space satisfying certain uniformity conditions, for use...
AbstractWe construct families of digital (t,m,s)-nets over F4 improving the best known parameters of...
We construct families of digital (t, m, s)-nets over F(4) improving the best known parameters of (t,...
AbstractWe present a survey of constructions of (t,m,s)-nets and (t,s)-sequences. The emphasis is on...
We present a new construction of digital nets, and more generally of (d,k,m,s)-systems, over finite ...
AbstractWe present a new construction of digital nets, and more generally of (d,k,m,s)-systems, over...
AbstractAn essentially best possible estimate for the order of magnitude of the integration error oc...
(t, m, s)-nets are a powerful tool for the generation of low-discrepancy point sets. We find nets wi...
AbstractThis paper presents a generalization of a construction method for digital (0,s)-sequences ov...
AbstractIn quasi-Monte Carlo methods, point sets of low discrepancy are crucial for accurate results...
AbstractThe concepts of (t,m,s)-nets and (t,s)-sequences are among the best known classes of point s...
AbstractUntil now, the concept of digital (t,m,s)-nets is the most powerful concept for the construc...
AbstractDigital sequences and nets are among the most popular kinds of low discrepancy sequences and...
AbstractIn an article of A. B. Owen (1998, J. Complexity14, 466–489) the question about the distribu...
Digital nets (in base $2$) are the subsets of $[0,1]^d$ that contain the expected number of points i...
(t, m, s)-nets are point sets in Euclidean s-space satisfying certain uniformity conditions, for use...
AbstractWe construct families of digital (t,m,s)-nets over F4 improving the best known parameters of...
We construct families of digital (t, m, s)-nets over F(4) improving the best known parameters of (t,...
AbstractWe present a survey of constructions of (t,m,s)-nets and (t,s)-sequences. The emphasis is on...
We present a new construction of digital nets, and more generally of (d,k,m,s)-systems, over finite ...
AbstractWe present a new construction of digital nets, and more generally of (d,k,m,s)-systems, over...
AbstractAn essentially best possible estimate for the order of magnitude of the integration error oc...
(t, m, s)-nets are a powerful tool for the generation of low-discrepancy point sets. We find nets wi...
AbstractThis paper presents a generalization of a construction method for digital (0,s)-sequences ov...
AbstractIn quasi-Monte Carlo methods, point sets of low discrepancy are crucial for accurate results...
AbstractThe concepts of (t,m,s)-nets and (t,s)-sequences are among the best known classes of point s...
AbstractUntil now, the concept of digital (t,m,s)-nets is the most powerful concept for the construc...
AbstractDigital sequences and nets are among the most popular kinds of low discrepancy sequences and...
AbstractIn an article of A. B. Owen (1998, J. Complexity14, 466–489) the question about the distribu...
Digital nets (in base $2$) are the subsets of $[0,1]^d$ that contain the expected number of points i...
(t, m, s)-nets are point sets in Euclidean s-space satisfying certain uniformity conditions, for use...
DOI
Add to ORKG