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

• Mechanical translation of set theoretic problem specifications into efficient RAM code - A case study
  R. Paige, F. Henglein
  Lecture Notes in Computer Science 204, 1985, pp. 554-567
• A methodology for automatic programming based on the constructive matching strategy
  M. Franová
  Lecture Notes in Computer Science 204, 1985, pp. 568-569
• The structural synthesis of programs: New means
  A. Sakharov
  Lecture Notes in Computer Science 204, 1985, pp. 570-571
• Taking advantage of symmetry in the automatic generation of numerical programs for finite element analysis
  P.S. Wang
  Lecture Notes in Computer Science 204, 1985, pp. 572-582
• Automatic generation of optimized programs
  B.L. Gates, J.A. van Hulzen
  Lecture Notes in Computer Science 204, 1985, pp. 583-584
• Canonical form for rational exponential expressions
  M. Karr
  Lecture Notes in Computer Science 204, 1985, pp. 585-594
• Elementary and Liouivillian solutions of linear differential equations
  M.F. Singer, J.H. Davenport
  Lecture Notes in Computer Science 204, 1985, pp. 595-596
• Analytical decoupling, decision of compatibility and partial integration of systems of non-linear ordinary and partial differential equations
  Th. Wolf
  Lecture Notes in Computer Science 204, 1985, pp. 597-598
• Symbolic integration of exponential polynomials
  K. Nehrkorn
  Lecture Notes in Computer Science 204, 1985, pp. 599-600
• A REDUCE package for determining first integrals of autonomous systems of ordinary differential equations
  F. Schwarz
  Lecture Notes in Computer Science 204, 1985, pp. 601-602
• A package of tools for manipulation of sums and series
  M. Arcieri, A. Miola, F. Panasiti
  Lecture Notes in Computer Science 204, 1985, pp. 603-604
• Theory of summation in finite terms
  M. Karr
  Lecture Notes in Computer Science 204, 1985, pp. 605-606
• On improving approximate results of Buchberger's algorithm by Newton's method
  W. Trinks
  Lecture Notes in Computer Science 204, 1985, pp. 608-612