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
Felipe Cucker, Pascal Koiran, Steve Smale: A Polynomial Time Algorithm for Diophantine Equations in One Variable. 21-29
William W. Adams, Serkan Hosten, Philippe Loustaunau, J. Lyn Miller: SAGBI and SAGBI-Gröbner Bases over Principal Ideal Domains. 31-47
R. C. Churchill, M. Kummer: A Unified Approach to Linear and Nonlinear Normal Forms for Hamiltonian Systems. 49-131

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
Jörn Müller-Quade, Rainer Steinwandt: Basic Algorithms for Rational Function Fields. 143-170
Gregor Kemper: An Algorithm to Calculate Optimal Homogeneous Systems of Parameters. 171-184
Marco Bellia, M. Eugenia Occhiuto: Lazy Linear Combinatorial Unification. 185-206
Piotr Krysta, Leszek Pacholski: The STO problem is NP-complete. 207-219
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

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

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

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

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