default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEUROSAM 1979: Marseille, France
- Edward W. Ng:
Symbolic and Algebraic Computation, EUROSAM '79, An International Symposiumon Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings. Lecture Notes in Computer Science 72, Springer 1979, ISBN 3-540-09519-5
Simplification
- Bruno Buchberger:
A criterion for detecting unnecessary reductions in the construction of Groebner bases. 3-21 - Jörg H. Siekmann:
Unification of commutative terms. 22 - Michael R. Genesereth:
Canonicity in rule systems. 23-29
Applications in Physics
- John P. Fitch:
A survey of symbolic computation in physics (invited). 30-41 - Anders Karlhede, Jan E. Åman:
Progress towards a solution of the equivalence problem in general relativity. 42-44 - A. Voros:
Symbol calculus by symbolic computation and semi-classical expansions. 45-51 - Michele Caffo, Ettore Remiddi, Sandro Turrini:
An algorithm for the analytic evaluation of a class of integrals. 52-57
Matrices and Equations
- David Y. Y. Yun, Fred G. Gustavson:
Fast computation of rational Hermite interpolants and solving Toeplitz system of equations via the extended Euclidean algorithm. 58-64 - Robert T. Moenck, John H. Carter:
Approximate algorithms to derive exact solutions to systems of linear equations. 65-73 - J. Smit:
New recursive minor expansion algorithms. 74-87 - Daniel Lazard:
Systems of algebraic equations. 88-94
Algebraic Fields
- Hans Zassenhaus:
On the van der Waerden criterion for the group of an equation. 95-107 - H. Bartz, K. Fischer, H. G. Folz, Horst Günter Zimmer:
Some computations relating to torsion points on elliptic curves over number fields. 108-118 - James H. Davenport:
The computerization of algebraic geometry. 119-133 - Josh D. Cohen, David Y. Y. Yun:
Algebraic extensions of arbitrary integral domains. 134-139 - Michael Pohst, Hans Zassenhaus:
On unit computation in real quadratic number fields. 140-152
Differential Equations
- Evelyne Tournier:
An algebraic form of a solution of a system of linear differential equations with constant coefficients. 153-163 - Peter Schmidt:
Substitution methods for the automatic symbolic solution of differential equations of first order and first degree. 164-176 - Hatem M. Khalil, Dana L. Ulery:
A semi-numeric difference algorithm. 177-188 - Keith O. Geddes:
Convergence behavior of the Newton iteration for first order differential equations. 189-199
Polynomial Algorithms
- Jacob T. Schwartz:
Probabilistic algorithms for verification of polynomial identities (invited). 200-215 - Richard Zippel:
Probabilistic algorithms for sparse polynomials. 216-226 - Anthony C. Hearn:
Non-modular computation of polynomial GCD's using trial division. 227-239 - A. Galli:
Product of symmetric and anti-symmetric polynomials. 240
Systems
- Albert D. Rich, David R. Stoutemyer:
Capabilities of the MUMATH-78 computer algebra system for the INTEL-8080 microprocessor (invited). 241-248 - Jeffrey S. Leon, Vera Pless:
CAMAC 1979. 249-257 - A. C. Norman, P. M. A. Moore:
The initial design of a vector based algebra system. 258-265 - Richard M. Cowan, Martin L. Griss
:
Hashing, the key to rapid pattern matching. 266-278 - Lars Hörnfeldt:
A system for automatic generation of tensor algorithms. 279-290
Algorithm Analysis
- Paul S. Wang:
Analysis of multivariate iterative and recursive P-adic. 291-300 - Dennis S. Arnon:
A cellular decomposition algorithm for semi-algebraic sets. 301-315 - Alfred Woll:
Gamma-algebra algorithms for canonical hyper complex representations. 316 - George E. Collins:
Factoring univariate integral polynomial in polynomial average time. 317-329
Symbolic - Numeric Interface
- Edward W. Ng:
Symbolic-Numeric Interface: a review (in absentia). 330-345 - J. A. van Hulzen:
Solving systems of polynomial equations with floating-point coefficients. 346-357 - Tateaki Sasaki:
An arbitrary precision real arithmetic package in REDUCE. 358-368 - G. Caplat:
Symbolic manipulations in interval arithmetic problems. 369-382 - David W. Matula, Peter Kornerup:
An approximate rational arithmetic system with intrinsic recovery of simple fractions during expression evaluation. 383-397
Integration
- A. C. Norman, James H. Davenport:
Integration -- the dust settles? (invited). 398-407 - Barry M. Trager:
Integration of simple radical extensions. 408-414 - James H. Davenport:
Integration of algebraic functions. 415-425 - Joel Moses, Richard Zippel:
An extension of Liouville's theorem. 426-430
Applied Algebra
- George Havas, Leon Sterling:
Integer matrices and Abelian groups (invited). 431-451 - Volkmar Felsch, Joachim Neubüser:
An algorithm for the computation of conjugacy classes and centralizes in p-groups. 452-465
Languages and Designs
- Richard D. Jenks:
MODLISP -- an introduction (invited). 466-480 - Daniel G. Bobrow, L. Peter Deutsch:
Extending Interlisp for modularization and efficiency. 481-489 - Martin L. Griss, Robert R. Kessler, Gerald Q. Maguire Jr.:
TLISP -- a Transportable LISP implemented in P-code. 490-502 - John A. Campbell, Simon:
Symbolic computing with compression of data structures. 503-513 - Giorgio Ausiello, Giovanni Mascari:
Design of algebraic data structures with the approach of abstract data types. 514-530 - Jörg H. Siekmann:
Matching under commutativity. 531-545 - Alfred Woll:
gamma-Algebra algorithms for canonical hypercomplex representations. 546-557
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-20 23:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
