Journal of Symbolic Computation, Volume 18, 1994

Volume 18, Number 1, July 1994

Hilary A. Priestley, Martin P. Ward: A Multipurpose Backtracking Algorithm. 1-40 BibTeX
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi: Abstract Parametric Classes and Abstract Data Types defined by Classical and Constructive Logical Methods. 41-81 BibTeX
Ivo Düntsch: A Microcomputer Based System for Small Relation Algebras. 83-86 BibTeX
Craig R. Orr, Doron Zeilberger: A Computer Algebra Approach to the Discrete Dirichlet Problem. 87-90 BibTeX

Robert Cremanns, Friedrich Otto: Finite Derivation Type Implies the Homological Finiteness Condition FP_3. 91-112 BibTeX
Hélène Kirchner, Christophe Ringeissen: Combining Symbolic Constraint Solvers on Algebraic Domains. 113-155 BibTeX
Susumu Yamasaki, Kentaro Iida: Transformation of Logic Programs to FP Programs Based on Dataflows. 157-182 BibTeX

Victor Y. Pan: Simple Multivariate Polynomial Multiplication. 183-186 BibTeX
Xiangdong Wang: The Hecke Operators on S_k(Gamma_1 (N)). 187-198 BibTeX
Klaus Meer: Real Number Computations: On the Use of Information. 199-206 BibTeX
Hiroyuki Sawada, Satoshi Terasaki, Akira Aiba: Parallel Computation of Gröbner Bases on Distributed Memory Machines. 207-222 BibTeX
Toshinori Oaku, Takeshi Shimoyama: A Gröbner Basis Method for Modules over Rings of Differential Operators. 223-248 BibTeX
Dongming Wang: Differentiation and Integration of Indefinite Summations with Respect to Indexed Variables - Some Rules and Applications. 249-263 BibTeX
Mark Sofroniou: Symbolic Derivation of Runge-Kutta Methods. 265-296 BibTeX

Denis Lugiez, J. L. Moysset: Tree Automata Help One To Solve Equational Formulae In AC-Theories. 297-318 BibTeX
Irène Durand: Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems. 319-352 BibTeX
Mark van Hoeij: An Algorithm for Computing an Integral Basis in an Algebraic Function Field. 353-363 BibTeX
Michael Kalkbrener: Prime Decompositions of Radicals in Polynomial Rings. 365-372 BibTeX
Freyja Hreinsdóttir: A Case Where Choosing a Product Order Makes the Calculations of a Groebner Basis Much Faster. 373-378 BibTeX
Maurice Mignotte, Philippe H. Glesser: Landau's Inequality via Hadamard's. 379-383 BibTeX
Felix Ulmer: Irreducible Linear Differential Equations of Prime Order. 385-401 BibTeX

Osami Yamamoto: On Some Bounds for Zeros of Norm-Bounded Polynomials. 403-427 BibTeX
Dominique Duval: Algebraic Numbers: An Example of Dynamic Evaluation. 429-445 BibTeX
Abdallah Assi: On Flatness of Generic Projections. 447-462 BibTeX
Andreas Weiermann: Complexity Bounds for Some Finite Forms of Kruskal's Theorem. 463-488 BibTeX
Krzysztof R. Apt, Peter van Emde Boas, Angelo Welling: The STO-Problem is NP-Hard. 489-495 BibTeX

Boo Barkee, Deh Cac Can, Julia Ecks, Theo Moriarty, R. F. Ree: Why You Cannot Even Hope to use Gröbner Bases in Public Key Cryptography: An Open Letter to a Scientist Who Failed and a Challenge to Those Who Have Not Yet Failed. 497-501 BibTeX
Yonhao Ma: On The Minors Defined By A Generic Matrix. 503-518 BibTeX
Ming-Deh A. Huang, Doug Ierardi: Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve. 519-539 BibTeX
Alice C. Niemeyer: A Finite Soluble Quotient Algorithm. 541-561 BibTeX
John Pedersen, Margaret Yoder: Term Rewriting for the Conjugacy Problem and the Braid Groups. 563-572 BibTeX
Luca Gemignani: Solving Hankel Systems over the Integers. 573-584 BibTeX
Eric Bach: Tensor Products and Computability. 585-593 BibTeX