Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm. - Adrian Ebert; Peter Kritzer (J. Comput. Appl. Math., 2019)

Component-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spaces. - Adrian Ebert; Peter Kritzer; Onyekachi Osisiogu; Tetiana Stepaniuk (CoRR, 2020)

Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness. - Adrian Ebert; Peter Kritzer; Dirk Nuyens; Onyekachi Osisiogu (J. Complex., 2021)

Tractability of approximation in the weighted Korobov space in the worst-case setting - a complete picture. - Adrian Ebert; Friedrich Pillichshammer (J. Complex., 2021)

Tractability of approximation in the weighted Korobov space in the worst-case setting. - Adrian Ebert; Peter Kritzer; Friedrich Pillichshammer (CoRR, 2022)

Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness. - Gunther Leobacher; Friedrich Pillichshammer; Adrian Ebert (CoRR, 2022)

Construction of good polynomial lattice rules in weighted Walsh spaces by an alternative component-by-component construction. - Adrian Ebert; Peter Kritzer; Onyekachi Osisiogu; Tetiana Stepaniuk (Math. Comput. Simul., 2022)

Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness. - Gunther Leobacher; Friedrich Pillichshammer; Adrian Ebert (J. Complex., 2023)

The fast reduced QMC matrix-vector product. - Josef Dick; Adrian Ebert; Lukas Herrmann; Peter Kritzer; Marcello Longo (J. Comput. Appl. Math., 2024)