Published in: Dagstuhl Reports, Volume 13, Issue 8 (2024)
Dmitriy Bilyk, Michael Gnewuch, Jan Vybíral, Larisa Yaroslavtseva, and Kumar Harsha. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351). In Dagstuhl Reports, Volume 13, Issue 8, pp. 106-128, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{bilyk_et_al:DagRep.13.8.106, author = {Bilyk, Dmitriy and Gnewuch, Michael and Vyb{\'\i}ral, Jan and Yaroslavtseva, Larisa and Harsha, Kumar}, title = {{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351)}}, pages = {106--128}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2024}, volume = {13}, number = {8}, editor = {Bilyk, Dmitriy and Gnewuch, Michael and Vyb{\'\i}ral, Jan and Yaroslavtseva, Larisa and Harsha, Kumar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.8.106}, URN = {urn:nbn:de:0030-drops-198152}, doi = {10.4230/DagRep.13.8.106}, annote = {Keywords: computational stochastics, infinite-variate problems, quasi-\{M\}onte \{C\}arlo, sampling, tractability analysis} }
Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Michael Gnewuch. Discrepancy Bounds for Mixed Sequences. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gnewuch:DagSemProc.09391.2, author = {Gnewuch, Michael}, title = {{Discrepancy Bounds for Mixed Sequences}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.2}, URN = {urn:nbn:de:0030-drops-22975}, doi = {10.4230/DagSemProc.09391.2}, annote = {Keywords: Star Discrepancy, Mixed Sequence, Hybrid Method, Monte Carlo, Quasi-Monte Carlo, Probabilistic Bounds} }
Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Michael Gnewuch. Weighted L_2 B Discrepancy and Approximation of Integrals over Reproducing Kernel Hilbert Spaces. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gnewuch:DagSemProc.09391.5, author = {Gnewuch, Michael}, title = {{Weighted L\underline2 B Discrepancy and Approximation of Integrals over Reproducing Kernel Hilbert Spaces}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.5}, URN = {urn:nbn:de:0030-drops-22966}, doi = {10.4230/DagSemProc.09391.5}, annote = {Keywords: Discrepancy, Numerical Integration, Quasi-Monte Carlo, Reproducing Kernel Hilbert Space} }
Feedback for Dagstuhl Publishing