The SCEAS System
Navigation Menu

Conferences in DBLP

International Symposium on Symbolic and Algebraic Computation (ISSAC) (issac)
2004 (conf/issac/2004)

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