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

• Linear test procedures of recognition
  V.I. Pereyaslavsky
  Lecture Notes in Computer Science 278, 1987, pp. 347-348
• Evaluation of cardinalities of some families of \xi-classes in P{\aleph_0}
  I.G. Perfilyeva
  Lecture Notes in Computer Science 278, 1987, pp. 349-353
• On the temporal complexity of boolean mappings realizations in two-dimensional homogeneous automata
  A.S. Podkolzin
  Lecture Notes in Computer Science 278, 1987, pp. 354-358
• On approximate solution of the problem of equivalent transformations of programs
  R.I. Podlovc̑enko
  Lecture Notes in Computer Science 278, 1987, pp. 359-363
• Randomized parallel computation
  S. Rajasekaran, J.H. Reif
  Lecture Notes in Computer Science 278, 1987, pp. 364-376
• On checking correctness of some classes of control systems
  N.P. Redkin
  Lecture Notes in Computer Science 278, 1987, pp. 377-382
• The parallel complexity of some arithmetic and algebraic operations
  I.K. Rystsov
  Lecture Notes in Computer Science 278, 1987, pp. 383-385
• On difficulties of solving a problem of decomposition of the system of boolean equations
  A.A. Safarian
  Lecture Notes in Computer Science 278, 1987, pp. 386-388
• The number of fuzzy monotone functions
  A.A. Sapozhenko
  Lecture Notes in Computer Science 278, 1987, pp. 389-390
• Bounded set theory and polynomial computability
  V.Yu. Sazonov
  Lecture Notes in Computer Science 278, 1987, pp. 391-395
• Index sets of factor-objects of the Post numbering
  V.L. Selivanov
  Lecture Notes in Computer Science 278, 1987, pp. 396-400
• On realization of boolean functions by schemes consisting of checked elements
  N.A. Shkalikova
  Lecture Notes in Computer Science 278, 1987, pp. 401-405
• The complexity of the sequential choice mechanism
  L.A. Sholomov
  Lecture Notes in Computer Science 278, 1987, pp. 406-408
• Nondeterministic finite algorithmic procedures as the models of abstract computability
  V.D. Soloviev
  Lecture Notes in Computer Science 278, 1987, pp. 409-411
• The reducibility of random sequences by automata
  V.R. Solovieva
  Lecture Notes in Computer Science 278, 1987, pp. 412-413
• On structure complexity of normal basis of finite field
  S.A. Stepanov, I.E. Shparlinskiy
  Lecture Notes in Computer Science 278, 1987, pp. 414-416
• On comparison of boolean bases
  V.A. Stetsenko
  Lecture Notes in Computer Science 278, 1987, pp. 417-419
• A tradeoff between pagenumber and width of book embeddings of graphs
  E. Stöhr
  Lecture Notes in Computer Science 278, 1987, pp. 420-423
• On metric properties of automata and \epsilon-approximation of automaton mappings
  A.S. Strogalov
  Lecture Notes in Computer Science 278, 1987, pp. 424-427
• Algorithmization of obtaining the converse comparison theorems based on solving a logical equation
  E.A. Sumenkov
  Lecture Notes in Computer Science 278, 1987, pp. 428-431
• Synthesis of universal finite automats
  A.A. Sytnik
  Lecture Notes in Computer Science 278, 1987, pp. 432-434
• Complexity gaps of Turing machines on infinite words
  D. Taimina
  Lecture Notes in Computer Science 278, 1987, pp. 436-439
• Distributed infimum approximation
  G. Tel
  Lecture Notes in Computer Science 278, 1987, pp. 440-447
• On the number of keys in relational databases
  B. Thalheim
  Lecture Notes in Computer Science 278, 1987, pp. 448-455
• Complexity and depths of formulas realizing functions from closed classes
  A.B. Ugol'nikov
  Lecture Notes in Computer Science 278, 1987, pp. 456-461