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

• Stensor
  L. Hörnfeldt
  Lecture Notes in Computer Science 204, 1985, pp. 165
• STENSOR uses disc automatically for very large computations
  L. Hörnfeldt
  Lecture Notes in Computer Science 204, 1985, pp. 317
• A program system for factorization of polynomials with rational coefficients
  M. Kreißig
  Lecture Notes in Computer Science 204, 1985, pp. 155
• A solution to the polynomial Hensel-code conversion problem
  A. Mukhopadhyay
  Lecture Notes in Computer Science 204, 1985, pp. 327
• On some laws in PSL(2,q)
  D.B. Nikolova
  Lecture Notes in Computer Science 204, 1985, pp. 245
• Application of computer algebra to the theory of the vibration-rotational spectra of diatomic molecules
  J.F. Ogilvie
  Lecture Notes in Computer Science 204, 1985, pp. 205
• THKLISP as a base of formula manipulation systems
  P. Richter
  Lecture Notes in Computer Science 204, 1985, pp. 156
• A program system for root finding
  W. Riedel
  Lecture Notes in Computer Science 204, 1985, pp. 154
• Demonstration of REDUCE3 as implemented on a stand-alone MOTOROLA 68000 based microcomputer
  M. Taraniuk, P.C. Mackeonis
  Lecture Notes in Computer Science 204, 1985, pp. 31
• Symbol manipulation and symmetry breaking
  H. Zassenhaus
  Lecture Notes in Computer Science 204, 1985, pp. 607
• Algorithms for polynomial division
  D. Bini, V. Pan
  Lecture Notes in Computer Science 204, 1985, pp. 1-3
• Sparse Hensel lifting
  E. Kaltofen
  Lecture Notes in Computer Science 204, 1985, pp. 4-17
• HEUGCD: How elementary upperbounds generate cheaper data
  J. Davenport, J. Padget
  Lecture Notes in Computer Science 204, 1985, pp. 18-28
• Gaussian elimination over a Euclidean ring
  C.S. Iliopoulos
  Lecture Notes in Computer Science 204, 1985, pp. 29-30
• The Scratchpad II computer algebra language and system
  R.S. Sutor
  Lecture Notes in Computer Science 204, 1985, pp. 32-33
• The SAC-2 computer algebra system
  G.E. Collins
  Lecture Notes in Computer Science 204, 1985, pp. 34-35
• DOE-MACSYMA: Progress report
  G.J. Carrette, L.P. Harten
  Lecture Notes in Computer Science 204, 1985, pp. 36-39
• Towards practical implementations of syllogistic
  S. Ghelfo, E.G. Omodeo
  Lecture Notes in Computer Science 204, 1985, pp. 40-49
• Path resolution and semantic graphs
  N.V. Murray, E. Rosenthal
  Lecture Notes in Computer Science 204, 1985, pp. 50-63
• Fast subsumption algorithms
  G. Gottlob, A. Leitsch
  Lecture Notes in Computer Science 204, 1985, pp. 64-77
• Substitution expressions: Extracting solutions of non-Horn clause proofs
  K. Aspetsberger
  Lecture Notes in Computer Science 204, 1985, pp. 78-86
• The complexity of elementary problems in Archimedean ordered groups
  V. Weispfenning
  Lecture Notes in Computer Science 204, 1985, pp. 87-88
• Progress on the equivalence problem
  J.E. Åman, R.A. d'Inverno, G.C. Joly, M.A.H. MacCallum
  Lecture Notes in Computer Science 204, 1985, pp. 89-98
• Symbol representations of noncommutative algebras
  W. Lassner
  Lecture Notes in Computer Science 204, 1985, pp. 99-115
• Algebraic computations in elementary catastrophe theory
  K. Millington, F.J. Wright
  Lecture Notes in Computer Science 204, 1985, pp. 116-125