Dagstuhl Seminar Proceedings: Challenges in Symbolic Computation Software 2006

• Joris van der Hoeven:
  GNU TeXmacs.
  
• John Abbott:
  Challenges in Computational Commutative Algebra.
  
• Thomas J. Ashby, Anthony D. Kennedy, Stephen M. Watt:
  Coxeter Lattice Paths.
  
• Jean-Guillaume Dumas, Clément Pernet, Jean-Louis Roch:
  Adaptive Triangular System Solving.
  
• Anne Frühbis-Krüger:
  Computational Aspects of the Resolution of Singularities.
  
• Xiao-Shan Gao, Mingbo Zhang:
  Decomposition of Differential Polynomials.
  
• George Labahn, Scott MacLean, Mirette S. Marzouk, Ian Rutherford, David Tausky:
  MathBrush: An Experimental Pen-Based Math System.
  
• Santiago Laplagne:
  Computation of the Minimal Associated Primes.
  
• Mark Giesbrecht, George Labahn, Wen-shin Lee:
  Probabilistically Stable Numerical Sparse Polynomial Interpolation.
  
• Arne Storjohann:
  Notes on computing minimal approximant bases.
  
• Wolfram Decker, Mike Dewar, Erich Kaltofen, Stephen M. Watt:
  06271 Executive Summary - Challenges in Symbolic Computation Software.
  
• Éric Schost, Alin Bostan, Claude-Pierre Jeannerod:
  Using fast matrix multiplication to solve structured linear systems.
  
• Stephen M. Watt:
  Pivot-Free Block Matrix Inversion.
  
• Wolfram Decker, Mike Dewar, Erich Kaltofen, Stephen M. Watt:
  06271 Abstracts Collection -- Challenges in Symbolic Computation Software.
  
• Stephen M. Watt:
  Two Families of Algorithms for Symbolic Polynomials.
  
• Marc Moreno Maza, Oleg Golubitsky, Marina V. Kondratieva, Alexey Ovchinnikov:
  Bounds and algebraic algorithms in differential algebra: the ordinary case.
  

Last update Wed May 22 20:22:51 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page