EUROCAL 1987, Leipzig, GDR
James H. Davenport (Ed.): EUROCAL '87, European Conference on Computer Algebra, Leipzig, GDR, June 2-5, 1987, Proceedings. Springer 1989 Lecture Notes in Computer Science ISBN 3-540-51517-8
Invited Papers
- R. N. Fedorova, Vladimir P. Gerdt, N. N. Govorun, V. P. Shirikov: Computer algebra in physical research of Joint Institute for Nuclear Research. 1-10
- D. Yu. Grigoryev: Complexity of quantifier elimination in the theory of ordinary differential equations. 11-25
- Geoff C. Smith: Groups and polynomials. 26-33
- Malcolm A. H. MacCallum: Symbolic computation in relativity theory. 34-43
- Wen-tsun Wu: A zero structure theorem for polynomial-equations-solving and its applications. 44
- Sergei A. Abramov: Some algorithms of rational function algebra. 45-47
Applications and Systems
- Lars Langemyr: Converting SAC-2 code to LISP. 50-51
- Johannes Buchmann, Michael Pohst: Computing a lattice basis from a system of generating vectors. 54-63
- Mark P. W. Mutrie, Bruce W. Char, Richard H. Bartels: Expression optimization using high-level knowledge. 64-70
- R. G. Cowell, Francis J. Wright: CATFACT: Computer algebraic tools for applications of catastrophe theory. 71-80
- Vladimir P. Gerdt, A. B. Shabat, S. I. Svinolupov, A. Yu. Zharkov: Computer algebra applications for investigating integrability of nonlinear evolution systems. 81-92
- Vladimir P. Gerdt, A. Yu. Zharkov: Computer classification of integrable seventh order MKdV-like equations. 93-94
- D. M. Klimov, V. M. Rudenko, V. F. Zhuravlev: Application of Lie group and computer algebra to nonlinear mechanics. 97-106
- Jerzy Paczynski: Hierarchical symbolic computations in the analysis of large-scale dynamical systems. 107-115
- N. I. Gurin: SCHOONSCHIP for computing of gravitino interaction cross sections in n=2 supergravity. 116-117
- N. N. Vasiliev: Creation of efficient symbolic-numeric interface. 118-119
- P. van den Heuvel, J. A. van Hulzen, V. V. Goldman: Automatic generation of FORTRAN-coded Jacobians and Hessians. 120-131
- Cristomir Kazasov: Laplace transformations in REDUCE 3. 132-133
- M. Spiridonova: Some extensions and applications of REDUCE System. 136-137
- J. Smit, Sabih H. Gerez, R. Mulder: Application of a structured LISP system to computer algebra. 149-160
- Masayuki Suzuki, Tateaki Sasaki, Mitsuhisa Sato, Yoshinari Fukui: A Hybrid algebraic-numeric system ANS and its preliminary implementation. 163-171
- L. S. Dulyan: The calculation of QCD triangular Feynman graphs if the external gluonic field using REDUCE-2 system. 172-173
- R. N. Fedorova, Vladimir V. Kornyak: Computer algebra application for determining local symmetries of differential equations. 174-175
- Vladislav L. Katkov, Michail D. Popov: Computerised system of analytic transformations for analysing of differential equations. 179-185
- Eugene Shablygin: Integral equation with hidden Eigenparameter solver: REDUCE and FORTRAN in tandem. 186-191
- A. Ya. Rodionov, A. Yu. Taranov: Combinatorial aspects of simplification of algebraic expressions. 192-201
- Karl-Udo Jahn: Computer algebra and numerical convergence. 204-205
- Vladimir P. Gerdt, N. A. Kostov, Z. T. Kostova: Computer algebra and computation of Puiseux expansions of algebraic functions. 206-207
- Vitali A. Eltekov, Vladimir B. Shikalov: The methods for symbolic evaluation of determinants and their realization in the planner-analytic system. 216-222
- Eugene V. Zima: Transformation of computation formulae in systems of recurrence relations. 223-224
- V. A. Ilyin, A. P. Kryukov: DIMREG - The package for calculations in the dimensional regularization with 4-dimensional gamma5-matrix in quantum field theory. 225-232
- Adrian Bowyer, James H. Davenport, Philip S. Milne, Julian A. Padget, Andrew F. Wallis: Applications of computer algebra in solid modelling. 244-245
- K. Kusche, B. Kutzler, H. Mayr: Implementation of a geometry theorem proving package in SCRATCHPAD II. 246-257
Polynomial Algorithms
- Stephen R. Czapor: Solving algebraic equations via Buchberger's algorithm. 260-269
- Heinz Kredel: Primary ideal decomposition. 270-281
- Michael Kalkbrener: Solving systems of algebraic equations by using Gröbner bases. 282-292
- Patrizia M. Gianni: Properties of Gröbner bases under specializations. 293-297
- Lars Langemyr, Scott McCallum: The computation of polynomial greatest common divisors over an algebraic number field. 298-299
- Klaus-Peter Schemmel: An extension of Buchberger's algorithm to compute all reduced Gröbner bases of a polynomial ideal. 300-310
- Trevor J. Smedley: Radical simplification using algebraic extension fields. 313-314
- Russell J. Bradford: Hermite normal forms for integer matrices. 315-316
- Erich Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders: Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices. 317-322
- Annick Valibouze: Fonctions symétriques et changements de bases. 323-332
- Marc Giusti: Complexity of standard bases in projective dimension zero. 333-335
- Volker Weispfenning: Gröbner bases for polynomial ideals over commutative regular rings. 336-347
- Tateaki Sasaki: Some algebraic algorithms based on head term elimination over polynomial rings. 348-354
- Tatiana Gateva-Ivanova: Algorithmic determination of the Jacobson radical of monomial algebras. 355-364
- M. V. Kondratéva, E. V. Pankratév: A recursive algorithm for computation of the Hilbert polynomial. 365-375
- Brigitte Vallée: An affine point of view on minima finding in integer lattices of lower dimensions. 376-378
- P. Scheffler, Detlef Seese: A combinatorial and logical approach to linear-time computability. 379-380
- J. P. G. Henry, M. Merle: Complexity of computation of embedded resolution of algebraic curves. 381-390
- J. A. Abbott, James H. Davenport: Polynomial factorization: An exploration of Lenstra's algorithm. 391-402
Advanced Algorithms
- Alois Ferscha: A matrix-approach for proving inequalities. 403-411
- Pavol Návrat, Ludovit Molnár, Vladimir Vojtek: Using Automatic Program Synthesizer as a Problem Solver: Some Interesting Experiments. 412-423
- Thomas Fischer: Towards a refined classification of geometric search and computation problems. 426-437
- Leo Bachmair, Nachum Dershowitz: A critical pair criterion for completion modulo a congruence. 452-453
- Günter Werner: Shortest paths of a disc inside a polygonal region. 454-455
- Tomás Recio, Luis Miguel Pardo: Rabin's width of a complete proof and the width of a semialgebraic set. 456-462
- J. A. Abbott: Integration: Solving the Risch differential equation. 465-467
- Thomas Wolf: A package for the analytic investigation and exact solution of differential equations. 479-490
- Manuel Bronstein: An algorithm for the integration of elementary functions. 491-497
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team