ISSAC 1994: Oxford, UK

• Dinesh Manocha:
  Computing Selected Solutions of Polynomial Equations. 1-8
  
• Sylvain Petitjean:
  Automating the Construction of Stationary Multiple-Point Classes. 9-14
  
• Hong Du:
  On the Isomorphisms of Smooth Algebraic Curves. 15-19
  
• Ahmed Guergueb, Jean Mainguené, Marie-Françoise Roy:
  Examples of Automatic Theorem Proving a Real Geometry. 20-24
  
• Stephen M. Watt, Peter A. Broadbery, Samuel S. Dooley, Pietro Iglio, Scott C. Morrison, Jonathan M. Steinbach, Robert S. Sutor:
  A First Report on the A^# Compiler. 25-31
  
• Richard D. Jenks, Barry M. Trager:
  How to Make AXIOM into a Scratchpad. 32-40
  
• David Pokrass Jacobs:
  The Albert Nonassociative Algebra System: A Progress Report. 41-44
  
• W. N. Borst, V. V. Goldman, J. A. van Hulzen:
  GENTRAN 90: A REDUCE Package for the Generation of Fortran 90 Code. 45-51
  
• Wieb Bosma, John J. Cannon, Graham Matthews:
  Programming with Algebraic Structures: Design of the MAGMA Language. 52-57
  
• Mark J. Encarnación:
  On a Modular Algorithm for Computing GCDs of Polynomials over Algebraic Number Fields. 58-65
  
• Mohamed Omar Rayes, Paul S. Wang, Kenneth Weber:
  Parallelization of the Sparse Modular GCD Algorithm for Multivariate Polynomials on Shared Memory Multiprocessors. 66-73
  
• Bruce W. Char, Mark F. Russo:
  Automatic Identification of Time Scales in Enzyme Kinetics Models. 74-83
  
• Philip H. Todd, Robin J. Y. McLeod, Marcia Harris:
  A System for the Symbolic Analysis of Problems in Engineering Mechanics. 84-89
  
• Erich Kaltofen, A. Lobo:
  Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm. 90-98
  
• Deepak Kapur, Tushar Saxena, Lu Yang:
  Algebraic and Geometric Reasoning Using Dixon Resultants. 99-107
  
• Yagati N. Lakshman, B. David Saunders:
  On Computing Sparse Shifts for Univariate Polynomials. 108-113
  
• Ioannis Z. Emiris, Ashutosh Rege:
  Monomial Bases and Polynomial System Solving (extended abstract). 114-122
  
• Ana Maria Mandache:
  The Gröbner Basis Algorithm and Subresultant Theory. 123-128
  
• Eberhard Becker, Teo Mora, Maria Grazia Marinari, Carlo Traverso:
  The Shape of the Shape Lemma. 129-133
  
• Gene Cooperman, Larry Finkelstein, Bryant W. York, Michael Tselman:
  Constructing Permutation Representations for Large Matrix Groups. 134-138
  
• Eugene M. Luks, Ferenc Rakoczi, Charles R. B. Wright:
  Computing Normalizers in Permutation p-Groups. 139-146
  
• Robert Cremanns, Friedrich Otto:
  Constructing Canonical Presentations for Subgroups of Context-Free Groups in Polynomial Time (extended abstract). 147-153
  
• Martin Schönert, Ákos Seress:
  Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time. 154-157
  
• Jamil Baddoura:
  A Conjecture on Integration in Finite Terms with Elementary Functions and Polylogarithms. 158-162
  
• Ron Sommeling:
  Characteristic Classes for Irregular Singularities. 163-168
  
• Sergei A. Abramov, Marko Petkovsek:
  D'Alembertian Solutions of Linear Differential and Difference Equations. 169-174
  
• Yiu-Kwong Man, Francis J. Wright:
  Fast Polynomial Dispersion Computation and Its Application to Indefinite Summation. 175-180
  
• Charles C. Dyer:
  An Application of Symbolic Computation in the Physical Sciences. 181-186
  
• Mark van Hoeij:
  Computing Parameterizations of Rational Algebraic Curves. 187-190
  
• Sandra Licciardi, Teo Mora:
  Implicitization of Hypersurfaces and Curves by the Primbasissatz and Basis Conversion. 191-196
  
• Robert M. Corless:
  Sufficiency Analysis for the Calculus of Variations. 197-204
  
• Alain Goriely, Michael Tabor:
  How to Compute the Melnikov Vector? 205-210
  
• Laurent Bertrand:
  On the Implementation of a new Algorithm for the Computation of Hyperelliptic Integrals. 211-215
  
• Toshinori Oaku:
  Algorithms for Finding the Structure of Solutions of a System of Linear Partial Differential Equations. 216-223
  
• Oscar E. Ruiz S., Placid M. Ferreira:
  Algebraic Geometry and Group Theory in Geometric Constraint Satisfaction. 224-233
  
• Victor G. Ganzha, Evgenii V. Vorozhtsov, J. Boers, J. A. van Hulzen:
  Symbolic-Numeric Stability Investigations of Jameson's Schemes for the Thin-Layer Navier-Stokes Equations. 234-241
  
• Olaf Bachmann, Paul S. Wang, Eugene V. Zima:
  Chains of Recurrences - a Method to Expedite the Evaluation of Closed-form Functions. 242-249
  
• Adam Dingle, Richard J. Fateman:
  Branch Cuts in Computer Algebra. 250-257
  
• Volker Weispfenning:
  Quantifier Elimination for Real Algebra - the Cubic Case. 258-263
  
• Roberto La Scala:
  An Algorithm for Complexes. 264-268
  
• Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin:
  A Fine-Grained Parallel Completion Procedure. 269-277
  
• Kelly Roach:
  Symbolic-Numeric Nonlinear Equation Solving. 278-284
  
• Daniel Richardson, John Fitch:
  The Identity Problem for Elementary Functions and Constants. 285-290
  
• Michael B. Monagan, Gaston H. Gonnet:
  Signature Functions for Algebraic Numbers. 291-296
  
• Erich Kaltofen:
  Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems. 297-304
  
• Mark Giesbrecht:
  Fast Algorithms for Rational Forms of Integer Matrices. 305-311
  
• Gilles Villard:
  Fast Parallel Computation of the Smith Normal Form of Polynomial Matrices. 312-317
  
• Jason F. Harris:
  Inheritance of Rewrite Rule Structures Applied to Symbolic Computation. 318-323
  
• Andreas Weber:
  Algorithms for Type Inference with Coercions. 324-329
  
• Simon Gray, Norbert Kajler, Paul S. Wang:
  MP: A Protocol for Efficient Exchange of Mathematical Expressions. 330-335
  
• Manuel Bronstein:
  An Improved Algorithm for Factoring Linear Ordinary Differential Operators. 336-340
  
• Jacques-Arthur Weil:
  The Use of the Special Semi-Groups for Solving Differential Equations. 341-347
  
• Benjamin P. Berman, Richard J. Fateman:
  Optical Character Recognition for Typeset Mathematics. 348-353
  
• Tomás Recio, M. J. González-López:
  On the Symbolic Insimplification of the General 6R-Manipulator Kinematic Equations. 354-358
  

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