AbstractThe concepts of (t,m,s)-nets and (t,s)-sequences are among the best known classes of point sets in the theory of quasi-Monte Carlo methods. In this paper, we give new general upper bounds for the star discrepancy of (t,m,s)-nets and (t,s)-sequences. By these findings, we improve existing upper bounds on the discrepancy of such point sets and extend results that have been obtained for low-dimensional nets and sequences during the past years
AbstractWe propose an algorithm to compute upper and lower bounds for the star discrepancy of an arb...
We introduce two novel techniques for speeding up the generation of digital \((t,s)\)-sequences. Bas...
AbstractFor numerical integration in higher dimensions, bounds for the star-discrepancy with polynom...
AbstractThe concepts of (t,m,s)-nets and (t,s)-sequences are among the best known classes of point s...
International audienceIn this paper, we derive new general upper bounds on the star discrepancy of (...
A mixed sequence is a sequence in the $s$-dimensional unit cube which one obtains by concatenating a...
A mixed sequence is a sequence in the $s$-dimensional unit cube which one obtains by concatenating a...
International audienceThe class of $(t,m,s)$-nets and $(t,s)$-sequences, introduced in their most ge...
International audienceThe class of $(t,m,s)$-nets and $(t,s)$-sequences, introduced in their most ge...
AbstractIn many applications it has been observed that hybrid-Monte Carlo sequences perform better t...
Low-discrepancy point sets and sequences play an important role in quasi-Monte Carlo method for n...
AbstractIt was shown by Heinrich et al. [The inverse of the star-discrepancy depends linearly on the...
AbstractWe generalize and improve earlier constructions of low-discrepancy sequences by Sobol', Faur...
AbstractWe present a survey of constructions of (t,m,s)-nets and (t,s)-sequences. The emphasis is on...
AbstractIn 2001 Heinrich, Novak, Wasilkowski and Woźniakowski proved that for every s≥1 and N≥1 ther...
AbstractWe propose an algorithm to compute upper and lower bounds for the star discrepancy of an arb...
We introduce two novel techniques for speeding up the generation of digital \((t,s)\)-sequences. Bas...
AbstractFor numerical integration in higher dimensions, bounds for the star-discrepancy with polynom...
AbstractThe concepts of (t,m,s)-nets and (t,s)-sequences are among the best known classes of point s...
International audienceIn this paper, we derive new general upper bounds on the star discrepancy of (...
A mixed sequence is a sequence in the $s$-dimensional unit cube which one obtains by concatenating a...
A mixed sequence is a sequence in the $s$-dimensional unit cube which one obtains by concatenating a...
International audienceThe class of $(t,m,s)$-nets and $(t,s)$-sequences, introduced in their most ge...
International audienceThe class of $(t,m,s)$-nets and $(t,s)$-sequences, introduced in their most ge...
AbstractIn many applications it has been observed that hybrid-Monte Carlo sequences perform better t...
Low-discrepancy point sets and sequences play an important role in quasi-Monte Carlo method for n...
AbstractIt was shown by Heinrich et al. [The inverse of the star-discrepancy depends linearly on the...
AbstractWe generalize and improve earlier constructions of low-discrepancy sequences by Sobol', Faur...
AbstractWe present a survey of constructions of (t,m,s)-nets and (t,s)-sequences. The emphasis is on...
AbstractIn 2001 Heinrich, Novak, Wasilkowski and Woźniakowski proved that for every s≥1 and N≥1 ther...
AbstractWe propose an algorithm to compute upper and lower bounds for the star discrepancy of an arb...
We introduce two novel techniques for speeding up the generation of digital \((t,s)\)-sequences. Bas...
AbstractFor numerical integration in higher dimensions, bounds for the star-discrepancy with polynom...