default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTino Ullrich
Person information
- affiliation: Chemnitz University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j24]Glenn Byrenheid, Serhii A. Stasyuk, Tino Ullrich:
Lp-Sampling recovery for non-compact subclasses of L∞. Frontiers Appl. Math. Stat. 9 (2023)- [j23]Thomas Jahn
, Tino Ullrich, Felix Voigtländer:
Sampling numbers of smoothness classes via ℓ1-minimization. J. Complex. 79: 101786 (2023) - [j22]Felix Bartel, Lutz Kämmerer, Daniel Potts, Tino Ullrich:
On the reconstruction of functions from values at subsampled quadrature points. Math. Comput. 93(346): 785-809 (2023) - [j21]Laura Lippert, Daniel Potts, Tino Ullrich:
Fast hyperbolic wavelet regression meets ANOVA. Numerische Mathematik 154(1-2): 155-207 (2023) - 2022
- [j20]Nicolas Nagel, Martin Schäfer, Tino Ullrich:
A New Upper Bound for Sampling Numbers. Found. Comput. Math. 22(2): 445-468 (2022) - [j19]Vladimir N. Temlyakov, Tino Ullrich:
Approximation of functions with small mixed smoothness in the uniform norm. J. Approx. Theory 277: 105718 (2022) - [j18]Kateryna Pozharska, Tino Ullrich:
A Note on Sampling Recovery of Multivariate Functions in the Uniform Norm. SIAM J. Numer. Anal. 60(3): 1363-1384 (2022) - 2021
- [j17]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) - [j16]Thomas Jahn, Tino Ullrich:
On the optimal constants in the two-sided Stechkin inequalities. J. Approx. Theory 269: 105607 (2021) - [j15]Thomas Kühn, Winfried Sickel, Tino Ullrich:
How anisotropic mixed smoothness affects the decay of singular numbers for Sobolev embeddings. J. Complex. 63: 101523 (2021) - [j14]Vladimir N. Temlyakov, Tino Ullrich:
Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness. J. Complex. 67: 101575 (2021) - 2020
- [j13]Nadiia Derevianko, Tino Ullrich:
A higher order Faber spline basis for sampling discretization of functions. J. Approx. Theory 257: 105449 (2020) - 2018
- [j12]Sjoerd Dirksen, Tino Ullrich:
Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness. J. Complex. 48: 69-102 (2018) - 2017
- [j11]Glenn Byrenheid, Lutz Kämmerer, Tino Ullrich, Toni Volkmer:
Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness. Numerische Mathematik 136(4): 993-1034 (2017) - 2016
- [j10]Glenn Byrenheid, Dinh Dung, Winfried Sickel, Tino Ullrich:
Sampling on energy-norm based sparse grids for the optimal recovery of Sobolev type functions in Hγ. J. Approx. Theory 207: 207-231 (2016) - [j9]Aicke Hinrichs, Lev Markhasin, Jens Oettershagen, Tino Ullrich:
Optimal quasi-Monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions. Numerische Mathematik 134(1): 163-196 (2016) - [j8]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) - [j7]Thomas Kühn, Sebastian Mayer, Tino Ullrich:
Counting Via Entropy: New Preasymptotics for the Approximation Numbers of Sobolev Embeddings. SIAM J. Numer. Anal. 54(6): 3625-3647 (2016) - 2014
- [j6]Tino Ullrich:
Optimal cubature in Besov spaces with dominating mixed smoothness on the unit square. J. Complex. 30(2): 72-94 (2014) - [j5]Thomas Kühn, Winfried Sickel, Tino Ullrich:
Approximation numbers of Sobolev embeddings - Sharp constants and tractability. J. Complex. 30(2): 95-116 (2014) - 2013
- [j4]Dinh Dung, Tino Ullrich:
N-Widths and ε-Dimensions for High-Dimensional Approximations. Found. Comput. Math. 13(6): 965-1003 (2013) - 2011
- [j3]Dinh Dung, Tino Ullrich:
Whitney type inequalities for local anisotropic polynomial approximation. J. Approx. Theory 163(11): 1590-1605 (2011) - 2010
- [j2]Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich:
The Gelfand widths of lp-balls for 0p<=1. J. Complex. 26(6): 629-640 (2010) - 2009
- [j1]Winfried Sickel, Tino Ullrich:
Tensor products of Sobolev-Besov spaces and applications to approximation from the hyperbolic cross. J. Approx. Theory 161(2): 748-786 (2009)
Informal and Other Publications
- 2025
- [i29]Moritz Moeller, Kateryna Pozharska, Tino Ullrich:
Instance optimal function recovery - samples, decoders and asymptotic performance. CoRR abs/2503.16209 (2025) - [i28]Martin Schäfer, Tino Ullrich:
Besov regularity of multivariate non-periodic functions in terms of half-period cosine coefficients and consequences for recovery and numerical integration. CoRR abs/2504.03903 (2025) - [i27]Bernd Käßemodel, Nicolas Nagel, Tino Ullrich:
Tent transformed order 2 nets and quasi-Monte Carlo rules with quadratic error decay. CoRR abs/2505.10955 (2025) - 2024
- [i26]David Krieg, Kateryna Pozharska, Mario Ullrich, Tino Ullrich:
Sampling projections in the uniform norm. CoRR abs/2401.02220 (2024) - [i25]Moritz Moeller, Serhii A. Stasyuk, Tino Ullrich:
High-dimensional sparse trigonometric approximation in the uniform norm and consequences for sampling recovery. CoRR abs/2407.15965 (2024) - [i24]Felix Bartel, Lutz Kämmerer, Kateryna Pozharska, Martin Schäfer, Tino Ullrich:
Exact discretization, tight frames and recovery via D-optimal designs. CoRR abs/2412.02489 (2024) - 2023
- [i23]Frank Filbir, Ralf Hielscher, Thomas Jahn, Tino Ullrich:
Marcinkiewicz-Zygmund inequalities for scattered and random data on the q-sphere. CoRR abs/2303.00045 (2023) - [i22]David Krieg, Kateryna Pozharska, Mario Ullrich, Tino Ullrich:
Sampling recovery in the uniform norm. CoRR abs/2305.07539 (2023) - [i21]Felix Bartel, Kai Lüttgen, Nicolas Nagel, Tino Ullrich:
Efficient recovery of non-periodic multivariate functions from few scattered samples. CoRR abs/2306.07140 (2023) - 2022
- [i20]Felix Bartel, Martin Schäfer, Tino Ullrich:
Constructive subsampling of finite frames with applications in optimal function recovery. CoRR abs/2202.12625 (2022) - [i19]Felix Bartel, Lutz Kämmerer, Daniel Potts, Tino Ullrich:
On the reconstruction of functions from values at subsampled quadrature points. CoRR abs/2208.13597 (2022) - [i18]Gustavo Garrigós, Andreas Seeger, Tino Ullrich:
Haar frame characterizations of Besov-Sobolev spaces and optimal embeddings into their dyadic counterparts. CoRR abs/2209.02630 (2022) - [i17]Glenn Byrenheid, Serhii A. Stasyuk, Tino Ullrich:
Lp-Sampling recovery for non-compact subclasses of L∞. CoRR abs/2210.01704 (2022) - [i16]Thomas Jahn, Tino Ullrich, Felix Voigtländer:
Sampling numbers of smoothness classes via 𝓁1-minimization. CoRR abs/2212.00445 (2022) - 2021
- [i15]Kateryna Pozharska, Tino Ullrich:
A note on sampling recovery of multivariate functions in the uniform norm. CoRR abs/2103.11124 (2021) - [i14]Laura Lippert, Daniel Potts, Tino Ullrich:
Fast Hyperbolic Wavelet Regression meets ANOVA. CoRR abs/2108.13197 (2021) - 2020
- [i13]Thomas Kühn, Winfried Sickel, Tino Ullrich:
How anisotropic mixed smoothness affects the decay of singular numbers of Sobolev embeddings. CoRR abs/2001.09022 (2020) - [i12]Nadiia Derevianko, Tino Ullrich:
Adaptive sampling recovery of functions with higher mixed regularity. CoRR abs/2004.03556 (2020) - [i11]Thomas Jahn, Tino Ullrich:
On the optimal constants in the two-sided Stechkin inequalities. CoRR abs/2006.07441 (2020) - [i10]Moritz Moeller, Tino Ullrich:
L2-norm sampling discretization and recovery of functions from RKHS with finite trace. CoRR abs/2009.11940 (2020) - [i9]Nicolas Nagel, Martin Schäfer, Tino Ullrich:
A new upper bound for sampling numbers. CoRR abs/2010.00327 (2020) - [i8]Vladimir N. Temlyakov, Tino Ullrich:
Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness. CoRR abs/2012.09925 (2020) - [i7]Vladimir N. Temlyakov, Tino Ullrich:
Approximation of functions with small mixed smoothness in the uniform norm. CoRR abs/2012.11983 (2020) - 2019
- [i6]Gustavo Garrigós, Andreas Seeger, Tino Ullrich:
The Haar System in Triebel-Lizorkin Spaces: Endpoint Results. CoRR abs/1907.03738 (2019) - [i5]Lutz Kämmerer, Tino Ullrich, Toni Volkmer:
Worst case recovery guarantees for least squares approximation using random samples. CoRR abs/1911.10111 (2019) - [i4]Nadiia Derevianko, Tino Ullrich:
A higher order Faber spline basis for sampling discretization of functions. CoRR abs/1912.00391 (2019) - 2018
- [i3]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
- [i2]Sjoerd Dirksen, Tino Ullrich:
Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness. CoRR abs/1702.06781 (2017) - 2010
- [i1]Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich:
The Gelfand widths of ℓp-balls for 0<p≤1. CoRR abs/1002.0672 (2010)
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 2025-07-02 19:12 CEST 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:
