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

• Reliable networks from unreliable gates with almost minimal complexity
  D. Uhlig
  Lecture Notes in Computer Science 278, 1987, pp. 462-469
• On the standard and pseudostandard star height of regular sets
  F.I. Validov
  Lecture Notes in Computer Science 278, 1987, pp. 470-471
• To automation of theorem synthesis
  S.N. Vassiljev
  Lecture Notes in Computer Science 278, 1987, pp. 472-476
• On efficiency of prefix word-encoding of binary messages
  E.G. Vorobeva
  Lecture Notes in Computer Science 278, 1987, pp. 477-478
• Deductive program synthesis and Markov's principle
  A.A. Voronkov
  Lecture Notes in Computer Science 278, 1987, pp. 479-482
• Complexity of the problem of approximation of stochastic matrix by rational elements
  V.M. Zacharov, S.E. Kuznetsov
  Lecture Notes in Computer Science 278, 1987, pp. 483-487
• To the functional equivalence of Turing machines
  V.A. Zakharov
  Lecture Notes in Computer Science 278, 1987, pp. 488-491
• Theorem proving in intermediate and modal logics
  M.V. Zakhar'yashchev
  Lecture Notes in Computer Science 278, 1987, pp. 492-496
• The analysis of concurrent logic control algorithms
  A.D. Zakrevskii
  Lecture Notes in Computer Science 278, 1987, pp. 497-500
• On a connection between the resolution method and the inverse method
  N.K. Zamov
  Lecture Notes in Computer Science 278, 1987, pp. 501-505