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.
Bounded DL languages
T. Head
,
B. Lando
Theoretical Computer Science
51
(3), 1987, pp. 255-264
Honest polynomial degrees and P=?NP
S. Homer
,
T.J. Long
Theoretical Computer Science
51
(3), 1987, pp. 265-280
Literal shuffle (formal languages)
B. Berard
Theoretical Computer Science
51
(3), 1987, pp. 281-299
On purely morphic characterizations of context-free languages
T. Yokomori
Theoretical Computer Science
51
(3), 1987, pp. 301-308
A fixpoint semantics of Horn sentences based on substitution sets
S. Yamasaki
,
M. Yoshida
,
S. Doshita
Theoretical Computer Science
51
(3), 1987, pp. 309-324
Reversal-bounded nondeterministic multicounter machines and complementation
J. Hromkovic̑
Theoretical Computer Science
51
(3), 1987, pp. 325-330
On the computational complexity of the general discrete Fourier transform
T. Beth
Theoretical Computer Science
51
(3), 1987, pp. 331-339
Parallel string matching with
k
mismatches
Z. Galil
,
R. Giancarlo
Theoretical Computer Science
51
(3), 1987, pp. 341-348
Linear logic
J.-Y. Girard
Theoretical Computer Science
50
(1), 1987, pp. 1-102
Categorical aspects of data type constructors
J.W. Gray
Theoretical Computer Science
50
(2), 1987, pp. 103-135
Algebraic specifications of computable and semicomputable data types
J.A. Bergstra
,
J.V. Tucker
Theoretical Computer Science
50
(2), 1987, pp. 137-181
A six-state minimal time solution to the firing squad synchronization problem
J. Mazoyer
Theoretical Computer Science
50
(2), 1987, pp. 183-238
Refusal testing
I. Phillips
Theoretical Computer Science
50
(3), 1987, pp. 241-284
Total correctness in nonstandard logics of programs
I. Sain
Theoretical Computer Science
50
(3), 1987, pp. 285-321
Canonical constraints for parameterized data types
E.G. Wagner
,
H. Ehrig
Theoretical Computer Science
50
(3), 1987, pp. 323-349
Brzozowski hierarchy of
\omega
-languages
M. Takahashi
Theoretical Computer Science
49
(1), 1987, pp. 1-12
Units of special Church-Rosser monoids
C.C. Squier
Theoretical Computer Science
49
(1), 1987, pp. 13-22
Grammars, derivation modes and properties of indexed and type-0 languages
R. Parchmann
,
J. Duske
Theoretical Computer Science
49
(1), 1987, pp. 23-42
The Church-Rosser property for ground term-rewriting systems is decidable
M. Oyamaguchi
Theoretical Computer Science
49
(1), 1987, pp. 43-79
Solving related two- and three-dimensional linear programming problems in logarithmic time
Leo J. Guibas
,
Jorge Stolfi
,
Kenneth L. Clarkson
Theoretical Computer Science
49
(1), 1987, pp. 81-84
Infinite streams and finite observations in the semantics of uniform concurrency
J.W. de Bakker
,
J.-J.C. Meyer
,
E.-R. Olderog
Theoretical Computer Science
49
(2-3), 1987, pp. 87-112
Applications of an infinite square-free co-CFL
M.G. Main
,
W. Bucher
,
D. Haussler
Theoretical Computer Science
49
(2-3), 1987, pp. 113-119
An algebraic theory of fair asynchronous communicating processes
M. Hennessy
Theoretical Computer Science
49
(2-3), 1987, pp. 121-143
Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
L. Bougé
Theoretical Computer Science
49
(2-3), 1987, pp. 145-169
Distributed algorithms in synchronous broadcasting networks
Z. Galil
,
G.M. Landau
,
M.M. Yung
Theoretical Computer Science
49
(2-3), 1987, pp. 171-184
Seiten
<
1
2
3
4
>