Journal of Symbolic Computation, Volume 32, 2001

Volume 32, Number 1/2, July/August 2001

• Tomás Recio, Manfred Kerber:
  Computer Algebra and Mechanized Reasoning: Selected St. Andrews' ISSAC/Calculemus 2000 Contributions - Foreword from the Editors. 1-2
  
• Henk Barendregt, Arjeh M. Cohen:
  Electronic Communication of Mathematics and the Interaction of Computer Algebra Systems and Proof Assistants. 3-22
  
• Franz Binder, Peter Mayr:
  Algorithms for Finite Near-rings and their N-groups. 23-38
  
• Gábor Bodnár, Josef Schicho:
  Two Computational Techniques for Singularity Resolution. 39-54
  
• Olga Caprotti, Martijn Oostdijk:
  Formal and Efficient Primality Proofs by Use of Computer Algebra Oracles. 55-70
  
• Jean-Guillaume Dumas, B. David Saunders, Gilles Villard:
  On Efficient Sparse Integer Matrix Smith Normal Form Computations. 71-99
  
• Edward L. Green, Lenwood S. Heath, Craig A. Struble:
  Constructing Homomorphism Spaces and Endomorphism Rings. 101-117
  
• Günter Landsmann, Josef Schicho, Franz Winkler:
  The Parametrization of Canal Surfaces and the Decomposition of Polynomials into a Sum of Two Squares. 119-132
  
• Izumi Miyamoto:
  Computing Isomorphisms of Association Schemes and its Application. 133-141
  
• Piotr Rudnicki, Christoph Schwarzweller, Andrzej Trybulec:
  Commutative Algebra in the Mizar System. 143-169
  

Volume 32, Number 3, September 2001

• Leonard M. Adleman, Ming-Deh A. Huang:
  Counting Points on Curves and Abelian Varieties Over Finite Fields. 171-189
  
• Gema M. Diaz-Toca, Laureano González-Vega:
  Squarefree Decomposition of Univariate Polynomials Depending on a Parameter. Application to the Integration of Parametric Rational Functions. 191-209
  
• Emmanuel Hallouin:
  Computing Local Integral Closures. 211-230
  
• Gerardo Lafferriere, George J. Pappas, Sergio Yovine:
  Symbolic Reachability Computation for Families of Linear Vector Fields. 231-253
  
• Edward S. Letzter:
  Constructing Irreducible Representations of Finitely Presented Algebras. 255-262
  
• Ryutaroh Matsumoto:
  Computing the Radical of an Ideal in Positive Characteristic. 263-271
  
• A. J. E. Ryba:
  Condensation of Symmetrized Tensor Powers. 273-289
  
• Alfred Widiger:
  Solving the Word Problem for Two Classes of Non-associative Rings by Rewriting. 291-301
  

Volume 32, Number 4, September 2001

• Alessandro Armando, Tudor Jebelean:
  Special Issue on Calculemus-99: Integrating Computation and Deduction - Foreword of the Guest Editors. 303-304
  
• Alessandro Armando, Alessandro Coglio, Fausto Giunchiglia, Silvio Ranise:
  The Control Layer in Open Mechanized Reasoning Systems: Annotations and Tactics. 305-332
  
• Michael Beeson:
  Automatic Derivation of the Irrationality of e. 333-349
  
• Olga Caprotti, Arjeh M. Cohen:
  On the Role of OpenMath in Interactive Mathematical Documents. 351-364
  
• Michael Kohlhase, Andreas Franke:
  MBase: Representing Knowledge and Context for the Integration of Mathematical Software Systems. 365-402
  
• Sorin Stratulat:
  A General Framework to Build Contextual Cover Set Induction Provers. 403-445
  

Volume 32, Number 5, November 2001

• Christopher W. Brown:
  Improved Projection for Cylindrical Algebraic Decomposition. 447-465
  
• George E. Collins:
  Polynomial Minimum Root Separation. 467-473
  
• Willem A. de Graaf:
  Computing with Quantized Enveloping Algebras: PBW-Type Bases, Highest-Weight Modules and R-Matrices. 475-490
  
• Peter Dräxler:
  Normal Forms for Representations of Representation-finite Algebras. 491-497
  
• Burkhard Höfling:
  Computing Projectors, Injectors, Residuals and Radicals of Finite Soluble Groups. 499-511
  
• H. Michael Möller, Ralf Tenberg:
  Multivariate Polynomial System Solving Using Intersections of Eigenspaces. 513-531
  
• Sebastian Pauli:
  Factoring Polynomials Over Local Fields. 533-547
  
• Mathias Schulze:
  Algorithms for the Gauss-Manin Connection. 549-564
  

Volume 32, Number 6, December 2001

• F. J. Castro-Jiménez, J. Rafael Sendra:
  Special Issue on Effective Methods in Rings of Differential Operators - Foreword by the Guest Editors. 573-574
  
• Toshinori Oaku, Nobuki Takayama:
  Minimal Free Resolutions of Homogenized D-modules. 575-595
  
• Harrison Tsai, Uli Walther:
  Computing Homomorphisms Between Holonomic D-modules. 597-617
  
• Laura Felicia Matusevich:
  Rank Jumps in Codimension 2A-hypergeometric Systems. 619-641
  
• Rouchdi Bahloul:
  Algorithm for Computing Bernstein-Sato Ideals Associated with a Polynomial Mapping. 643-662
  
• Anton Leykin:
  Constructibility of the Set of Polynomials with a Fixed Bernstein-Sato Polynomial: an Algorithmic Approach. 663-675
  
• F. J. Castro-Jiménez, Jose Maria Ucha-Enríquez:
  Explicit Comparison Theorems for D-modules. 677-685
  
• P. Jara, J. Jódar:
  U_q(sl(2)) Satisfies a Bernstein Duality. 687-698
  
• Andre Hillebrand, Wiland Schmale:
  Towards an Effective Version of a Theorem of Stafford. 699-716
  
• F. Aroca, J. Cano:
  Formal Solutions of Linear PDEs and Convex Polyhedra. 717-737
  

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