Monday |
|
8:45 |
Registration |
|
9:15 |
Opening Ceremony |
|
9:35 |
Niederreiter H |
Low-discrepancy Sequences: Where Do We Stand and Where Are We Going? |
|
|
|
10:30 |
Break |
|
11:00 |
Sloan I |
Why Do Quasi-Monte Carlo Methods Work So Well? |
11:55 |
Faure H |
Variations on (0,s)-sequences |
12:20 |
Photo |
|
12:35 |
Lunch |
|
14:05 |
Novak E |
Polynomial Upper Bounds for the Star-Discrepancy |
|
|
|
15:00 |
Plaskota L |
The Exponent of Discrepancy of Sparse Grids is At Least 2.1933 |
15:25 |
Schmid W |
Optimal Polynomials for Digital (t,m,s)-Nets in Arbitrary Prime Base
|
15:50 |
Break |
|
16:20 |
Pirsic G |
Efficient Calculation of the Quality Parameter of Digital Sequences |
16:45 |
Langtry T N |
On Component Scaling of Integration Lattices |
17:10 |
Hong H S |
Implementing Scrambled Sobol', Niederreiter, and Faure Points |
17:35 |
End |
|