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

• On the number of DNF maximal relatively arbitrary measures of complexity
  I.P. Cuhrov
  Lecture Notes in Computer Science 278, 1987, pp. 92-94
• Soliton automata
  J. Dassow, H. Jürgensen
  Lecture Notes in Computer Science 278, 1987, pp. 95-102
• On development of dialogue concurrent systems
  A.I. Enikeev
  Lecture Notes in Computer Science 278, 1987, pp. 103-108
• Discrete analogue of the Neumann method is not optimal
  S.M. Ermakov, B.B. Pokhodzey
  Lecture Notes in Computer Science 278, 1987, pp. 109-112
• A simplest probability model of asynchronous iterations
  S.M. Ermakov, A.S. Rasulov
  Lecture Notes in Computer Science 278, 1987, pp. 113-115
• Semantic foundations of programming
  Yu.L. Ershov, S.S. Goncharov, D.I. Sviridenko
  Lecture Notes in Computer Science 278, 1987, pp. 116-122
• Conditions for existence of nontrivial parallel decompositions of sequential machines
  N.V. Evtushenko
  Lecture Notes in Computer Science 278, 1987, pp. 123-126
• On the digital system diagnostics under uncertainty
  A.B. Frolov
  Lecture Notes in Computer Science 278, 1987, pp. 127-131
• The implicating vector problem and its applications to probabilistic and linear automata
  N.Z. Gabbasov
  Lecture Notes in Computer Science 278, 1987, pp. 132-136
• Some asymptotic evaluations of complexity of information searching
  E.E. Gasanov
  Lecture Notes in Computer Science 278, 1987, pp. 137-139
• On the complexity of approximate realization of continuous functions by schemes and formulas in continuous bases
  S.B. Gashkov
  Lecture Notes in Computer Science 278, 1987, pp. 140-144
• Codes, connected with a fraction linear functions group and their decoding
  I.B. Gashkov, V.M. Sidelnikov
  Lecture Notes in Computer Science 278, 1987, pp. 145-149
• On the capabilities of alternating and nondeterministic multitape automata
  D. Geidmanis
  Lecture Notes in Computer Science 278, 1987, pp. 150-154
• Fast parallel algorithms for optimal edge-colouring of some tree-structured graphs
  A. Gibbons, W. Rytter
  Lecture Notes in Computer Science 278, 1987, pp. 155-162
• On the complexity of elementary periodical functions realized by switching circuits
  M.I. Grinchuk
  Lecture Notes in Computer Science 278, 1987, pp. 163-166
• Efficient algorithmic construction of designs
  H.-D.O.F. Gronau
  Lecture Notes in Computer Science 278, 1987, pp. 167-171
• On the complexity of Lie algebras
  H.F. de Groote, J. Heintz, S. Möhler, H. Schmidt
  Lecture Notes in Computer Science 278, 1987, pp. 172-179
• 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