HTML Export for Dagstuhl Seminar Proceedings, Volume 6271

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 6271, </h2>
<ul>
<li>
    <span class="authors">Wolfram Decker, Mike Dewar, Erich Kaltofen, and Stephen M. Watt</span>
    <span class="title">06271 Abstracts Collection – Challenges in Symbolic Computation Software</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.1">10.4230/DagSemProc.06271.1</a>
</li>
<li>
    <span class="authors">Wolfram Decker, Mike Dewar, Erich Kaltofen, and Stephen M. Watt</span>
    <span class="title">06271 Executive Summary - Challenges in Symbolic Computation Software</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.2">10.4230/DagSemProc.06271.2</a>
</li>
<li>
    <span class="authors">Jean-Guillaume Dumas, Clément Pernet, and Jean-Louis Roch</span>
    <span class="title">Adaptive Triangular System Solving</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.3">10.4230/DagSemProc.06271.3</a>
</li>
<li>
    <span class="authors">Marc Moreno Maza, Oleg Golubitsky, Marina V. Kondratieva, and Alexey Ovchinnikov</span>
    <span class="title">Bounds and algebraic algorithms in differential algebra: the ordinary case</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.4">10.4230/DagSemProc.06271.4</a>
</li>
<li>
    <span class="authors">John Abbott</span>
    <span class="title">Challenges in Computational Commutative Algebra</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.5">10.4230/DagSemProc.06271.5</a>
</li>
<li>
    <span class="authors">Santiago Laplagne</span>
    <span class="title">Computation of the Minimal Associated Primes</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.6">10.4230/DagSemProc.06271.6</a>
</li>
<li>
    <span class="authors">Anne Frühbis-Krüger</span>
    <span class="title">Computational Aspects of the Resolution of Singularities</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.7">10.4230/DagSemProc.06271.7</a>
</li>
<li>
    <span class="authors">Thomas J. Ashby, Anthony D. Kennedy, and Stephen M. Watt</span>
    <span class="title">Coxeter Lattice Paths</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.8">10.4230/DagSemProc.06271.8</a>
</li>
<li>
    <span class="authors">Xiao-Shan Gao and Mingbo Zhang</span>
    <span class="title">Decomposition of Differential Polynomials</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.9">10.4230/DagSemProc.06271.9</a>
</li>
<li>
    <span class="authors">Joris van der Hoeven</span>
    <span class="title">GNU TeXmacs</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.10">10.4230/DagSemProc.06271.10</a>
</li>
<li>
    <span class="authors">George Labahn, Scott MacLean,  Marzouk Mirette, Ian Rutherford, and David Tausky</span>
    <span class="title">MathBrush: An Experimental Pen-Based Math System</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.11">10.4230/DagSemProc.06271.11</a>
</li>
<li>
    <span class="authors">Arne Storjohann</span>
    <span class="title">Notes on computing minimal approximant bases</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.12">10.4230/DagSemProc.06271.12</a>
</li>
<li>
    <span class="authors">Stephen M. Watt</span>
    <span class="title">Pivot-Free Block Matrix Inversion</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.13">10.4230/DagSemProc.06271.13</a>
</li>
<li>
    <span class="authors">Mark Giesbrecht, George Labahn, and Wen-Shin Lee</span>
    <span class="title">Probabilistically Stable Numerical Sparse Polynomial Interpolation</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.14">10.4230/DagSemProc.06271.14</a>
</li>
<li>
    <span class="authors">Stephen M. Watt</span>
    <span class="title">Two Families of Algorithms for Symbolic Polynomials</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.15">10.4230/DagSemProc.06271.15</a>
</li>
<li>
    <span class="authors">Eric Schost, Alin Bostan, and Claude-Pierre Jeannerod</span>
    <span class="title">Using fast matrix multiplication to solve structured linear systems</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06271.16">10.4230/DagSemProc.06271.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