default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMario Ullrich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i17]David Krieg
, Kateryna Pozharska, Mario Ullrich, Tino Ullrich:
Sampling projections in the uniform norm. CoRR abs/2401.02220 (2024)- [i16]David Krieg, Erich Novak, Mario Ullrich:
On the power of adaption and randomization. CoRR abs/2406.07108 (2024) - 2023
- [j26]David Krieg, Pawel Siedlecki, Mario Ullrich, Henryk Wozniakowski:
Exponential tractability of L2-approximation with function values. Adv. Comput. Math. 49(2): 18 (2023) - [i15]David Krieg, Kateryna Pozharska, Mario Ullrich, Tino Ullrich:
Sampling recovery in the uniform norm. CoRR abs/2305.07539 (2023) - [i14]Mathias Sonnleitner, Mario Ullrich:
On the power of iid information for linear approximation. CoRR abs/2310.12740 (2023) - 2022
- [j25]Mario Ullrich, Jan Vybíral:
Deterministic Constructions of High-Dimensional Sets with Small Dispersion. Algorithmica 84(7): 1897-1915 (2022) - [j24]Erich Novak, Joscha Prochno, Mario Ullrich:
Approximation and Geometry in High Dimensions. J. Complex. 71: 101661 (2022) - [i13]Matthieu Dolbeault, David Krieg, Mario Ullrich:
A sharp upper bound for sampling numbers in L2. CoRR abs/2204.12621 (2022) - [i12]David Krieg, Pawel Siedlecki, Mario Ullrich, Henryk Wozniakowski:
Exponential tractability of L2-approximation with function values. CoRR abs/2205.04141 (2022) - 2021
- [j23]Christopher Kacwin, Jens Oettershagen, Mario Ullrich, Tino Ullrich:
Numerical Performance of Optimized Frolov Lattices in Tensor Product Reproducing Kernel Sobolev Spaces. Found. Comput. Math. 21(3): 849-889 (2021) - [j22]David Krieg, Mario Ullrich:
Function Values Are Enough for L2-Approximation. Found. Comput. Math. 21(4): 1141-1151 (2021) - [j21]David Krieg, Mario Ullrich:
Function values are enough for L2-approximation: Part II. J. Complex. 66: 101569 (2021) - 2020
- [j20]Mario Ullrich:
On the worst-case error of least squares algorithms for L2-approximation with high probability. J. Complex. 60: 101484 (2020) - [j19]Vladimir N. Temlyakov, Mario Ullrich:
On the fixed volume discrepancy of the Fibonacci sets in the integral norms. J. Complex. 61: 101472 (2020) - [i11]Mario Ullrich:
On the worst-case error of least squares algorithms for L2-approximation with high probability. CoRR abs/2003.11947 (2020) - [i10]David Krieg, Mario Ullrich:
Function values are enough for L2-approximation: Part II. CoRR abs/2011.01779 (2020)
2010 – 2019
- 2019
- [j18]Mario Ullrich:
A note on the dispersion of admissible lattices. Discret. Appl. Math. 257: 385-387 (2019) - [j17]Peter Kritzer, Frances Y. Kuo, Dirk Nuyens, Mario Ullrich:
Lattice rules with random n achieve nearly the optimal O(n-α-1∕2) error independently of the dimension. J. Approx. Theory 240: 96-113 (2019) - [j16]Aicke Hinrichs, Joscha Prochno, Mario Ullrich:
The curse of dimensionality for numerical integration on general domains. J. Complex. 50: 25-42 (2019) - [j15]Aicke Hinrichs, Joscha Prochno, Mario Ullrich, Jan Vybíral:
The minimal k-dispersion of point sets in high dimensions. J. Complex. 51: 68-78 (2019) - [i9]Mario Ullrich, Jan Vybíral:
Deterministic constructions of high-dimensional sets with small dispersion. CoRR abs/1901.06702 (2019) - [i8]Vladimir N. Temlyakov, Mario Ullrich:
On the fixed volume discrepancy of the Fibonacci sets in the integral norms. CoRR abs/1908.04658 (2019) - 2018
- [j14]Josef Dick, Friedrich Pillichshammer, Kosuke Suzuki, Mario Ullrich, Takehito Yoshiki:
Digital net properties of a polynomial analogue of Frolov's construction. Finite Fields Their Appl. 51: 325-350 (2018) - [j13]Daniel Rudolf, Mario Ullrich:
Comparison of hit-and-run, slice sampler and random walk Metropolis. J. Appl. Probab. 55(4): 1186-1202 (2018) - [j12]Mario Ullrich, Jan Vybíral:
An upper bound on the minimal dispersion. J. Complex. 45: 120-126 (2018) - [j11]Mario Ullrich:
A lower bound for the dispersion on the torus. Math. Comput. Simul. 143: 186-190 (2018) - [i7]Christopher Kacwin, Jens Oettershagen, Mario Ullrich, Tino Ullrich:
Numerical performance of optimized Frolov lattices in tensor product reproducing kernel Sobolev spaces. CoRR abs/1802.08666 (2018) - 2017
- [j10]Erich Novak, Mario Ullrich, Henryk Wozniakowski, Shun Zhang:
Complexity of oscillatory integrals on the real line. Adv. Comput. Math. 43(3): 537-553 (2017) - [j9]Aicke Hinrichs, Erich Novak, Mario Ullrich, Henryk Wozniakowski:
Product rules are optimal for numerical integration in classical smoothness spaces. J. Complex. 38: 39-49 (2017) - [j8]Mario Ullrich:
A Monte Carlo Method for Integration of Multivariate Smooth Functions. SIAM J. Numer. Anal. 55(3): 1188-1200 (2017) - [i6]Mario Ullrich:
A note on the dispersion of admissible lattices. CoRR abs/1710.08694 (2017) - 2016
- [j7]Mario Ullrich, Tino Ullrich:
The Role of Frolov's Cubature Formula for Functions with Bounded Mixed Derivative. SIAM J. Numer. Anal. 54(2): 969-993 (2016) - [i5]Josef Dick, Friedrich Pillichshammer, Kosuke Suzuki, Mario Ullrich, Takehito Yoshiki:
Lattice based integration algorithms: Kronecker sequences and rank-1 lattices. CoRR abs/1608.08687 (2016) - 2015
- [j6]Erich Novak, Mario Ullrich, Henryk Wozniakowski:
Complexity of oscillatory integration for univariate Sobolev spaces. J. Complex. 31(1): 15-41 (2015) - [i4]Mario Ullrich:
A lower bound for the dispersion on the torus. CoRR abs/1510.04617 (2015) - 2014
- [j5]Aicke Hinrichs, Erich Novak, Mario Ullrich:
On weak tractability of the Clenshaw-Curtis Smolyak algorithm. J. Approx. Theory 183: 31-44 (2014) - [j4]Aicke Hinrichs, Erich Novak, Mario Ullrich, Henryk Wozniakowski:
The curse of dimensionality for numerical integration of smooth functions II. J. Complex. 30(2): 117-143 (2014) - [j3]Aicke Hinrichs, Erich Novak, Mario Ullrich, Henryk Wozniakowski:
The curse of dimensionality for numerical integration of smooth functions. Math. Comput. 83(290): 2853-2863 (2014) - [j2]Mario Ullrich:
Swendsen-Wang Is Faster than Single-Bond Dynamics. SIAM J. Discret. Math. 28(1): 37-48 (2014) - [c1]Mario Ullrich:
On "Upper Error Bounds for Quadrature Formulas on Function Classes" by K.K. Frolov. MCQMC 2014: 571-582 - 2013
- [j1]Mario Ullrich:
Comparison of Swendsen-Wang and heat-bath dynamics. Random Struct. Algorithms 42(4): 520-535 (2013) - [i3]Catherine S. Greenhill, Mario Ullrich:
Heat-bath Markov chains have no negative eigenvalues. CoRR abs/1301.4055 (2013) - 2012
- [i2]Mario Ullrich:
Swendsen-Wang is faster than single-bond dynamics. CoRR abs/1201.5793 (2012) - [i1]Mario Ullrich:
Rapid mixing of Swendsen-Wang and single-bond dynamics in two dimensions. CoRR abs/1202.6321 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
