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 YEAR=1984

• 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
• Effective Hilbert irreducibility
  E. Kaltofen
  Lecture Notes in Computer Science 174, 1984, pp. 277-284
• GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
  B.W. Char, K.O. Geddes, G.H. Gonnet
  Lecture Notes in Computer Science 174, 1984, pp. 285-296
• A new lifting process for the multivariate polynomial factorization
  D. Lugiez
  Lecture Notes in Computer Science 174, 1984, pp. 297-309
• Explicit construction of the Hilbert class fields of imaginary quadratic fields with class numbers 7 and 11
  E. Kaltofen, N. Yui
  Lecture Notes in Computer Science 174, 1984, pp. 310-320
• On a simple primality testing algorithm
  M.-D.A. Huang
  Lecture Notes in Computer Science 174, 1984, pp. 321-332
• A criterion for the equivalence of two ideals
  J. Buchmann
  Lecture Notes in Computer Science 174, 1984, pp. 333-340
• y' + fy = g
  J.H. Davenport
  Lecture Notes in Computer Science 174, 1984, pp. 341-350
• Integration in finite terms with special functions: A progress report
  G.W. Cherry, B.F. Caviness
  Lecture Notes in Computer Science 174, 1984, pp. 351-358
• A note on the Risch differential equation
  E. Kaltofen
  Lecture Notes in Computer Science 174, 1984, pp. 359-366
• Approximation by continued fraction of a polynomial real root
  K. Thull
  Lecture Notes in Computer Science 174, 1984, pp. 367-377
• On the automatic resolution of certain diophantine equations
  M. Mignotte
  Lecture Notes in Computer Science 174, 1984, pp. 378-385
• On pseudo-resultants
  M. Rothstein
  Lecture Notes in Computer Science 174, 1984, pp. 386-396
• Linear searching for a square in a word
  M. Crochemore
  Lecture Notes in Computer Science 172, 1984, pp. 137