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=8
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the covering problem for left-recursive grammars
E. Soisalon-Soininen
Theoretical Computer Science
8
(1), 1979, pp. 1-11
Fixed-point constructions in order-enriched categories
M. Wand
Theoretical Computer Science
8
(1), 1979, pp. 13-30
Tautology testing with a generalized matrix reduction method
W. Bibel
Theoretical Computer Science
8
(1), 1979, pp. 31-44
Finding the intersection of
n
half-spaces in time
O(n\log n)
F.P. Preparata
,
D.E. Muller
Theoretical Computer Science
8
(1), 1979, pp. 45-55
The generating function of the number of subpatterns of a DOL sequence
P. Johansen
Theoretical Computer Science
8
(1), 1979, pp. 57-68
A decision procedure for the order of regular events
K. Hashigushi
Theoretical Computer Science
8
(1), 1979, pp. 69-72
Data types, abstract data types and their specification problem
M.E. Majster
Theoretical Computer Science
8
(1), 1979, pp. 89-127
On the reachability problem for 5-dimensional vector addition systems
John Hopcroft
,
Jean-Jacques Pansiot
Theoretical Computer Science
8
(2), 1979, pp. 135-159
Language operators related to Init
H. Prodinger
,
F.J. Urbanek
Theoretical Computer Science
8
(2), 1979, pp. 161-175
A second step toward the polynomial hierarchy
Theodore P. Baker
,
Alan L. Selman
Theoretical Computer Science
8
(2), 1979, pp. 177-187
The complexity of computing the permanent
L.G. Valiant
Theoretical Computer Science
8
(2), 1979, pp. 189-201
Complexity in mechanized hypothesis formation
P. Pudlák
,
F.N. Springsteel
Theoretical Computer Science
8
(2), 1979, pp. 203-225
Arithmetical hierarchy and complexity of computation
Petr Hájek
Theoretical Computer Science
8
(2), 1979, pp. 227-237
Relations between diagonalization, proof systems, and complexity gaps
Juris Hartmanis
Theoretical Computer Science
8
(2), 1979, pp. 239-253
Une extension du theorme de Winograd
J. Morgenstern
Theoretical Computer Science
8
(2), 1979, pp. 255-259
A new proof of two theorems about rational transductions
A. Arnold
,
M. Latteux
Theoretical Computer Science
8
(2), 1979, pp. 261-263
A discrimination algorithm inside
\lambda-\beta
-calculus
C. Böhm
,
M. Dezani-Ciancaglini
,
P. Peretti
,
S. Ronchi Della Rocca
Theoretical Computer Science
8
(3), 1979, pp. 271-291
Générateurs algébriques et systmes de paires itérantes
J. Beauquier
Theoretical Computer Science
8
(3), 1979, pp. 293-323
A semantically meaningful characterization of reducible flowchart schemes
C.C. Elgot
,
J.C. Shepherdson
Theoretical Computer Science
8
(3), 1979, pp. 325-357
On multiplication in algebraic extension fields
S. Winograd
Theoretical Computer Science
8
(3), 1979, pp. 359-377
Commutation properties and generating sets characterize slices of various synchronization primitives
D. Dolev
Theoretical Computer Science
8
(3), 1979, pp. 379-391
The discrimination theorem holds for combinatory weak reduction
R. Hindley
Theoretical Computer Science
8
(3), 1979, pp. 393-394
Une note sur le cylindre des langages déterministes
J.-M. Autebert
Theoretical Computer Science
8
(3), 1979, pp. 395-399