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: Journal=Theor.~Comput.~Sci. AND YEAR=1987
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient frequent connected subgraph mining in graphs of bounded tree-width
Tamás̑ Horváth
,
Jan Ramon
Theoretical Computer Science
411
(31-33), 2010, pp. 2784-2797
A categorical treatment of pre- and post-conditions
E.G. Wagner
Theoretical Computer Science
53
(1), 1987, pp. 3-24
Classical and incremental attribute evaluation by means of recursive procedures
G. Filé
Theoretical Computer Science
53
(1), 1987, pp. 25-65
Probabilistic Ianov's schemes
D. Frutos Escrig
Theoretical Computer Science
53
(1), 1987, pp. 67-97
Random walks, Gaussian processes and list structures
G. Louchard
Theoretical Computer Science
53
(1), 1987, pp. 99-124
Building exact computation sequences
A. Pelin
,
J.H. Gallier
Theoretical Computer Science
53
(1), 1987, pp. 125-150
Derivation of efficient programs for computing sequences of actions
A. Pettorossi
Theoretical Computer Science
53
(1), 1987, pp. 151-167
Language complexity on the synchronous anonymous ring
H. Attiya
,
Y. Mansour
Theoretical Computer Science
53
(2-3), 1987, pp. 169-185
On generators of rational
\omega
-power languages
I. Litovsky
,
E. Timmerman
Theoretical Computer Science
53
(2-3), 1987, pp. 187-200
A hierarchy of polynomial time lattice basis reduction algorithms
C.P. Schnorr
Theoretical Computer Science
53
(2-3), 1987, pp. 201-224
Observation equivalence as a testing equivalence
S. Abramsky
Theoretical Computer Science
53
(2-3), 1987, pp. 225-241
On a representation of tree automata
Z. ésik
,
F. Gecseg
Theoretical Computer Science
53
(2-3), 1987, pp. 243-255
The
NP
-completeness of Steiner tree and dominating set for chordal bipartite graphs
H. Müller
,
A. Brandstädt
Theoretical Computer Science
53
(2-3), 1987, pp. 257-265
On the planar monotone computation of Boolean functions
M. Beynon
,
J. Buckle
Theoretical Computer Science
53
(2-3), 1987, pp. 267-279
The generalized packet routing problem
D. Peleg
,
E. Upfal
Theoretical Computer Science
53
(2-3), 1987, pp. 281-293
Optimal parallel parsing of bracket languages
W. Rytter
,
R. Giancarlo
Theoretical Computer Science
53
(2-3), 1987, pp. 295-306
Cyclic automata
M. Garzon
Theoretical Computer Science
53
(2-3), 1987, pp. 307-317
Repeatable words for substitution
T. Nishida
,
Y. Kobuchi
Theoretical Computer Science
53
(2-3), 1987, pp. 319-333
An intensional characterization of the largest bisimulation
L. Hallnas
Theoretical Computer Science
53
(2-3), 1987, pp. 335-343
Geometric containment and vector dominance
N. Santoro
,
J.B. Sidney
,
S.J. Sidney
,
J. Urrutia
Theoretical Computer Science
53
(2-3), 1987, pp. 345-352
Word operation definable in the typed lambda -calculus
M. Zaionc
Theoretical Computer Science
52
(1-2), 1987, pp. 1-14
On helping by robust oracle machines
K.I. Ko
Theoretical Computer Science
52
(1-2), 1987, pp. 15-36
On 'On graph rewritings'
R. Kennaway
Theoretical Computer Science
52
(1-2), 1987, pp. 37-58
On regular trace languages
J. Sakarovitch
Theoretical Computer Science
52
(1-2), 1987, pp. 59-75
Factoring polynomials and primitive elements for special primes
Joachim von zur Gathen
Theoretical Computer Science
52
(1/2), 1987, pp. 77-89
Seiten 1
2
3
4
>