HTML Export for Dagstuhl Seminar Proceedings, Volume 4401

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 4401, </h2>
<ul>
<li>
    <span class="authors">Thomas Müller-Gronbach, Erich Novak, Knut Petras, and Joseph F. Traub</span>
    <span class="title">04401 Abstracts Collection – Algorithms and Complexity for Continuous</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.1">10.4230/DagSemProc.04401.1</a>
</li>
<li>
    <span class="authors">Thomas Müller-Gronbach, Erich Novak, Knut Petras, and Joseph F. Traub</span>
    <span class="title">04401 Summary – Algorithms and Complexity for Continuous Problems</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.2">10.4230/DagSemProc.04401.2</a>
</li>
<li>
    <span class="authors">Dirk Nuyens and Ronald Cools</span>
    <span class="title">Fast Component-By-Component Construction of Rank-1 Lattice Rules for (Non-)Primes (Part II)</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.3">10.4230/DagSemProc.04401.3</a>
</li>
<li>
    <span class="authors">Harald Luschgy and Gilles Pagès</span>
    <span class="title">Functional Quantization and Entropy for Stochastic Processes</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.4">10.4230/DagSemProc.04401.4</a>
</li>
<li>
    <span class="authors">Leszek Plaskota</span>
    <span class="title">Information-Based Nonlinear Approximation: An Average Case Setting</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.5">10.4230/DagSemProc.04401.5</a>
</li>
<li>
    <span class="authors">Klaus Ritter and Thomas Müller-Gronbach</span>
    <span class="title">Lower Bounds and Non-Uniform Time Discretization for Approximation of Stochastic Heat Equations</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.6">10.4230/DagSemProc.04401.6</a>
</li>
<li>
    <span class="authors">Nina Golyandina</span>
    <span class="title">Monte Carlo solution for the Poisson equation on the base of spherical processes with shifted centres</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.7">10.4230/DagSemProc.04401.7</a>
</li>
<li>
    <span class="authors">Erika Hausenblas</span>
    <span class="title">Numerical Approximation of Parabolic Stochastic Partial Differential Equations</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.8">10.4230/DagSemProc.04401.8</a>
</li>
<li>
    <span class="authors">Klaus Meer and Gregorio Malajovich</span>
    <span class="title">On the Complexity of Computing Multi-Homogeneous Bézout Numbers</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.9">10.4230/DagSemProc.04401.9</a>
</li>
<li>
    <span class="authors">Knut Petras and Klaus Ritter</span>
    <span class="title">On the Complexity of Parabolic Initial Value Problems with Variable Drift</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.10">10.4230/DagSemProc.04401.10</a>
</li>
<li>
    <span class="authors">Matthias U. Horn</span>
    <span class="title">Optimal algorithms for global optimization in case of unknown Lipschitz constant</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.11">10.4230/DagSemProc.04401.11</a>
</li>
<li>
    <span class="authors">Erich Novak, Stephan Dahlke, and Winfried Sickel</span>
    <span class="title">Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.12">10.4230/DagSemProc.04401.12</a>
</li>
<li>
    <span class="authors">Stephan Dahlke, Erich Novak, and Winfried Sickel</span>
    <span class="title">Optimal Approximation of Elliptic Problems II: Wavelet Methods</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.13">10.4230/DagSemProc.04401.13</a>
</li>
<li>
    <span class="authors">Gregorz W. Wasilkowski and Henryk Wozniakowski</span>
    <span class="title">Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.14">10.4230/DagSemProc.04401.14</a>
</li>
<li>
    <span class="authors">Siegfried Graf and Harald Luschgy</span>
    <span class="title">Quantization of self-similar Probabilities</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.15">10.4230/DagSemProc.04401.15</a>
</li>
<li>
    <span class="authors">Norbert Hofmann</span>
    <span class="title">Upper Error Bounds for Approximations of Stochastic Differential Equations with Markovian Switching</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.04401.16">10.4230/DagSemProc.04401.16</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode