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 YEAR=1987

• Efficient algorithmic construction of designs
  H.-D.O.F. Gronau
  Lecture Notes in Computer Science 278, 1987, pp. 167-171
• A characterization of sequential machines by means of their behaviour fragments
  I.S. Grunsky
  Lecture Notes in Computer Science 278, 1987, pp. 180-184
• Some observations about NP complete sets
  J. Hartmanis
  Lecture Notes in Computer Science 278, 1987, pp. 185-196
• Three-dimensional traps and barrages for cooperating automata (extended abstract)
  A. Hemmerling
  Lecture Notes in Computer Science 278, 1987, pp. 197-203
• Efficient implementation of structural recursion
  K. Indermark, H. Klaeren
  Lecture Notes in Computer Science 278, 1987, pp. 204-213
• Minimal numberings of the vertices of trees-approximate approach
  M.A. Iordanskii
  Lecture Notes in Computer Science 278, 1987, pp. 214-217
• Dyck_1-reductions of context-free languages
  M. Jantzen, M. Kudlek, K.-J. Lange, H. Persen
  Lecture Notes in Computer Science 278, 1987, pp. 218-227
• Information flow and width of branching programs (extended abstract)
  S.P. Jukna
  Lecture Notes in Computer Science 278, 1987, pp. 228-230
• On some operations of partial monotone boolean function simplifying
  L.M. Karahanjan, A.A. Sapozhenko
  Lecture Notes in Computer Science 278, 1987, pp. 231-233
• On complexity of computations with limited memory
  N.A. Karpova
  Lecture Notes in Computer Science 278, 1987, pp. 234-235
• On the problem of completeness for the regular mappings
  K.V. Kolyada
  Lecture Notes in Computer Science 278, 1987, pp. 236-238
• The number and the structure of typical Sperner and k-non-separable families of subsets of a finite set
  A.D. Korshunov
  Lecture Notes in Computer Science 278, 1987, pp. 239-243
• A criterion of polynomial lower bounds of combinational complexity
  N.K. Kossovsky
  Lecture Notes in Computer Science 278, 1987, pp. 244-245
• On generalized process logic
  V.E. Kotov, L.A. Cherkasova
  Lecture Notes in Computer Science 278, 1987, pp. 246-250
• Verification of programs with higher-order arrays
  W. Kowalczyk, P. Urzycyn
  Lecture Notes in Computer Science 278, 1987, pp. 251-258
• On the complexity of analyzing experiments for checking local faults of an automaton
  V.A. Kozlovskiy
  Lecture Notes in Computer Science 278, 1987, pp. 259-262
• Exponential lower bounds for real-time branching programs
  K. Kriegel, S. Waack
  Lecture Notes in Computer Science 278, 1987, pp. 263-267
• On the conditions of supplementicity in functional systems
  V.B. Kudrjavtzev
  Lecture Notes in Computer Science 278, 1987, pp. 268-271
• The problem of minimal implicating vector
  S.E. Kuznetsov, N.N. Nurmeev, F.I. Salimov
  Lecture Notes in Computer Science 278, 1987, pp. 273-278
• Built-in self-testing of logic circuits using imperfect duplication
  R.Kh. Latypov
  Lecture Notes in Computer Science 278, 1987, pp. 279-283
• Algebrae with approximation and recursive data structures
  A.A. Letichevsky
  Lecture Notes in Computer Science 278, 1987, pp. 284-287
• Procedural implementation of algebraic specifications of abstract data types
  I.A. Lomazova
  Lecture Notes in Computer Science 278, 1987, pp. 288-292
• On the complexity of realizing some systems of the functions of the algebra of logic by contact and generalized contact circuits
  S.A. Lozkin, M.A. Koshkin
  Lecture Notes in Computer Science 278, 1987, pp. 293-296
• On construction of a complete system of compression functions and on complexity of monotone realization of threshold boolean functions
  S.A. Lozkin, A.A. Semenov
  Lecture Notes in Computer Science 278, 1987, pp. 297-300
• The power of nondeterminism in polynomial-size bounded-width branching programs
  C. Meinel
  Lecture Notes in Computer Science 278, 1987, pp. 302-309