Algebraic Algorithms I

• 
  Dario Bini, Victor Y. Pan: Algorithms for Polynominal Division. 1-3
• 
  Erich Kaltofen: Sparse Hensel Lifting. 4-17
• 
  James H. Davenport, Julian A. Padget: HEUGCD: How Elementary Upperbounds Generated Cheaper Data. 18-28
• 
  Costas S. Iliopoulos: Gaussian Elimination over a Euclidean Ring. 29-30
• 
  Hans Zassenhaus: Symbol Manipulation and Symmetry Breaking. 607

Demos of General Purpose Computer Algebra Systems

• 
  Michael Taraniuk, Peter C. Mackeonis: Demonstration of REDUCE3 as Implemented on a Stand-Alone MOTOROLA 68000 Based Microcomputer. 31
• 
  Robert S. Sutor: The Scratchpad II Computer Algebra Language and System. 32-33
• 
  George E. Collins: The SAC-2 Computer Algebra System. 34-35
• 
  George J. Carrette, Leo P. Harten: DOE-MACSYMA: Progress Report. 36-39

Automated Theorem Proving

• 
  Susanna Ghelfo, Eugenio G. Omodeo: Towards Practical Implementations of Syllogistic. 40-49
• 
  Neil V. Murray, Erik Rosenthal: Path Resolution and Semantic Graphs. 50-63
• 
  Georg Gottlob, Alexander Leitsch: Fast Subsumption Algorithms. 64-77
• 
  K. Aspetsberger: Substitution Expressions: Extracting Solutions of Non-Horn Clause Proofs. 78-86
• 
  Volker Weispfenning: The Complexity of Elementary Problems in Archimedean Ordered Groups. 87-88

Applications I

• 
  Jan E. Åman, R. A. d'Inverno, G. C. Joly, Malcolm A. H. MacCallum: Progress on the Equivalence Problem. 89-98
• 
  W. Lassner: Symbol Representations of Noncommutative Algebras. 99-115
• 
  K. Millington, Francis J. Wright: Algebraic Computations in Elementary Catastrophe Theory. 116-125
• 
  Dieter Armbruster: Bifurcation Theory and Computer Algebra: An Initial Approach. 126-137

Algebraic Algorithms II

• 
  Marc-Paul van der Hulst, Arjen K. Lenstra: Factorization of Polynominals by Transcendental Evaluation. 138-145
• 
  Franzpeter Goebbels: Factorization of Rational Polynominals in the Zassenhaus-Norm. 146-147
• 
  Rudolf Lidl: On Decomposable and Commuting Polynominals. 148-149
• 
  Vangalur S. Alagar, Mai Thanh: Fast Polynominal Decomposition Algorithms. 150-153
• 
  Wolfgang Riedel: A Program System for Root Finding. 154
• 
  Michael Kreißig: A Program System for Factorization of Polynominals with Rational Coefficients. 155
• 
  Peter Richter: THKLISP as a Base of Formula Manipulation Systems. 156

Demos of Special Purpose Computer Algebra Systems

• 
  J.-M. Drouffe: AMP: A System for Algebraic Computations. 157-158
• 
  Andrzej Krasinski: The Program ORTOCARTAN for Applications in Einstein's Relativity Theory. 159-160
• 
  Inge Frick, Jan E. Åman: SHEEP and Classification in General Relativity. 161-162
• 
  Arne Hornæs, Terje Wahl: NORCAN - A Computer Calculus Program. 163-164
• 
  Lars Hörnfeldt: STENSOR. 165
• 
  S. Kamal Abdali, Guy W. Cherry: Visual Environments for Symbolic Computation. 166-167

Constructive and Combinatory Logic

• 
  Pierre-Louis Curien: Syntactic Equivalences Inducing Semantic Equivalences. 168-178
• 
  Henson Graves, Lee Blaine: The ALGOS Computational System. 179-180
• 
  Werner Gaube, Heinrich C. Mayr, Peter C. Lockemann: Retrieval in a Module Library Using Formal Specifications: Preliminary Search Using Syntactic Properties. 181-196
• 
  Jacek Gibert: The J-Machine: Functional Programming with Combinators. 197-198

Applications II

• 
  D. M. Klimov: Symbolic Algebra in Problems of Non-Linear Mechanics. 199-200
• 
  Ph. Tombal, A. Moussiaux: MACSYMA's Computation of Dirac-Bergmann Algorithm for Hamiltonian Systems with Constraints. 201-202
• 
  Terje Wahl: Infinite Dimensional Computer Lie Algebra? 203-204
• 
  John F. Ogilvie: Application of Computer Algebra to the Theory of the Vibration-Rotational Spectra of Diatomic Molecules. 205

Computational Group Theory

• 
  Ömer Egecioglu: Algorithms for the Character Theory of the Symmetric Group. 206-224
• 
  Costas S. Iliopoulos: Worst-Case Analysis of Algorithms for Computational Problems on Abelian Permutation Groups. 225-228
• 
  Philippe le Chenadec: A Completion of some Coxeter Groups. 229-242
• 
  Colin M. Campbell, Edmund F. Robertson: A Cayley File of Finite Simple Groups. 243-244
• 
  Daniela B. Nikolova: On Some Laws in PSL(2, q). 245

Algebraic Algorithms III

• 
  Dennis S. Arnon, George E. Collins, Scott McCallum: An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-Dimensional Space. 246-261
• 
  Dennis S. Arnon: A Cluster-Based Cylindrical Algebraic Decomposition Algorithm. 262-269
• 
  Dennis S. Arnon: On Mechanical Quantifier Elimination for Elementary Algebra and Geometry: Solution of a Non-Trivial Problem. 270-271
• 
  W. Böge, Rüdiger Gebauer, Heinz Kredel: Gröbner Bases Using SAC-2. 272-274

Algebraic Algorithms IV

• 
  Dennis S. Arnon, Scott McCallum: A Polynominal Time Algorithm for the Topological Type of a Real Algebraic Curve. 275-276
• 
  Scott McCallum: An Improved Projection Operation for Cylindrical Algebraic Decomposition. 277-278
• 
  Erich Kaltofen, Heinrich Rolletschek: Arithmetic in Quadratic Fields with Unique Factorization. 279-288
• 
  Jean Della Dora, Claire Dicrescenzo, Dominique Duval: About a New Method for Computing in Algebraic Number Fields. 289-290

Computer Algebra Systems Implementation I

• 
  Snorri Agnarsson, Mukkai S. Krishnamoorthy, B. David Saunders: An Algebraic Implementation of Packages. 291-302
• 
  J. M. Greif: The SMP Pattern Matcher. 303-314
• 
  Ben J. A. Hulshof, J. A. van Hulzen: An Expression Compression Package for REDUCE based on Factorization and Controlled Expansion. 315-316
• 
  Lars Hörnfeldt: STENSOR Uses Disc Automatically for Very Large Computations. 317

Symbolic/Numeric Interface I

• 
  Siegfried M. Rump: Numerical Methods with Automatic Verification. 318-319
• 
  Siegfried M. Rump: ACRITH - High Accuracy Arithmetic Subroutine Library. 320-321
• 
  Jürgen Wolff von Gudenberg: Floating-Point Computation in PASCAL-SC with Verified Results. 322-324
• 
  Jürgen Wolff von Gudenberg: PASCAL-SC Demonstration: Accurate Arithmetic for Verified Results. 325-326
• 
  Asish Mukhopadhyay: A Solution to the Polynominal Hensel-Code Conversion Problem. 327
• 
  Yu. Matijasevich: A Posteriori Interval Analysis. 328-334
• 
  Victor G. Ganzha, S. I. Mazurik, V. P. Shapeev: Symbolic Manipulations on a Computer and Their Application to Generation and Investigation of Difference Schemes. 335-347

Rewrite Rules and the Completion Procedure

• 
  Emmanuel Kounalis: Completeness in Data Type Specifications. 348-362
• 
  E. Paul: On Solving the Equality Problem in Theories Defined by Horn Clauses. 363-377
• 
  Franz Winkler: Reducing the Complexity of the Knuth-Bendix Completion-Algorithm: A "Unification" of Different Approaches. 378-389
• 
  Wolfgang Küchlin: A Confluence Criterion Based on the Generalised Neman Lemma. 390-399
• 
  A. J. J. Dick: ERIL - Equational Reasoning: an Interactive Laboratory. 400-401
• 
  Claude Kirchner, Hélène Kirchner: Implementation of a General Completion Procedure Parameterized by Built-in Theories and Strategies. 402-404

Applications III

• 
  Arne Hornæs: Computer Algebra in Norway. 405-406
• 
  Martin Becker, Günter Schellenberger: GOPPA Codes: Algorithmic Problems. 407-408

Algebraic Algorithms V

• 
  Patrizia M. Gianni, Barry M. Trager: GCD's and Factoring Multivariate Polynominals Using Gröbner Bases. 409-410
• 
  Marc Giusti: A Note on the Complexity of Constructing Standard Bases. 411-412
• 
  André Galligo: Some Algorithmic Questions of Constructing Standard Bases. 413-421
• 
  W. Trinks: On Improving Approximate Results of Buchberger's Algorithm by Newton's Method. 608-612

Rewrite Rules and the Completion Procedure II

• 
  John Pedersen: Obtaining Complete Sets of Reductions and Equations Without Using Special Unification Algorithms. 422-423
• 
  Regina Llopis de Trias, U. Simon Bolivar: An Overview of Completion Algorithms. 424-428

Computer Algebra Systems Implementation II

• 
  P. D. Pearce, R. J. Hicks: The Optimisation by "Code Motion" of User Programs for an Algebraic Manipulation System. 429-430
• 
  Douglas A. Young, Paul S. Wang: An Improved Plotting Package for VAXIMA. 431-432

Automatic Programming I

• 
  Norbert Heck, Jürgen Avenhaus: On Logic Programs with Data-Driven Computations. 433-443
• 
  François Bergeron, Claude Pichet: DARWIN, a System designed for the Study of Enumerative Combinatorics. 444-445
• 
  Bernhard Hohlfeld: Correctness Proofs of the Implementation of Abstract Data Types. 446-447
• 
  Beat Brüderlin: Using Prolog for Constructing Geometric Objects defined by Constraints. 448-459

Applications IV

• 
  S. Bandyopadhyay, John S. Devitt: The Role of Symbolic Computation in the Management of Scientific Information. 460-461
• 
  H. Exner, F. D. Fischer: CIM (Computer Integrated Manufacturing) - A Challenge for Symbolic Computation. 462-463
• 
  Helder Coelho: Symbolic and Algebraic Computation May Support Secondary Education. 464-465
• 
  M. Caciotta, F. Iannucci: Software Toolkit for Input Stage Measurement in Symbolic Computation. 466-467
• 
  P. Boninfante, G. M. Veca: The Algebraic Manipulation Systems on the Electrical Power Systems. 468-469

Computational Number Theory

• 
  U. Fincke, Michael Pohst: A New Method of Computing Fundamental Units in Algebraic Number Fields. 470-478
• 
  Johannes Buchmann: The Generalized Voronoi-Algorithm in Totally Real Algebraic Number Fields. 479-486
• 
  H. Ong, D. Golke: An Algorithm for the Computation of Perfect Polyhedral Cones over Real Quadratic Number Fields. 487-488
• 
  M. A. Reichert: Explicit Determination of Non-Trivial Torsion Structures of Elliptic Curves over Quadratic Number Fields. 489-490
• 
  Karin Lamprecht, Horst Günter Zimmer: P-Adic Algorithms and the Computation of Zeros of P-Adic L-Functions. 491-502
• 
  Attila Pethö: On the Solution of the Diophantine Equation G_n=p^z. 503-512

Algebraic Algorithms VI

• 
  Lorenzo Robbiano: Term Orderings on the Polynominal Ring. 513-517
• 
  Ferdinando Mora: An Algorithmic Approach to Local Rings. 518-525
• 
  H. Michael Möller: A Reduction Strategy for the Taylor Resolution. 526-534
• 
  David Ford, John McKay: From Polynominals to Galois Groups. 535-536

Parallel Symbolic and Algebraic Computation

• 
  Stephen M. Watt: A System for Parallel Computer Algebra Programs. 537-538
• 
  Ricardo Caferra, Philippe Jorrand: Unification in Parallel with Refined Linearity Test: An Example of Recursive Network Structure in FP2, A Functional Parallel Programming Language. 539-540
• 
  Bruno Buchberger: The Parallel L-Machine for Symbolic Computation. 541-542

Automatic Programming II

• 
  Heinrich Hußmann: Unification in Conditional Equational Theories. 543-553
• 
  Robert Paige, Fritz Henglein: Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code - A Case Study. 554-567
• 
  Marta Franová: A Methodology for Automatic Programming Based on the Constructive Matching Strategy. 568-569
• 
  Alexander Sakharov: The Structural Synthesis of Programs: New Means. 570-571

Symbolic/Numeric Interface II

• 
  Paul S. Wang: Taking Advantage of Symmetry in the Automatic Generation of Numerical Programs for Finite Element Analysis. 572-582
• 
  Barbara L. Gates, J. A. van Hulzen: Automatic Generation of Optimized Programs. 583-584

Computer Analysis

• 
  Michael Karr: Canonical Form for Rational Exponential Expressions. 585-594
• 
  Michael F. Singer, James H. Davenport: Elementary and Liouvillian Solutions of Linear Differential Equations. 595-596
• 
  Thomas Wolf: Analytical Decoupling, Decision of Compatibility and Partial Integration of Systems of Non-Linear Ordinary and Partial Differential Equations. 597-598
• 
  Klaus Nehrkorn: Symbolic Integration of Exponential Polynominals. 599-600
• 
  Fritz Schwarz: A REDUCE Package for Determining First Integrals of Autonomous Systems of Ordinary Differential Equations. 601-602
• 
  M. Arcieri, Alfonso Miola, F. Panasiti: A Package of Tools for Manipulation of Sums and Series. 603-604
• 
  Michael Karr: Theory of Summation in Finite Terms. 605-606

last updated on Wed May 22 02:49:56 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page