Journal of Symbolic Computation, Volume 27, 1999

Volume 27, Number 1, January 1999

• Derek F. Holt, D. F. Hurt: Computing Automatic Coset Systems and Subgroup Presentations. 1-19 BibTeX
• Felipe Cucker, Pascal Koiran, Steve Smale: A Polynomial Time Algorithm for Diophantine Equations in One Variable. 21-29 BibTeX
• William W. Adams, Serkan Hosten, Philippe Loustaunau, J. Lyn Miller: SAGBI and SAGBI-Gröbner Bases over Principal Ideal Domains. 31-47 BibTeX
• R. C. Churchill, M. Kummer: A Unified Approach to Linear and Nonlinear Normal Forms for Hamiltonian Systems. 49-131 BibTeX

Volume 27, Number 2, February 1999

• Susan M. Hermiller, X. H. Kramer, Reinhard C. Laubenbacher: Monomial Orderings, Rewriting Systems, and Gröbner Bases for the Commutator Ideal of a Free Algebra. 133-141 BibTeX
• Jörn Müller-Quade, Rainer Steinwandt: Basic Algorithms for Rational Function Fields. 143-170 BibTeX
• Gregor Kemper: An Algorithm to Calculate Optimal Homogeneous Systems of Parameters. 171-184 BibTeX
• Marco Bellia, M. Eugenia Occhiuto: Lazy Linear Combinatorial Unification. 185-206 BibTeX
• Piotr Krysta, Leszek Pacholski: The STO problem is NP-complete. 207-219 BibTeX
• Thomas Wolf, A. Brand, M. Mohammadzadeh: Computer Algebra Algorithms and Routines for the Computation of Conservation Laws and Fixing of Gauge in Differential Expressions. 221-238 BibTeX

Volume 27, Number 3, March 1999

• P. A. Hendricks, Michael F. Singer: Solving Difference Equations in Finite Terms. 239-259 BibTeX
• Jürgen Klüners: On Polynomial Decompositions. 261-269 BibTeX
• Jürgen Avenhaus, Klaus Becker: A Framework for Operational Equational Specifications with Pre-defined Structures. 271-310 BibTeX
• Fokko du Cloux: A Transducer Approach to Coxeter Groups. 311-324 BibTeX
• Graham H. Norton: On Shortest Linear Recurrences. 325-349 BibTeX

Volume 27, Number 4, April 1999

• Anna Maria Bigatti, Roberto La Scala, Lorenzo Robbiano: Computing Toric Ideals. 351-365 BibTeX
• Scott McCallum: Factors of Iterated Resultants and Discriminants. 367-385 BibTeX
• Hans Ulrich Besche, Bettina Eick: Construction of Finite Groups. 387-404 BibTeX
• Hans Ulrich Besche, Bettina Eick: The Groups of Order at Most 1000 Except 512 and 768. 405-413 BibTeX
• Alexander Hulpke: Computing Subgroups Invariant Under a Set of Automorphisms. 415-427 BibTeX
• Eric Bach: Sheaf Cohomology is #P-hard. 429-433 BibTeX

Volume 27, Number 5, May 1999

• Karel Stokkermans: A Categorical Critical-pair Completion Algorithm. 435-477 BibTeX
• Jiang Qian Ying, Li Xu, Zhiping Lin: A Computational Method for Determining Strong Stabilizability of n-D Systems. 479-499 BibTeX
• E. S. Cheb-Terrab, A. D. Roche: Integrating Factors for Second-order ODEs. 501-519 BibTeX

Volume 27, Number 6, June 1999

• Edlyn Teske: The Pohlig-Hellman Method Generalized for Group Structure Computation. 521-534 BibTeX
• Ronald de Man: The Generating Function for the Number of Roots of a Coxeter Group. 535-541 BibTeX
• Bruno Salvy, John Shackell: Symbolic Asymptotics: Multiseries of Inverse Functions. 543-563 BibTeX
• Nicolai Vorobjov: Complexity of Computing the Local Dimension of a Semialgebraic Set. 565-579 BibTeX
• David John Broadhurst, D. Kreimer: Renormalization Automated by Hopf Algebra. 581-600 BibTeX