Journals in DBLP

J. Symb. Comput.
2002, volume: 33, number: 5

1. Gilles Villard
   Preface. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2002, v:33, n:5, pp:519- [Journal]
   
2. Sergei A. Abramov, Marko Petkovsek
   Rational Normal Forms and Minimal Decompositions of Hypergeometric Terms. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2002, v:33, n:5, pp:521-543 [Journal]
   
3. Jaime Gutierrez, Rosario Rubio, David Sevilla
   On Multivariate Rational Function Decomposition. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2002, v:33, n:5, pp:545-562 [Journal]
   
4. Gene Cooperman, Victor Grinberg
   Scalable Parallel Coset Enumeration: Bulk Definition and the Memory Wall. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2002, v:33, n:5, pp:563-585 [Journal]
   
5. Carlos D'Andrea, Ioannis Z. Emiris
   Hybrid Sparse Resultant Matrices for Bivariate Polynomials. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2002, v:33, n:5, pp:587-608 [Journal]
   
6. Elisabetta Fortuna, Patrizia M. Gianni, Barry M. Trager
   Derivations and Radicals of Polynomial Ideals over Fields of Arbitrary Characteristic. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2002, v:33, n:5, pp:609-625 [Journal]
   
7. Steven Fortune
   An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2002, v:33, n:5, pp:627-646 [Journal]
   
8. Mikhail V. Foursov, Marc Moreno Maza
   On Computer-assisted Classification of Coupled Integrable Equations. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2002, v:33, n:5, pp:647-660 [Journal]
   
9. André Galligo, David Rupprecht
   Irreducible Decomposition of Curves. [Citation Graph (0, 0)][DBLP]
   J. Symb. Comput., 2002, v:33, n:5, pp:661-677 [Journal]
   
10. Bernard Mourrain, Olivier Ruatta
    Relations Between Roots and Coefficients, Interpolation and Application to System Solving. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2002, v:33, n:5, pp:679-699 [Journal]
    
11. Victor Y. Pan
    Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2002, v:33, n:5, pp:701-733 [Journal]
    
12. Alexandre Sedoglavic
    A Probabilistic Algorithm to Test Local Algebraic Observability in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2002, v:33, n:5, pp:735-755 [Journal]
    
13. Emmanuel Thomé
    Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2002, v:33, n:5, pp:757-775 [Journal]