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: Series=LNCS AND Volume=174

• Homogeneous linear difference equation (Frobenius-Boole method)
  J. Della Dora, E. Tournier
  Lecture Notes in Computer Science 174, 1984, pp. 2-12
• An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation
  S. Watanabe
  Lecture Notes in Computer Science 174, 1984, pp. 13-22
• Operational calculus techniques for solving differential equations
  N. Glinos, B.D. Saunders
  Lecture Notes in Computer Science 174, 1984, pp. 23-34
• On the application of symbolic computation to nonlinear control theory
  G. Cesareo, R. Marino
  Lecture Notes in Computer Science 174, 1984, pp. 35-46
• Quartic equations and algorithms for Riemann tensor classification
  J.E. Åman, R.A. d'Inverno, G.C. Joly, M.A.H. MacCallum
  Lecture Notes in Computer Science 174, 1984, pp. 47-58
• Symbolic computation and the Dirichlet problem
  R.W. Wilkerson
  Lecture Notes in Computer Science 174, 1984, pp. 59-63
• Simplification of polynomials in n variables
  G. Viry
  Lecture Notes in Computer Science 174, 1984, pp. 64-73
• On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems
  M. Navarro, F. Orejas
  Lecture Notes in Computer Science 174, 1984, pp. 74-85
• Implementation of a p-adic package for polynomial factorization and other related operations
  P.S. Wang
  Lecture Notes in Computer Science 174, 1984, pp. 86-99
• Computations on curves
  C. Dicrescenzo, D. Duval
  Lecture Notes in Computer Science 174, 1984, pp. 100-107
• Detecting torsion divisors on curves of genus 2
  T.G. Berry
  Lecture Notes in Computer Science 174, 1984, pp. 108-114
• Computation in radical extensions
  H. Najid-Zejli
  Lecture Notes in Computer Science 174, 1984, pp. 115-122
• A primer: 11 keys to new Scratchpad
  R.D. Jenks
  Lecture Notes in Computer Science 174, 1984, pp. 123-147
• A pure and really simple initial functional algebraic language
  J.P. Fitch, J.A. Padget
  Lecture Notes in Computer Science 174, 1984, pp. 148-158
• Some effectivity problems in polynomial ideal theory
  M. Giusti
  Lecture Notes in Computer Science 174, 1984, pp. 159-171
• Upper and lower bounds for the degree of Groebner bases
  H.M. Möller, F. Mora
  Lecture Notes in Computer Science 174, 1984, pp. 172-183
• On the complexity of the Groebner-bases algorithm over K[x,y,z]
  F. Winkler
  Lecture Notes in Computer Science 174, 1984, pp. 184-194
• Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings
  A. Kandri-Rody, D. Kapur
  Lecture Notes in Computer Science 174, 1984, pp. 195-206
• Computations with rational subsets of confluent groups
  R.H. Gilman
  Lecture Notes in Computer Science 174, 1984, pp. 207-212
• CAMAC2: A portable system for combinatorial and algebraic computation
  J.S. Leon
  Lecture Notes in Computer Science 174, 1984, pp. 213-224
• Polynomial time algorithms for Galois groups
  S. Landau
  Lecture Notes in Computer Science 174, 1984, pp. 225-236
• Code generation and optimization for finite element analysis
  P.S. Wang, T.Y.P. Chang, J.A. van Hulzen
  Lecture Notes in Computer Science 174, 1984, pp. 237-247
• A comparison of algorithms for the symbolic computation of Padé approximants
  S.R. Czapor, K.O. Geddes
  Lecture Notes in Computer Science 174, 1984, pp. 248-259
• Automatic error cumulation control
  B.J.A. Hulshof, J.A. van Hulzen
  Lecture Notes in Computer Science 174, 1984, pp. 260-271
• Polynomial factorization by root approximation
  A.K. Lenstra
  Lecture Notes in Computer Science 174, 1984, pp. 272-276