Mario Ullrich

Jan Vybíral

J. Complex., 2025

2024

On the power of adaption and randomization.

[BibT_eX]

[DOI]

CoRR, 2024

Sampling projections in the uniform norm.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Exponential tractability of L2-approximation with function values.

[BibT_eX]

[DOI]

Adv. Comput. Math., April, 2023

On the power of iid information for linear approximation.

[BibT_eX]

[DOI]

Mathias Sonnleitner

CoRR, 2023

Sampling recovery in the uniform norm.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Approximation and Geometry in High Dimensions.

[BibT_eX]

[DOI]

Joscha Prochno

J. Complex., 2022

A sharp upper bound for sampling numbers in L2.

[BibT_eX]

[DOI]

Matthieu Dolbeault

CoRR, 2022

Deterministic Constructions of High-Dimensional Sets with Small Dispersion.

[BibT_eX]

[DOI]

Jan Vybíral

Algorithmica, 2022

2021

Function values are enough for L2-approximation: Part II.

[BibT_eX]

[DOI]

J. Complex., 2021

Function Values Are Enough for L2-Approximation.

[BibT_eX]

[DOI]

Found. Comput. Math., 2021

Numerical Performance of Optimized Frolov Lattices in Tensor Product Reproducing Kernel Sobolev Spaces.

[BibT_eX]

[DOI]

Found. Comput. Math., 2021

2020

On the worst-case error of least squares algorithms for L2-approximation with high probability.

[BibT_eX]

[DOI]

J. Complex., 2020

On the fixed volume discrepancy of the Fibonacci sets in the integral norms.

[BibT_eX]

[DOI]

Vladimir N. Temlyakov

J. Complex., 2020

Function values are enough for L2-approximation: Part II.

[BibT_eX]

[DOI]

CoRR, 2020

On the worst-case error of least squares algorithms for L2-approximation with high probability.

[BibT_eX]

[DOI]

CoRR, 2020

2019

The minimal k-dispersion of point sets in high dimensions.

[BibT_eX]

[DOI]

J. Complex., 2019

The curse of dimensionality for numerical integration on general domains.

[BibT_eX]

[DOI]

Aicke Hinrichs

Joscha Prochno

J. Complex., 2019

Lattice rules with random n achieve nearly the optimal O(n-α-1∕2) error independently of the dimension.

[BibT_eX]

[DOI]

J. Approx. Theory, 2019

A note on the dispersion of admissible lattices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

A lower bound for the dispersion on the torus.

[BibT_eX]

[DOI]

Math. Comput. Simul., 2018

An upper bound on the minimal dispersion.

[BibT_eX]

[DOI]

Jan Vybíral

J. Complex., 2018

Comparison of hit-and-run, slice sampler and random walk Metropolis.

[BibT_eX]

[DOI]

Daniel Rudolf

J. Appl. Probab., 2018

Digital net properties of a polynomial analogue of Frolov's construction.

[BibT_eX]

[DOI]

Josef Dick

Friedrich Pillichshammer

Kosuke Suzuki

Takehito Yoshiki

Finite Fields Their Appl., 2018

2017

A Monte Carlo Method for Integration of Multivariate Smooth Functions.

[BibT_eX]

[DOI]

SIAM J. Numer. Anal., 2017

Product rules are optimal for numerical integration in classical smoothness spaces.

[BibT_eX]

[DOI]

J. Complex., 2017

Complexity of oscillatory integrals on the real line.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2017

2016

The Role of Frolov's Cubature Formula for Functions with Bounded Mixed Derivative.

[BibT_eX]

[DOI]

Tino Ullrich

SIAM J. Numer. Anal., 2016

Lattice based integration algorithms: Kronecker sequences and rank-1 lattices.

[BibT_eX]

[DOI]

Josef Dick

Friedrich Pillichshammer

Kosuke Suzuki

Takehito Yoshiki

CoRR, 2016

2015

Complexity of oscillatory integration for univariate Sobolev spaces.

[BibT_eX]

[DOI]

Henryk Wozniakowski

J. Complex., 2015

2014

Swendsen-Wang Is Faster than Single-Bond Dynamics.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

The curse of dimensionality for numerical integration of smooth functions.

[BibT_eX]

[DOI]

Math. Comput., 2014

The curse of dimensionality for numerical integration of smooth functions II.

[BibT_eX]

[DOI]

J. Complex., 2014

On weak tractability of the Clenshaw-Curtis Smolyak algorithm.

[BibT_eX]

[DOI]

Aicke Hinrichs

J. Approx. Theory, 2014

On "Upper Error Bounds for Quadrature Formulas on Function Classes" by K.K. Frolov.

[BibT_eX]

[DOI]

Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014

2013

Comparison of Swendsen-Wang and heat-bath dynamics.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2013

Heat-bath Markov chains have no negative eigenvalues

[BibT_eX]

[DOI]

Catherine S. Greenhill

CoRR, 2013

2012

Rapid mixing of Swendsen-Wang and single-bond dynamics in two dimensions

[BibT_eX]

[DOI]