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

• The new way of probabilistic compact testing
  A.S. Barashko
  Lecture Notes in Computer Science 278, 1987, pp. 45-47
• Computational problems in alphabetic coding theory
  M.Yu. Baryshev, L.P. Zhil'tzova, A.A. Markov
  Lecture Notes in Computer Science 278, 1987, pp. 48-50
• On the synthesis of ``irredundant'' automata from a finite set of experiments
  S.A. Bogomolov
  Lecture Notes in Computer Science 278, 1987, pp. 51-52
• On the equivalence problem of states for cellular automata
  A.A. Bolotov
  Lecture Notes in Computer Science 278, 1987, pp. 53-54
• Arsenals and lower bounds
  L. Budach
  Lecture Notes in Computer Science 278, 1987, pp. 55-64
• Chain-like model of programs communication
  R.G. Bukharajev, A.I. Enikeev, I.I. Makarov
  Lecture Notes in Computer Science 278, 1987, pp. 65-67
• Structor automata
  R.G. Bukharajev, I.R. Nasirov
  Lecture Notes in Computer Science 278, 1987, pp. 68-73
• On A-completeness for some classes of bounded determinate functions
  B.A. Buyevich
  Lecture Notes in Computer Science 278, 1987, pp. 74-77
• Structure synthesis of parallel programs (methodology and tools)
  G.E. Cejtlin, E.L. Jushchenko
  Lecture Notes in Computer Science 278, 1987, pp. 78-81
• Saturating flows in networks
  B.S. Chlebus, M. Chrobak, K. Diks
  Lecture Notes in Computer Science 278, 1987, pp. 82-91
• 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