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
[2]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=1987
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A Yacc extension for LRR grammar parsing
B. Seite
Theoretical Computer Science
52
(1-2), 1987, pp. 91-143
Satisfiability in many-valued sentential logic is
NP
-complete
D. Mundici
Theoretical Computer Science
52
(1-2), 1987, pp. 145-153
The parallel complexity of deadlock detection
P. Spirakis
Theoretical Computer Science
52
(1-2), 1987, pp. 155-163
Topological characterizations of infinite tree languages
T. Moriya
Theoretical Computer Science
52
(1-2), 1987, pp. 165-171
The membership and equivalence problems for picture languages
C. Kim
,
I.H. Sudborough
Theoretical Computer Science
52
(3), 1987, pp. 177-191
Distributed sorting algorithms for multi-channel broadcast networks
J.M. Marberg
,
E. Gafni
Theoretical Computer Science
52
(3), 1987, pp. 193-203
A syntactic theory of sequential control
M. Felleisen
,
D.P. Friedman
,
E. Kohlbecker
,
B. Duba
Theoretical Computer Science
52
(3), 1987, pp. 205-237
Models of lower-bounds proofs
R.G. Nigmatullin
Theoretical Computer Science
52
(3), 1987, pp. 239-249
On characterizations of the class PSPACE/poly
J.L. Balcázar
,
J. Díaz
,
J. Gabarró
Theoretical Computer Science
52
(3), 1987, pp. 251-267
Stationary deterministic flows. II. The single-server queue
E. Gelenbe
,
D. Finkel
Theoretical Computer Science
52
(3), 1987, pp. 269-280
Domain-independent formulas and databases
R.W. Topor
Theoretical Computer Science
52
(3), 1987, pp. 281-306
On flowchart theories. II. The nondeterministic case
G. Stefanescu
Theoretical Computer Science
52
(3), 1987, pp. 307-340
Comments on 'Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages'
F.J. Brandenburg
Theoretical Computer Science
52
(3), 1987, pp. 341-342
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
Seiten
<
1
2
3
4
>