Mario Ullrich

Orcid: 0000-0003-1120-8467

According to our database1, Mario Ullrich authored at least 37 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the power of adaption and randomization.
CoRR, 2024

Sampling projections in the uniform norm.
CoRR, 2024

2023
Exponential tractability of L<sub>2</sub>-approximation with function values.
Adv. Comput. Math., April, 2023

On the power of iid information for linear approximation.
CoRR, 2023

Sampling recovery in the uniform norm.
CoRR, 2023

2022
Approximation and Geometry in High Dimensions.
J. Complex., 2022

A sharp upper bound for sampling numbers in L<sub>2</sub>.
CoRR, 2022

Deterministic Constructions of High-Dimensional Sets with Small Dispersion.
Algorithmica, 2022

2021
Function values are enough for <i>L</i><sub>2</sub>-approximation: Part II.
J. Complex., 2021

Function Values Are Enough for L<sub>2</sub>-Approximation.
Found. Comput. Math., 2021

Numerical Performance of Optimized Frolov Lattices in Tensor Product Reproducing Kernel Sobolev Spaces.
Found. Comput. Math., 2021

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

On the fixed volume discrepancy of the Fibonacci sets in the integral norms.
J. Complex., 2020

Function values are enough for L<sub>2</sub>-approximation: Part II.
CoRR, 2020

On the worst-case error of least squares algorithms for L<sub>2</sub>-approximation with high probability.
CoRR, 2020

2019
The minimal k-dispersion of point sets in high dimensions.
J. Complex., 2019

The curse of dimensionality for numerical integration on general domains.
J. Complex., 2019

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

A note on the dispersion of admissible lattices.
Discret. Appl. Math., 2019

2018
A lower bound for the dispersion on the torus.
Math. Comput. Simul., 2018

An upper bound on the minimal dispersion.
J. Complex., 2018

Comparison of hit-and-run, slice sampler and random walk Metropolis.
J. Appl. Probab., 2018

Digital net properties of a polynomial analogue of Frolov's construction.
Finite Fields Their Appl., 2018

2017
A Monte Carlo Method for Integration of Multivariate Smooth Functions.
SIAM J. Numer. Anal., 2017

Product rules are optimal for numerical integration in classical smoothness spaces.
J. Complex., 2017

Complexity of oscillatory integrals on the real line.
Adv. Comput. Math., 2017

2016
The Role of Frolov's Cubature Formula for Functions with Bounded Mixed Derivative.
SIAM J. Numer. Anal., 2016

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

2015
Complexity of oscillatory integration for univariate Sobolev spaces.
J. Complex., 2015

2014
Swendsen-Wang Is Faster than Single-Bond Dynamics.
SIAM J. Discret. Math., 2014

The curse of dimensionality for numerical integration of smooth functions.
Math. Comput., 2014

The curse of dimensionality for numerical integration of smooth functions II.
J. Complex., 2014

On weak tractability of the Clenshaw-Curtis Smolyak algorithm.
J. Approx. Theory, 2014

On "Upper Error Bounds for Quadrature Formulas on Function Classes" by K.K. Frolov.
Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014

2013
Comparison of Swendsen-Wang and heat-bath dynamics.
Random Struct. Algorithms, 2013

Heat-bath Markov chains have no negative eigenvalues
CoRR, 2013

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


  Loading...