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=36
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the Herbrand-Kleene universe for nondeterministic computations
M. Broy
Theoretical Computer Science
36
(1), 1985, pp. 1-19
Determinacy
\rightarrow
(observation equivalence = trace equivalence)
J. Engelfriet
Theoretical Computer Science
36
(1), 1985, pp. 21-25
Transforming sequential systems into concurrent systems
R. Janicki
Theoretical Computer Science
36
(1), 1985, pp. 27-58
An
\Omega(n^{4/3})
lower bound on the monotone network complexity of the
n^{th}
degree convolution
N. Blum
Theoretical Computer Science
36
(1), 1985, pp. 59-69
Propositional dynamic logic with local assignments
M.L. Tiomkin
,
J.A. Makowsky
Theoretical Computer Science
36
(1), 1985, pp. 71-87
A pumping lemma for real-time deterministic context-free languages
Y. Igarashi
Theoretical Computer Science
36
(1), 1985, pp. 89-97
Construction de codes factorisants
C. De Felice
Theoretical Computer Science
36
(1), 1985, pp. 99-108
On the Chomsky and Stanley's homomorphic characterization of context-free languages
S. Hirose
,
M. Yoneda
Theoretical Computer Science
36
(1), 1985, pp. 109-112
On equality of multiplicity sets of regular languages
K. Ruohonen
Theoretical Computer Science
36
(1), 1985, pp. 113-117
Complex Boolean networks obtained by diagonalization
B. Scarpellini
Theoretical Computer Science
36
(1), 1985, pp. 119-125
On powerdomains and modality
G. Winskel
Theoretical Computer Science
36
(1), 1985, pp. 127-137
A generalised mathematical theory of structured programming
N.E. Fenton
,
R.W. Whitty
,
A.A. Kaposi
Theoretical Computer Science
36
(2,3), 1985, pp. 145-171
Complexity and decidability for chain code picture languages
I.H. Sudborough
,
E. Welzl
Theoretical Computer Science
36
(2,3), 1985, pp. 173-202
Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
J. Demel
,
M. Demlová
,
V. Koubek
Theoretical Computer Science
36
(2,3), 1985, pp. 203-216
A classification of
\omega
-regular languages
M. Kaminski
Theoretical Computer Science
36
(2,3), 1985, pp. 217-229
Improved lower bounds for the cycle detection problem
E. Allender
,
M.M. Klawe
Theoretical Computer Science
36
(2,3), 1985, pp. 231-237
Bounded-depth, polynomial-size circuits for symmetric functions
R. Fagin
,
M.M. Klawe
,
N.J. Pippenger
,
L. Stockmeyer
Theoretical Computer Science
36
(2,3), 1985, pp. 239-250
DAL -- a logic for data analysis
L. Fariñas del Cerro
,
E. Orlowska
Theoretical Computer Science
36
(2,3), 1985, pp. 251-264
The complexity of finding minimum-length generator sequences
M.R. Jerrum
Theoretical Computer Science
36
(2,3), 1985, pp. 265-289
Alternating simple multihead finite automata
H. Matsuno
,
K. Inoue
,
H. Taniguchi
,
I. Takanami
Theoretical Computer Science
36
(2,3), 1985, pp. 291-308
Fast algorithms for the characteristic polynomial
W. Keller-Gehrig
Theoretical Computer Science
36
(2,3), 1985, pp. 309-317
Embeddings of binary trees in lines
K. Diks
Theoretical Computer Science
36
(2,3), 1985, pp. 319-331
Multiplication is the easiest nontrivial arithmetic function
H. Alt
Theoretical Computer Science
36
(2,3), 1985, pp. 333-339
A characterization of reversal-bounded multipushdown machine languages
W. Rytter
,
M. Chrobak
Theoretical Computer Science
36
(2,3), 1985, pp. 341-344
The complexity of counting homeomorphs
G. Farr
,
C. McDiarmid
Theoretical Computer Science
36
(2,3), 1985, pp. 345-348