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

• Unification in conditional equational theories
  H. Hussman
  Lecture Notes in Computer Science 204, 1985, pp. 543-553
• 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
• Space complexity of alternating Turing machines
  M. Alberts
  Lecture Notes in Computer Science 199, 1985, pp. 1-7
• A unifying theorem for algebraic semantics and dynamic logics
  H. Andreka, I. Guessarian, I. Németi
  Lecture Notes in Computer Science 199, 1985, pp. 8-17
• On some ``non-uniform'' complexity measures
  J.L. Balcázar, J. Díaz, J. Gabarró
  Lecture Notes in Computer Science 199, 1985, pp. 18-27
• Fast parallel vertex colouring
  F. Bauernöppel, H. Jung
  Lecture Notes in Computer Science 199, 1985, pp. 28-35
• Muller automata and bi-infinite words
  D. Beauquier
  Lecture Notes in Computer Science 199, 1985, pp. 36-43
• On formal languages, probabilities, paging and decoding algorithms
  J. Beauquier, L. Thimonier
  Lecture Notes in Computer Science 199, 1985, pp. 44-52
• On the restriction of some NP-complete graph problems to permutation graphs
  A. Brandstädt, D. Kratsch
  Lecture Notes in Computer Science 199, 1985, pp. 53-62
• Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic
  A.L. Chistov
  Lecture Notes in Computer Science 199, 1985, pp. 63-69
• Algorithms solving path systems
  B.S. Chlebus
  Lecture Notes in Computer Science 199, 1985, pp. 70-79
• Decidability of confluence for ground term rewriting systems
  M. Dauchet, S. Tison
  Lecture Notes in Computer Science 199, 1985, pp. 80-89
• Lower bounds on the complexity of 1-time only branching programs (Preliminary version)
  P.E. Dunne
  Lecture Notes in Computer Science 199, 1985, pp. 90-99