Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=358

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Dynamic maintenance of paths and path expressions on graphs
G. Ausiello, A. Marchetti Spaccamela, U. Nanni
Lecture Notes in Computer Science 358, 1989, pp. 1-12
Generic programming
David R. Musser, A.A. Stepanov
Lecture Notes in Computer Science 358, 1989, pp. 13-25
From a noncomputability result to new interesting definitions and computability results
F. Sergeraert
Lecture Notes in Computer Science 358, 1989, pp. 26-32
Symbolic derivation and automatic generation of parallel routines for finite element analysis
N. Sharma, P.S. Wang
Lecture Notes in Computer Science 358, 1989, pp. 33-56
Liouvillian first integrals of differential equations
M.F. Singer
Lecture Notes in Computer Science 358, 1989, pp. 57-63
Fast reduction of the Risch differential equation
M. Bronstein
Lecture Notes in Computer Science 358, 1989, pp. 64-72
An application of REDUCE to the approximation of f(x,y)
C. Chaffy-Camus
Lecture Notes in Computer Science 358, 1989, pp. 73-84
The use of symbolic computation in solving some non-relativistic quantum mechanical problems
F. Vinette, J. C̑íz̑ek
Lecture Notes in Computer Science 358, 1989, pp. 85-95
Experiments with quadtree representation of matrices
S.K. Abdali, D.S. Wise
Lecture Notes in Computer Science 358, 1989, pp. 96-108
Discovering inequality conditions in the analytical solution of optimization problems
B.W. Char, A.R. Macnaughton, P.A. Strooper
Lecture Notes in Computer Science 358, 1989, pp. 109-115
Gröbner trace algorithms
C. Traverso
Lecture Notes in Computer Science 358, 1989, pp. 125-138
Solving systems of algebraic equations
H. Kobayashi, S. Moritsugu, R.W. Hogan
Lecture Notes in Computer Science 358, 1989, pp. 139-149
Gröbner bases in non-commutative algebras
T. Mora
Lecture Notes in Computer Science 358, 1989, pp. 150-161
Greater easy common divisor and standard basis completion algorithms
A. Galligo, L. Pottier, C. Traverso
Lecture Notes in Computer Science 358, 1989, pp. 162-176
Experiments with a projection operator for algebraic decomposition
S. Arnborg
Lecture Notes in Computer Science 358, 1989, pp. 177-182
Rational Newton algorithm for computing formal solutions of linear differential equations
M.A. Barkatou
Lecture Notes in Computer Science 358, 1989, pp. 183-195
An ordinary differential equation solver for REDUCE
M.A.H. MacCallum
Lecture Notes in Computer Science 358, 1989, pp. 196-205
A fixed point method for power series computation
S.M. Watt
Lecture Notes in Computer Science 358, 1989, pp. 206-217
An algorithm for symbolic computation of center manifolds
E. Freire, E. Gamero, E. Ponce, L.G. Franquelo
Lecture Notes in Computer Science 358, 1989, pp. 218-230
Shortest division chains in imaginary quadratic number fields
H. Rolletschek
Lecture Notes in Computer Science 358, 1989, pp. 231-243
Effective tests for cyclotomic polynomials
R.J. Bradford, J.H. Davenport
Lecture Notes in Computer Science 358, 1989, pp. 244-251
The probability of relative primality of Gaussian integers
G.E. Collins, J.R. Johnson
Lecture Notes in Computer Science 358, 1989, pp. 252-258
Some computational aspects of root finding in GF(q^m)
A.J. Menezes, P.C. van Oorschot, S.A. Vanstone
Lecture Notes in Computer Science 358, 1989, pp. 259-270
Symbolic computation for Witt rings
A. Juozapavic̑ius
Lecture Notes in Computer Science 358, 1989, pp. 271-273
Computations with algebraic curves
S.S. Abhyankar, C.L. Bajaj
Lecture Notes in Computer Science 358, 1989, pp. 274-284

Seiten 1 2 >