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=1985

• Algebraic computations in elementary catastrophe theory
  K. Millington, F.J. Wright
  Lecture Notes in Computer Science 204, 1985, pp. 116-125
• Bifurcation theory and computer algebra: An initial approach
  D. Armbruster
  Lecture Notes in Computer Science 204, 1985, pp. 126-137
• Factorization of polynomials by transcendental evaluation
  M.-P. van der Hulst, A.K. Lenstra
  Lecture Notes in Computer Science 204, 1985, pp. 138-145
• Factorization of rational polynomials in the Zassenhaus-norm
  F. Goebbels
  Lecture Notes in Computer Science 204, 1985, pp. 146-147
• On decomposable and commuting polynomials
  R. Lidl
  Lecture Notes in Computer Science 204, 1985, pp. 148-149
• Fast polynomial decomposition algorithms
  V.S. Alagar, M. Thanh
  Lecture Notes in Computer Science 204, 1985, pp. 150-153
• AMP: A system for algebraic computations
  J.M. Drouffe
  Lecture Notes in Computer Science 204, 1985, pp. 157-158
• The program ORTOCARTAN for applications in Einstein's relativity theory
  A. Krasiński
  Lecture Notes in Computer Science 204, 1985, pp. 159-160
• SHEEP and classification in general relativity
  I. Frick, J.E. Åman
  Lecture Notes in Computer Science 204, 1985, pp. 161-162
• NORCAN - A computer calculus program
  A. Hornaes, T. Wahl
  Lecture Notes in Computer Science 204, 1985, pp. 163-164
• Visual environments for symbolic computation
  S.K. Abdali, G. Cherry
  Lecture Notes in Computer Science 204, 1985, pp. 166-167
• Syntactic equivalences inducing semantic equivalences
  P.-L. Curien
  Lecture Notes in Computer Science 204, 1985, pp. 168-178
• The ALGOS computational system
  H. Graves, L. Blaine
  Lecture Notes in Computer Science 204, 1985, pp. 179-180
• Retrieval in a module library using formal specifications: Preliminary search using syntactic properties
  W. Gaube, H.C. Mayr, P.C. Lockemann
  Lecture Notes in Computer Science 204, 1985, pp. 181-196
• The J-machine: Functional programming with combinators
  J. Gibert
  Lecture Notes in Computer Science 204, 1985, pp. 197-198
• Symbolic algebra in problems of non-linear mechanics
  D.M. Klimov
  Lecture Notes in Computer Science 204, 1985, pp. 199-200
• MACSYMA's computation of Dirac-Bergmann algorithm for Hamiltonian systems with contraints
  Ph. Tombal, A. Moussiaux
  Lecture Notes in Computer Science 204, 1985, pp. 201-202
• Algorithms for the character theory of the symmetric group
  ö. Egecioglu
  Lecture Notes in Computer Science 204, 1985, pp. 206-224
• Worst-case analysis of algorithms for computational problems on Abelian permutation groups
  C.S. Iliopoulos
  Lecture Notes in Computer Science 204, 1985, pp. 225-228
• A completion of some Coxeter groups
  P. Le Chenadec
  Lecture Notes in Computer Science 204, 1985, pp. 229-242
• A Cayley file of finite simple groups
  C.M. Campbell, E.F. Robertson
  Lecture Notes in Computer Science 204, 1985, pp. 243-244
• An adjacency algorithm for cylindrical algebraic decompositions of three-dimensional space
  D.S. Arnon, G.E. Collins, S. McCallum
  Lecture Notes in Computer Science 204, 1985, pp. 246-261
• A cluster-based cylindrical algebraic decomposition algorithm
  D.S. Arnon
  Lecture Notes in Computer Science 204, 1985, pp. 262-269
• On mechanical quantifier elimination for elementary algebra and geometry: Solution of a non-trivial problem
  D.S. Arnon
  Lecture Notes in Computer Science 204, 1985, pp. 270-271
• Gröbner bases using SAC-2
  W. Böge, R. Gebauer, H. Kredel
  Lecture Notes in Computer Science 204, 1985, pp. 272-274