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
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Reliable networks from unreliable gates with almost minimal complexity
D. Uhlig
Lecture Notes in Computer Science
278
, 1987, pp. 462-469
On the standard and pseudostandard star height of regular sets
F.I. Validov
Lecture Notes in Computer Science
278
, 1987, pp. 470-471
To automation of theorem synthesis
S.N. Vassiljev
Lecture Notes in Computer Science
278
, 1987, pp. 472-476
On efficiency of prefix word-encoding of binary messages
E.G. Vorobeva
Lecture Notes in Computer Science
278
, 1987, pp. 477-478
Deductive program synthesis and Markov's principle
A.A. Voronkov
Lecture Notes in Computer Science
278
, 1987, pp. 479-482
Recent developments in the theory of learning
L.G. Valiant
Lecture Notes in Computer Science
267
, 1987, pp. 563
Probability and plurality for aggregations of learning machines
L. Pitt
,
C.H. Smith
Lecture Notes in Computer Science
267
, 1987, pp. 1-10
Logic programming with ions
M.A. Nait Abdallah
Lecture Notes in Computer Science
267
, 1987, pp. 11-20
Inverse image analysis
P. Dybjer
Lecture Notes in Computer Science
267
, 1987, pp. 21-30
A unification algorithm for confluent theories
S. Hölldobler
Lecture Notes in Computer Science
267
, 1987, pp. 31-41
On the Knuth-Bendix completion for concurrent processes
V. Diekert
Lecture Notes in Computer Science
267
, 1987, pp. 42-53
On word problems in equational theories
J. Hsiang
,
M. Rusinowitch
Lecture Notes in Computer Science
267
, 1987, pp. 54-71
Semantics for nondeterministic asynchronous broadcast networks
R.K. Shyamasundar
,
K.T. Narayana
,
T. Pitassi
Lecture Notes in Computer Science
267
, 1987, pp. 72-83
Another look at abstraction in process algebra
J.C.M. Baeten
,
R.J. van Glabbeek
Lecture Notes in Computer Science
267
, 1987, pp. 84-94
A timed failures model for extended communicating processes
R. Gerth
,
A. Boucher
Lecture Notes in Computer Science
267
, 1987, pp. 95-114
Readiness semantics for regular processes with silent actions
S. Graf
,
J. Sifakis
Lecture Notes in Computer Science
267
, 1987, pp. 115-125
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>