![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "Glenn Byrenheid"
@article{DBLP:journals/fams/ByrenheidSU23, author = {Glenn Byrenheid and Serhii A. Stasyuk and Tino Ullrich}, title = {Lp-Sampling recovery for non-compact subclasses of L{\(\infty\)}}, journal = {Frontiers Appl. Math. Stat.}, volume = {9}, year = {2023}, url = {https://doi.org/10.3389/fams.2023.1216331}, doi = {10.3389/FAMS.2023.1216331}, timestamp = {Fri, 15 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/fams/ByrenheidSU23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2203-10011, author = {Glenn Byrenheid and Janina H{\"{u}}bner and Markus Weimar}, title = {Rate-optimal sparse approximation of compact break-of-scale embeddings}, journal = {CoRR}, volume = {abs/2203.10011}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2203.10011}, doi = {10.48550/ARXIV.2203.10011}, eprinttype = {arXiv}, eprint = {2203.10011}, timestamp = {Mon, 28 Mar 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2203-10011.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2210-01704, author = {Glenn Byrenheid and Serhii A. Stasyuk and Tino Ullrich}, title = {L\({}_{\mbox{p}}\)-Sampling recovery for non-compact subclasses of L\({}_{\mbox{{\(\infty\)}}}\)}, journal = {CoRR}, volume = {abs/2210.01704}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2210.01704}, doi = {10.48550/ARXIV.2210.01704}, eprinttype = {arXiv}, eprint = {2210.01704}, timestamp = {Fri, 07 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2210-01704.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jc/ByrenheidKN18, author = {Glenn Byrenheid and Robert J. Kunsch and Van Kien Nguyen}, title = {Monte Carlo methods for uniform approximation on periodic Sobolev spaces with mixed smoothness}, journal = {J. Complex.}, volume = {46}, pages = {90--102}, year = {2018}, url = {https://doi.org/10.1016/j.jco.2017.12.002}, doi = {10.1016/J.JCO.2017.12.002}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jc/ByrenheidKN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/nm/ByrenheidKUV17, author = {Glenn Byrenheid and Lutz K{\"{a}}mmerer and Tino Ullrich and Toni Volkmer}, title = {Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness}, journal = {Numerische Mathematik}, volume = {136}, number = {4}, pages = {993--1034}, year = {2017}, url = {https://doi.org/10.1007/s00211-016-0861-7}, doi = {10.1007/S00211-016-0861-7}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/nm/ByrenheidKUV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jat/ByrenheidDSU16, author = {Glenn Byrenheid and Dinh Dung and Winfried Sickel and Tino Ullrich}, title = {Sampling on energy-norm based sparse grids for the optimal recovery of Sobolev type functions in H\({}^{\mbox{{\(\gamma\)}}}\)}, journal = {J. Approx. Theory}, volume = {207}, pages = {207--231}, year = {2016}, url = {https://doi.org/10.1016/j.jat.2016.02.012}, doi = {10.1016/J.JAT.2016.02.012}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jat/ByrenheidDSU16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.