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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Habicht approach to subresultants
Chung-Jen Ho
,
Chee Keng Yap
Journal Symbolic Computation
21
(1), 1996, pp. 1-14
Comparing curried and uncurried rewriting
Richard Kennaway
,
Jan Willem Klop
,
Ronan Sleep
,
Fer-Jan de Vries
Journal Symbolic Computation
21
(1), 1996, pp. 15-39
Inductive theorem proving for design specifications
Peter Padawitz
Journal Symbolic Computation
21
(1), 1996, pp. 41-99
Order stars and linear stability theory
M. Sofroniou
Journal Symbolic Computation
21
(1), 1996, pp. 101-131
Ideal decompositions and subfields
David Casperon
,
David Ford
,
John McKay
Journal Symbolic Computation
21
(2), 1996, pp. 133-137
Analogs of Gröbner bases in polynomial rings over a ring
J. Lyn Miller
Journal Symbolic Computation
21
(2), 1996, pp. 139-153
Gröbner bases with respect to generalized term orders and their application to the modelling problem
Franz Pauer
,
Sandro Zampieri
Journal Symbolic Computation
21
(2), 1996, pp. 155-168
Computing
B
-orbits on
G/H
A.G. Helminck
Journal Symbolic Computation
21
(2), 1996, pp. 169-209
Unification in the union of disjoint equational theories: Combining decision procedures
Franz Baader
,
Klaus U. Schulz
Journal Symbolic Computation
21
(2), 1996, pp. 211-243
The method of multiple scales: Asymptotic solutions and normal forms for nonlinear oscillatory problems
Nestor E. Sanchez
Journal Symbolic Computation
21
(2), 1996, pp. 245-252
Normalized rewriting: An alternative to rewriting modulo a set of equations
Claude Marché
Journal Symbolic Computation
21
(3), 1996, pp. 253-288
A remark on infinite matching vs infinite unification
Benedetto Intrigila
,
Marisa Venturini Zilli
Journal Symbolic Computation
21
(3), 1996, pp. 289-292
Memory management in the PoSSo solver
Giuseppe Attardi
,
Tito Flagella
Journal Symbolic Computation
21
(3), 1996, pp. 293-311
Improved techniques for factoring univariate polynomials
George E. Collins
,
Mark J. Encarnación
Journal Symbolic Computation
21
(3), 1996, pp. 313-327
Implicitization of rational parametric surfaces
George Fix
,
Chih-Ping Hsu
,
Tie Luo
Journal Symbolic Computation
21
(3), 1996, pp. 329-336
Construction of finitely presented Lie algebras and superalgebras
Vladimir P. Gerdt
,
Vladimir V. Kornyak
Journal Symbolic Computation
21
(3), 1996, pp. 337-349
Calculating invariant rings of finite groups over arbitrary fields
Gregor Kemper
Journal Symbolic Computation
21
(3), 1996, pp. 351-366
Solving discriminant form equations via unit equations
Nigel Smart
Journal Symbolic Computation
21
(3), 1996, pp. 367-374
Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
Hirokazu Murao
,
Tetsuro Fujise
Journal Symbolic Computation
21
(4), 1996, pp. 377-396
Parallel polynomial operations on SMPs: An overview
Paul S. Wang
Journal Symbolic Computation
21
(4), 1996, pp. 397-410
Strategy-accurate parallel Buchberger algorithms
Giuseppe Attardi
,
Carlo Traverso
Journal Symbolic Computation
21
(4), 1996, pp. 411-425
A distributed and cooperative environment for computer algebra
Stephane Dalmas
,
Marc Gaetano
,
Alain Sausse
Journal Symbolic Computation
21
(4), 1996, pp. 427-439
Bidirectional exact integer division
Werner Krandick
,
Tudor Jebelean
Journal Symbolic Computation
21
(4), 1996, pp. 441-455
Parallel implementation of the accelerated integer GCD algorithm
Kenneth Weber
Journal Symbolic Computation
21
(4), 1996, pp. 457-466
Performance analysis of the parallel Karatsuba multiplication algorithm for distributed memory architectures
Giovanni Cesari
,
Roman Maeder
Journal Symbolic Computation
21
(4), 1996, pp. 467-473
Seiten 1
2
>