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

• The optimisation by ``Code Motion'' of user programs for an algebraic manipulation system
  P.D. Pearce, R.J. Hicks
  Lecture Notes in Computer Science 204, 1985, pp. 429-430
• An improved plotting package for VAXIMA
  D.A. Young, P.S. Wang
  Lecture Notes in Computer Science 204, 1985, pp. 431-432
• On logic programs with data-driven computations
  N. Heck, J. Avenhaus
  Lecture Notes in Computer Science 204, 1985, pp. 433-443
• DARWIN, a system designed for the study of enumerative combinatorics
  F. Bergeron, C. Pichet
  Lecture Notes in Computer Science 204, 1985, pp. 444-445
• Correctness proofs of the implementation of abstract data types
  B. Hohlfeld
  Lecture Notes in Computer Science 204, 1985, pp. 446-447
• Using Prolog for constructing geometric objects defined by constraints
  B. Brüderlin
  Lecture Notes in Computer Science 204, 1985, pp. 448-459
• The role of symbolic computation in the management of scientific information
  S. Bandyopadhyay, J.S. Devitt
  Lecture Notes in Computer Science 204, 1985, pp. 460-461
• CIM (Computer Integrated Manufacturing) - A challenge for symbolic computation
  H. Exner, F.D. Fischer
  Lecture Notes in Computer Science 204, 1985, pp. 462-463
• Symbolic and algebraic computation may support secondary education
  H. Coelho
  Lecture Notes in Computer Science 204, 1985, pp. 464-465
• Software toolkit for input stage measurement in symbolic computation
  M. Caciotta, F. Iannucci
  Lecture Notes in Computer Science 204, 1985, pp. 466-467
• The algebraic manipulation systems on the electrical power systems
  P. Boninfante, G.M. Veca
  Lecture Notes in Computer Science 204, 1985, pp. 468-469
• A new method of computing fundamental units in algebraic number fields
  U. Fincke, M. Pohst
  Lecture Notes in Computer Science 204, 1985, pp. 470-478
• The generalized Voronoi-algorithm in totally real algebraic number fields
  J. Buchmann
  Lecture Notes in Computer Science 204, 1985, pp. 479-486
• An algorithm for the computation of perfect polyhedral cones over real quadratic number fields
  H. Ong, D. Golke
  Lecture Notes in Computer Science 204, 1985, pp. 487-488
• Explicit determination of non-trivial torsion structures of elliptic curves over quadratic number fields
  M.A. Reichert
  Lecture Notes in Computer Science 204, 1985, pp. 489-490
• P-adic algorithms and the computation of zeros of p-adic L-functions
  K. Lamprecht, H.G. Zimmer
  Lecture Notes in Computer Science 204, 1985, pp. 491-502
• On the solution of the diophantine equation G_n=p^z
  A. Pethö
  Lecture Notes in Computer Science 204, 1985, pp. 503-512
• Term orderings on the polynomial ring
  L. Robbiano
  Lecture Notes in Computer Science 204, 1985, pp. 513-517
• An algorithmic approach to local rings
  F. Mora
  Lecture Notes in Computer Science 204, 1985, pp. 518-525
• A reduction strategy for the Taylor resolution
  H.M. Möller
  Lecture Notes in Computer Science 204, 1985, pp. 526-534
• From polynomials to Galois groups
  D. Ford, J. McKay
  Lecture Notes in Computer Science 204, 1985, pp. 535-536
• A system for parallel computer algebra programs
  S.M. Watt
  Lecture Notes in Computer Science 204, 1985, pp. 537-538
• Unification in parallel with refined linearity test: An example of recursive network structure in FP2, a functional parallel programming language
  R. Caferra, P. Jorrand
  Lecture Notes in Computer Science 204, 1985, pp. 539-540
• The parallel L-machine for symbolic computation
  B. Buchberger
  Lecture Notes in Computer Science 204, 1985, pp. 541-542
• Unification in conditional equational theories
  H. Hussman
  Lecture Notes in Computer Science 204, 1985, pp. 543-553