Journal of Symbolic Computation, Volume 35, 2003

Volume 35, Number 1, January 2003

• Publisher's Note. 1-2
  
• Paolo Aluffi:
  Computing characteristic classes of projective schemes. 3-19
  
• Hans de Nivelle, Maarten de Rijke:
  Deciding the guarded fragments by resolution. 21-58
  
• Ronald Brown, Christopher D. Wensley:
  Computation and homotopical applications of induced crossed modules. 59-72
  

Volume 35, Number 2, February 2003

• Miroslav N. Velev, Randal E. Bryant:
  Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. 73-106
  
• M. R. Bush, M. Leeming, Robert F. C. Walters:
  Computing left Kan extensions. 107-126
  
• Michael W. Fleming, Ryan Gunther, Robert D. Rosebrugh:
  A database of categories. 127-135
  
• Susan B. Niefield:
  Implementing finite structures in Mathematica via a skeletal topos of finite sets. 137-151
  
• Jinwang Liu, Zhuojun Liu, Mingsheng Wang:
  The term orderings which are compatible with composition II. 153-168
  
• Serge Burckel:
  A result on braids via the investigation of a rewriting system. 169-175
  
• Teo Mora, Massimiliano Sala:
  On the Gröbner bases of some symmetric systems and their application to coding theory. 177-194
  
• Peter A. Brooksbank:
  Constructive recognition of classical groups in their natural representation. 195-239
  

Volume 35, Number 3, March 2003

• John J. Cannon, Derek F. Holt:
  Automorphism group computation and isomorphism testing in finite groups. 241-267
  
• Rosemary Baines, Peter Vámos:
  An algorithm to compute the set of characteristics of a system of polynomial equations over the integers. 269-279
  
• M'hammed El Kahoui:
  An elementary approach to subresultants theory. 281-292
  
• Bao-Yin Zhang:
  A new elementary algorithm for proving q-hypergeometric identities. 293-303
  
• Wolfgang Schreiner, Christian Mittermaier, Karoly Bosa:
  Distributed Maple: parallel computer algebra in networked environments. 305-347
  
• Axel Riese:
  qMultiSum--a package for proving q-hypergeometric multiple summation identities. 349-376
  

Volume 35, Number 4, April 2003

• Thom Mulders, Arne Storjohann:
  On lattice reduction for polynomial matrices. 377-401
  
• Elizabeth A. Arnold:
  Modular algorithms for computing Gröbner bases. 403-419
  
• Colva M. Roney-Dougal, William R. Unger:
  The affine primitive permutation groups of degree less than 1000. 421-439
  
• Thomas Bayer:
  An algorithm for computing invariants of linear actions of algebraic groups up to a given degree. 441-449
  
• John B. Little, David Ortiz, Ricardo Ortiz-Rosado, Rebecca Pablo, Karen Ríos-Soto:
  Some remarks on Fitzpatrick and Flynn's Gröbner basis technique for Padé approximation. 451-461
  

Volume 35, Number 5, May 2003

• Wolfram Koepf, Karin Gatermann:
  Preface to Computer algebra and computer analysis. 463-464
  
• Amparo Gil, Javier Segura:
  A combined symbolic and numerical algorithm for the computation of zeros of orthogonal polynomials and special functions. 465-485
  
• François Lemaire:
  An orderly linear PDE system with analytic initial conditions with a non-analytic solution. 487-498
  
• Thomas Wolf:
  The integration of systems of linear PDEs using conservation laws of syzygies. 499-526
  
• Uli Walther:
  Cohomology, stratifications and parametric Gröbner bases in characteristic zero. 527-542
  
• Karin Gatermann:
  Applications of SAGBI-bases in dynamics. 543-575
  
• Abdul Salam Jarrah, Reinhard C. Laubenbacher, Valery G. Romanovski:
  The Sibirsky component of the center variety of polynomial differential systems. 577-589
  
• Pei Yu, Yuan Yuan:
  A matching pursuit technique for computing the simplest normal forms of vector fields. 591-615
  
• A. Jacquemard, Marcio Teixeira:
  Computer analysis of periodic orbits of discontinuous vector fields. 617-636
  

Volume 35, Number 6, June 2003

• Maurice Mignotte, Doru Stefanescu:
  Linear recurrent sequences and polynomial roots. 637-649
  
• Marc Rybowicz:
  On the normalization of numbers and functions defined by radicals. 651-672
  
• Aurora Olivieri, Ángel del Río:
  An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra. 673-687
  
• Alain Lascoux, Piotr Pragacz:
  Double Sylvester sums for subresultants and multi-Schur functions. 689-710
  

Last update Sat May 18 20:43:45 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page