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
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Estimation algorithms of infinite graphs percolation threshold
M.V. Men'shikov
,
S.A. Zuev
Lecture Notes in Computer Science
278
, 1987, pp. 310-313
A solving of problem on technological models
V.Yu. Mikhailov
Lecture Notes in Computer Science
278
, 1987, pp. 314-317
Some formal systems of the logic programming
G.E. Mints
Lecture Notes in Computer Science
278
, 1987, pp. 318-322
On the programs with finite development
M.Iu. Moshkov
Lecture Notes in Computer Science
278
, 1987, pp. 323-327
D
-representing code problem solution
G.L. Movsisian
,
Zh.G. Margarian
Lecture Notes in Computer Science
278
, 1987, pp. 328-331
Metric properties of random sequence
R.G. Mubarakzianov
Lecture Notes in Computer Science
278
, 1987, pp. 332-333
Adaptive strategies for partially observable controlled random series
V.I. Mukhin
Lecture Notes in Computer Science
278
, 1987, pp. 334-338
The degrees of nondeterminism in pushdown automata
Il.R. Nasyrov
Lecture Notes in Computer Science
278
, 1987, pp. 339-342
Statistically effective algorithms for automata control
V.N. Noskov
Lecture Notes in Computer Science
278
, 1987, pp. 343-346
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
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>