ISSAC 2004: Santander, Spain

• Pablo A. Parrilo:
  Sums of squares of polynomials and their applications. 1
  
• Francisco Santos:
  Triangulations of polytopes and algebraic geometry. 2
  
• Jan Verschelde:
  Numerical algebraic geometry and symbolic computation. 3
  
• Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder:
  Factoring polynomials via polytopes. 4-11
  
• D. A. Aruliah, Robert M. Corless:
  Numerical parameterization of affine varieties using. 12-18
  
• Thomas Bayer:
  Optimal descriptions of orbit spaces and strata of finite groups. 19-26
  
• James C. Beaumont, Russell J. Bradford, James H. Davenport, Nalina Phisanbut:
  A poly-algorithmic approach to simplifying elementary functions. 27-34
  
• Gábor Bodnár:
  Efficient desingularization of reducible algebraic sets. 35-41
  
• Alin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, B. Wiebelt:
  Complexity issues in bivariate polynomial factorization. 42-49
  
• Josep M. Brunat, Antonio Montes:
  The characteristic ideal of a finite, connected, regular graph. 50-57
  
• Reinhold Burger, George Labahn, Mark van Hoeij:
  Closed form solutions of linear odes having elliptic function coefficients. 58-64
  
• Laurent Busé, Carlos D'Andrea:
  Inversion of parameterized hypersurfaces by means of subresultants. 65-71
  
• Jacques Carette:
  Understanding expression simplification. 72-79
  
• L. Chan, E. S. Cheb-Terrab:
  Non-liouvillian solutions for second order Linear ODEs. 80-86
  
• Guillaume Chèze:
  Absolute polynomial factorization in two variables and the knapsack problem. 87-94
  
• Arthur D. Chtcherba, Deepak Kapur:
  Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system. 95-102
  
• Xavier Dahan, Éric Schost:
  Sharp estimates for triangular sets. 103-110
  
• Andreas Dolzmann, Andreas Seidl, Thomas Sturm:
  Efficient projection orders for CAD. 111-118
  
• Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet:
  FFPACK: finite field linear algebra package. 119-126
  
• Wayne Eberly:
  Reliable Krylov-based algorithms for matrix null space and rank. 127-134
  
• Hassan El Houari, M'hammed El Kahoui:
  Algorithms for recognizing coordinates in two variables over UFD's. 135-140
  
• Mohamed Elkadi, André Galligo, Thi Ha Lê:
  Parametrized surfaces in huge P³ of bidegree(1,2). 141-148
  
• Nicholas Eriksson:
  Toric ideals of homogeneous phylogenetic models. 149-154
  
• Ruyong Feng, Xiao-Shan Gao:
  Rational general solutions of algebraic ordinary differential equations. 155-162
  
• Gudmund Skovbjerg Frandsen, Igor Shparlinski:
  On reducing a system of equations to a single equation. 163-166
  
• Shuhong Gao, Erich Kaltofen, John May, Zhengfeng Yang, Lihong Zhi:
  Approximate factorization of multivariate polynomials via differential equations. 167-174
  
• Xiao-Shan Gao, Mingbo Zhang:
  Decomposition of differential polynomials with constant coefficients. 175-182
  
• Keith O. Geddes, Ha Q. Le, Ziming Li:
  Differential rational normal forms and a reduction algorithm for hyperexponential func. 183-190
  
• Evelyne Hubert:
  Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases. 191-198
  
• Manuel Kauers:
  Computer proofs for polynomial identities in arbitrary many variables. 199-204
  
• Amit Khetan, Ning Song, Ron Goldman:
  Sylvester-resultants for bivariate polynomials with planar newton polygons. 205-212
  
• George Labahn, Ziming Li:
  Hyperexponential solutions of finite-rank ideals in orthogonal ore rings. 213-220
  
• Hongbo Li:
  Symbolic computation in the homogeneous geometric model with clifford algebra. 221-228
  
• Steve Linton:
  Finding the smallest image of a set. 229-234
  
• R. Alexander Milowski:
  Computing irredundant irreducible decompositions of large scale monomial ideals. 235-242
  
• Michael B. Monagan:
  Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction. 243-249
  
• David Orden, Francisco Santos:
  The polytope of non-crossing graphs on a planar point set. 250-257
  
• Tomás Recio, J. Rafael Sendra, Carlos Villarino:
  From hypercircles to units. 258-265
  
• Enric Rodríguez-Carbonell, Deepak Kapur:
  Automatic generation of polynomial loop. 266-273
  
• B. David Saunders, Zhendong Wan:
  Smith normal form of dense integer matrices fast algorithms into practice. 274-281
  
• Carsten Schneider:
  Symbolic summation with single-nested sum extensions. 282-289
  
• Joris van der Hoeven:
  The truncated fourier transform and applications. 290-296
  
• Mark van Hoeij, Michael B. Monagan:
  Algorithms for polynomial GCD computation over algebraic function fields. 297-304
  
• Michael Yang, Richard J. Fateman:
  Extracting mathematical expressions from postscript documents. 305-311
  
• Kazuhiro Yokoyama:
  On systems of algebraic equations with parametric exponents. 312-319
  
• Zhonggang Zeng, Barry H. Dayton:
  The approximate GCD of inexact polynomials. 320-327
  

Last update Tue Feb 14 04:06:03 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page