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 Volume=51
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the syntax of Martin-Lof's type theories
A.S. Troelstra
Theoretical Computer Science
51
(1-2), 1987, pp. 1-26
Analysis of Dehn's algorithm by critical pairs
P. Le Chenadec
Theoretical Computer Science
51
(1-2), 1987, pp. 27-52
More complicated questions about maxima and minima, and some closures of
NP
K.W. Wagner
Theoretical Computer Science
51
(1-2), 1987, pp. 53-80
Characteristics of graph languages generated by edge replacement
A. Habel
,
H.J. Kreowski
Theoretical Computer Science
51
(1-2), 1987, pp. 81-115
A note on the characterisation theorem for algebraic generators
J. Beauquier
,
F. Gire
Theoretical Computer Science
51
(1-2), 1987, pp. 117-127
On the consistency of Koomen's fair abstraction rule
J.C.M. Baeten
,
J.A. Bergstra
,
J.W. Klop
Theoretical Computer Science
51
(1-2), 1987, pp. 129-176
Diagonalizations over polynomial time computable sets
K. Ambos-Spies
,
H. Fleischhack
,
H. Huwig
Theoretical Computer Science
51
(1-2), 1987, pp. 177-204
A characterization of passing compatibility for parameterized specifications
F. Orejas
Theoretical Computer Science
51
(1-2), 1987, pp. 205-214
On unambiguous reductions of monoids of unambiguous relations
A. Carpi
Theoretical Computer Science
51
(1-2), 1987, pp. 215-220
An
O(n^{\log k}2^{n/2})
time and
O(k2^{n/k})
space algorithm for certain
NP
-complete problems
J. Vyskoc̆
Theoretical Computer Science
51
(1-2), 1987, pp. 221-227
Constructive universal algebra: an introduction
E.G. Belaga
Theoretical Computer Science
51
(1-2), 1987, pp. 229-238
On the time required to sum
n
semigroup elements on a parallel machine with simultaneous writes
I. Parberry
Theoretical Computer Science
51
(1-2), 1987, pp. 239-247
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