<h2>Dagstuhl Seminar Proceedings, Volume 6021, </h2> <ul> <li> <span class="authors">Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, and Nathalie Revol</span> <span class="title">06021 Abstracts Collection – Reliable Implementation of Real Number Algorithms: Theory and Practice</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06021.1">10.4230/DagSemProc.06021.1</a> </li> <li> <span class="authors">Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, and Nathalie Revol</span> <span class="title">06021 Summary – Reliable Implementation of Real Number Algorithms: Theory and Practice</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06021.2">10.4230/DagSemProc.06021.2</a> </li> <li> <span class="authors">Kurt Mehlhorn, Arno Eigenwillig, Lutz Kettner, Werner Krandick, Susanne Schmitt, and Nicola Wolpert</span> <span class="title">A Descartes Algorithms for Polynomials with Bit-Stream Coefficients</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06021.3">10.4230/DagSemProc.06021.3</a> </li> <li> <span class="authors">Sylvain Pion, Hervé Brönnimann, and Guillaume Melquiond</span> <span class="title">A Proposal to add Interval Arithmetic to the C++ Standard Library</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06021.4">10.4230/DagSemProc.06021.4</a> </li> <li> <span class="authors">Thomas J. Peters and Edward L. F. Moore</span> <span class="title">Floating Point Geometric Algorithms for Topologically Correct Scientific Visualization</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06021.5">10.4230/DagSemProc.06021.5</a> </li> <li> <span class="authors">Branimir Lambov</span> <span class="title">Interval Arithmetic Using SSE-2</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06021.6">10.4230/DagSemProc.06021.6</a> </li> <li> <span class="authors">George F. Corliss, R. Baker Kearfott, Ned Nedialkov, John D. Pryce, and Spencer Smith</span> <span class="title">Interval Subroutine Library Mission</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06021.7">10.4230/DagSemProc.06021.7</a> </li> <li> <span class="authors">Dominique Michelucci, Jean Michel Moreau, and Sebti Foufou</span> <span class="title">Robustness and Randomness</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06021.8">10.4230/DagSemProc.06021.8</a> </li> <li> <span class="authors">Neil Stewart and Malika Zidani</span> <span class="title">Transfinite interpolation for well-definition in error analysis in solid modelling</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06021.9">10.4230/DagSemProc.06021.9</a> </li> <li> <span class="authors">Margarita Korovina and Nicolai Vorobjov</span> <span class="title">Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06021.10">10.4230/DagSemProc.06021.10</a> </li> <li> <span class="authors">Vincent Lefèvre, Damien Stehlé, and Paul Zimmermann</span> <span class="title">Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.06021.11">10.4230/DagSemProc.06021.11</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
Feedback for Dagstuhl Publishing