HTML Export for Dagstuhl Seminar Proceedings, Volume 5391

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 5391, </h2>
<ul>
<li>
    <span class="authors">Bruno Buchberger, Shin&#039;ichi Oishi, Michael Plum, and Siegfried M. Rump</span>
    <span class="title">05391 Abstracts Collection – Algebraic and Numerical Algorithms and Computer-assisted Proofs</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05391.1">10.4230/DagSemProc.05391.1</a>
</li>
<li>
    <span class="authors">Bruno Buchberger, Christian Jansson, Shin&#039;ichi Oishi, Michael Plum, and Siegfried M. Rump</span>
    <span class="title">05391 Executive Summary – Numerical and Algebraic Algorithms and Computer-assisted Proofs</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05391.2">10.4230/DagSemProc.05391.2</a>
</li>
<li>
    <span class="authors">Philippe Langlois, Stef Graillat, and Nicolas Louvet</span>
    <span class="title">Compensated Horner Scheme</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05391.3">10.4230/DagSemProc.05391.3</a>
</li>
<li>
    <span class="authors">Borbála Fazekas, Michael Plum, and Christian Wieners</span>
    <span class="title">Enclosure for the Biharmonic Equation</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05391.4">10.4230/DagSemProc.05391.4</a>
</li>
<li>
    <span class="authors">Wolfram Luther, Gerhard Haßlinger, Ekaterina Auer, Eva Dyllong, Daniela Traczinski, and Holger Traczinski</span>
    <span class="title">Integration of reliable algorithms into modeling software</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05391.5">10.4230/DagSemProc.05391.5</a>
</li>
<li>
    <span class="authors">Christian Keil</span>
    <span class="title">Lurupa - Rigorous Error Bounds in Linear Programming</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05391.6">10.4230/DagSemProc.05391.6</a>
</li>
<li>
    <span class="authors">Christian Jansson</span>
    <span class="title">Rigorous Results in Combinatorial Optimization</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05391.7">10.4230/DagSemProc.05391.7</a>
</li>
<li>
    <span class="authors">James Demmel, Ioana Dumitriu, and Olga Holtz</span>
    <span class="title">Toward accurate polynomial evaluation in rounded arithmetic (short report)</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05391.8">10.4230/DagSemProc.05391.8</a>
</li>
<li>
    <span class="authors">Götz Alefeld and Zhengyu Wang</span>
    <span class="title">Verification of Solutions for  Almost Linear  Complementarity Problems</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.05391.9">10.4230/DagSemProc.05391.9</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