Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Symbolic Computation AND Volume=8
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On equational theories, unification, and (un)decidability
Hans-Jürgen Bürckert
,
Alexander Herold
,
Manfred Schmidt-Schauss
Journal Symbolic Computation
8
(1-2), 1989, pp. 3-49
Unification in a combination of arbitrary disjoint equational theories
Manfred Schmidt-Schauss̈
Journal Symbolic Computation
8
(1-2), 1989, pp. 51-99
Higher-order unification revisited: Complete sets of transformations
Wayne Snyder
,
Jean Gallier
Journal Symbolic Computation
8
(1-2), 1989, pp. 101-140
On the logic of unification
Philippe le Chenadec
Journal Symbolic Computation
8
(1-2), 1989, pp. 141-199
Efficient solution of linear diophantine equations
Michael Clausen
,
Albrecht Fortenbacher
Journal Symbolic Computation
8
(1-2), 1989, pp. 201-216
Adventures in associative-commutative unification
Patrick Lincoln
,
Jim Christian
Journal Symbolic Computation
8
(1-2), 1989, pp. 217-240
Computing in permutation and matrix groups - III: Sylow subgroups
Gregory Butler
,
John Cannon
Journal Symbolic Computation
8
(3), 1989, pp. 241-252
A strong restriction of the inductive completion procedure
Laurent Friebourg
Journal Symbolic Computation
8
(3), 1989, pp. 253-276
Temporal logic programming
Martín Abadi
,
Zohar Manna
Journal Symbolic Computation
8
(3), 1989, pp. 277-295
On the harmonic and monogenic decomposition of polynomials
F. Brackx
,
D. Constales
,
A. Ronveaux
,
H. Serras
Journal Symbolic Computation
8
(3), 1989, pp. 297-304
Symbolic computation of hyperbolicity regions for systems of two-phase flow conservation laws using maple
A.D. Fitt
Journal Symbolic Computation
8
(3), 1989, pp. 305-308
Constructing the vertex-transitive graphs of order 24
Gordon F. Royle
,
Cheryl E. Praeger
Journal Symbolic Computation
8
(4), 1989, pp. 309-326
On computing the canonical form for a binary form of odd degree
Arne Dür
Journal Symbolic Computation
8
(4), 1989, pp. 327-333
Using unavoidable set of trees to generalize Kruskal's theorem
Laurence Puel
Journal Symbolic Computation
8
(4), 1989, pp. 335-382
Order-sorted unification
Jose Meseguer
,
Joseph A. Goguen
,
Gert Smolka
Journal Symbolic Computation
8
(4), 1989, pp. 383-413
Unification in permutative equational theories is undecidable
Manfred Schmidt-Schauss
Journal Symbolic Computation
8
(4), 1989, pp. 415-421
Computer-aided derivation of spherical harmonic spectral equations in astrogeophysics
M.L. Dudley
,
R.W. James
Journal Symbolic Computation
8
(4), 1989, pp. 423-427
The computation of polynomial greatest common divisors over an algebraic number field
Lars Langemyr
,
Scott McCallum
Journal Symbolic Computation
8
(5), 1989, pp. 429-448
Unification in Boolean rings and Abelian groups
Alexandre Boudet
,
Jean-Pierre Jouannaud
,
Manfred Schmidt-Schauss
Journal Symbolic Computation
8
(5), 1989, pp. 449-477
Unification in commutative theories
Franz Baader
Journal Symbolic Computation
8
(5), 1989, pp. 479-497
Solving word equations
Habib Abdulrab
,
Jean-Pierre Pécuchet
Journal Symbolic Computation
8
(5), 1989, pp. 499-521
Matching - A special case of unification?
Hans-Jürgen Bürckert
Journal Symbolic Computation
8
(5), 1989, pp. 523-536
Differential equations of some orthogonal families in REDUCE
A. Ronveaux
,
G. Thiry
Journal Symbolic Computation
8
(5), 1989, pp. 537-541
On radical zero-dimensional ideals
Hidetsune Kobayashi
,
Shuichi Moritsugu
,
Robert W. Hogan
Journal Symbolic Computation
8
(6), 1989, pp. 545-552
Computing primitive elements of extension fields
Kazuhiro Yokoyama
,
Masayuki Noro
,
Taku Takeshima
Journal Symbolic Computation
8
(6), 1989, pp. 553-580
Seiten 1
2
>