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

• Logical characterizations of nonmonotonic TMSs
  Ch. Elkan
  Lecture Notes in Computer Science 379, 1989, pp. 218-224
• Proving correctness of constructor implementations
  J. Farrés-Casals
  Lecture Notes in Computer Science 379, 1989, pp. 225-236
• System simulation and the sensitivity of self-stabilization (extended abstract)
  M.G. Gouda, R.R. Howell, L.E. Rosier
  Lecture Notes in Computer Science 379, 1989, pp. 249-258
• Polynomial-time functions generate SAT: on P-splinters
  L.A. Hemachandra, A. Hoene, D. Siefkes
  Lecture Notes in Computer Science 379, 1989, pp. 259-269
• Generalized definite tree languages
  U. Heuter
  Lecture Notes in Computer Science 379, 1989, pp. 270-280
• Pinwheel scheduling with two distinct numbers
  R. Holte, L. Rosier, I. Tulchinsky, D. Varvel
  Lecture Notes in Computer Science 379, 1989, pp. 281-290
• Testing approximate symmetry in the plane is NP-hard
  S. Iwanowski
  Lecture Notes in Computer Science 379, 1989, pp. 291-304
• Memory and algebra
  C. Jousselin, J.-P. Moskowitz
  Lecture Notes in Computer Science 379, 1989, pp. 305-313
• Integer relations among algebraic numbers
  B. Just
  Lecture Notes in Computer Science 379, 1989, pp. 314-320
• An iterative metric fully abstract semantics for nondeterministic dataflow (extended abstract)
  J.N. Kok
  Lecture Notes in Computer Science 379, 1989, pp. 321-330
• Complexity of decision problems under incomplete information
  W. Kowalczyk
  Lecture Notes in Computer Science 379, 1989, pp. 331-337
• Oracle branching programs and logspace versus \P (extended abstract)
  D.A. Mix Barrington, P. McKenzie
  Lecture Notes in Computer Science 379, 1989, pp. 370-379
• On comparing probabilistic and deterministic automata complexity of languages
  F.M. Ablayev
  Lecture Notes in Computer Science 379, 1989, pp. 599-605
• Computer algebra in physical research of Joint Institute for Nuclear Research
  R.N. Federova, V.P. Gerdt, N.N. Govorun, V.P. Shirikov
  Lecture Notes in Computer Science 378, 1989, pp. 1-10
• Complexity of quantifier elimination in the theory of ordinary differential equations
  D.Yu. Grigoriev
  Lecture Notes in Computer Science 378, 1989, pp. 11-25
• Some algorithms of rational function algebra
  S.A. Abramov
  Lecture Notes in Computer Science 378, 1989, pp. 45-47
• The computer algebra system SIMATH
  R. Böffgen, M.A. Reichert
  Lecture Notes in Computer Science 378, 1989, pp. 48-49
• Computing a lattice basis from a system of generating vectors
  J. Buchmann, M. Pohst
  Lecture Notes in Computer Science 378, 1989, pp. 54-63
• CATFACT: Computer algebraic tools for applications of catastrophe theory
  R.G. Cowell, F.J. Wright
  Lecture Notes in Computer Science 378, 1989, pp. 71-80
• Computer algebra application for investigating integrability of nonlinear evolution systems
  V.P. Gerdt, A.B. Shabat, S.I. Svinolupov, A.Yu. Zharkov
  Lecture Notes in Computer Science 378, 1989, pp. 81-92
• Computer classification of integrable seventh order MKdV-like equations
  V.P. Gerdt, A.Yu. Zharkov
  Lecture Notes in Computer Science 378, 1989, pp. 93-94
• Symbolic computation and the finite element method
  J.P. Fitch, R.G. Hall
  Lecture Notes in Computer Science 378, 1989, pp. 95-96
• Application of Lie group and computer algebra to nonlinear mechanics
  D.M. Klimov, V.M. Rudenko, V.F. Zhuravlev
  Lecture Notes in Computer Science 378, 1989, pp. 97-106
• SCHOONSCHIP for computing of gravitino interaction cross sections in n=2 supergravity
  N.I. Gurin
  Lecture Notes in Computer Science 378, 1989, pp. 116-117
• Laplace transformations in REDUCE 3
  C. Kazasov
  Lecture Notes in Computer Science 378, 1989, pp. 132-133