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 [1]	Hilfe

Suche: Series=LNCS AND Volume=204

• An improved projection operation for cylindrical algebraic decomposition
  S. McCallum
  Lecture Notes in Computer Science 204, 1985, pp. 277-278
• Arithmetic in quadratic fields with unique factorization
  E. Kaltofen, H. Rolletschek
  Lecture Notes in Computer Science 204, 1985, pp. 279-288
• About a new method for computing in algebraic number fields
  J. Della Dora, C. Dicrescenzo, D. Duval
  Lecture Notes in Computer Science 204, 1985, pp. 289-290
• An algebraic implementation of packages
  S. Agnarsson, M.S. Krishnamoorthy, B.D. Saunders
  Lecture Notes in Computer Science 204, 1985, pp. 291-302
• The SMP pattern matcher
  J.M. Greif
  Lecture Notes in Computer Science 204, 1985, pp. 303-314
• An expression compression package for REDUCE based on factorization and controlled expansion
  B.J.A. Hulshof, J.A. van Hulzen
  Lecture Notes in Computer Science 204, 1985, pp. 315-316
• Numerical methods with automatic verification
  S.M. Rump
  Lecture Notes in Computer Science 204, 1985, pp. 318-319
• ACRITH - High accuracy arithmetic subroutine library
  S.M. Rump
  Lecture Notes in Computer Science 204, 1985, pp. 320-321
• Floating-point computation in PASCAL-SC with verified results
  J.W. von Gudenberg
  Lecture Notes in Computer Science 204, 1985, pp. 322-324
• PASCAL-SC demonstration: Accurate arithmetic for verified results
  J.W. von Gudenberg
  Lecture Notes in Computer Science 204, 1985, pp. 325-326
• A posteriori interval analysis
  Yu.V. Matijasevich
  Lecture Notes in Computer Science 204, 1985, pp. 328-334
• Symbolic manipulations on a computer and their application to generation and investigation of difference schemes
  V.G. Ganzha, S.I. Mazurik, V.P. Shapeev
  Lecture Notes in Computer Science 204, 1985, pp. 335-347
• Completeness in data type specifications
  E. Kounalis
  Lecture Notes in Computer Science 204, 1985, pp. 348-362
• On solving the equality problem in theories defined by Horn clauses
  E. Paul
  Lecture Notes in Computer Science 204, 1985, pp. 363-377
• Reducing the complexity of the Knuth-Bendix completion algorithm: A ``unification'' of different approaches
  F. Winkler
  Lecture Notes in Computer Science 204, 1985, pp. 378-389
• A confluence criterion based on the generalised Newman lemma
  W. Küchlin
  Lecture Notes in Computer Science 204, 1985, pp. 390-399
• ERIL - Equational reasoning: an interactive laboratory
  A.J.J. Dick
  Lecture Notes in Computer Science 204, 1985, pp. 400-401
• Implementation of a general completion procedure parameterized by built-in theories and strategies
  C. Kirchner, H. Kirchner
  Lecture Notes in Computer Science 204, 1985, pp. 402-404
• Computer algebra in Norway
  A. Hornaes
  Lecture Notes in Computer Science 204, 1985, pp. 405-406
• GOPPA Codes: Algorithmic problems
  M. Becker, G. Schellenberger
  Lecture Notes in Computer Science 204, 1985, pp. 407-408
• GCD's and factoring multivariate polynomials using Gröbner bases
  P. Gianni, B. Trager
  Lecture Notes in Computer Science 204, 1985, pp. 409-410
• A note on the complexity of constructing standard bases
  M. Giusti
  Lecture Notes in Computer Science 204, 1985, pp. 411-412
• Some algorithmic questions on ideals of differential operators
  A. Galligo
  Lecture Notes in Computer Science 204, 1985, pp. 413-421
• Obtaining complete sets of reductions and equations without using special unification algorithms
  J. Pedersen
  Lecture Notes in Computer Science 204, 1985, pp. 422-423
• An overview of completion algorithms
  R. Llopis de Trias
  Lecture Notes in Computer Science 204, 1985, pp. 424-428