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=129
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the mutual-exclusion problem - A quest for minimal solutions
Uri Abraham
,
Menachem Magidor
Theoretical Computer Science
129
(1), 1994, pp. 1-38
F-semantics for type assignment systems
Hirofumi Yokouchi
Theoretical Computer Science
129
(1), 1994, pp. 39-77
A general storage theorem for integers in call-by-name
\lambda
-calculus
Jean-Louis Krivine
Theoretical Computer Science
129
(1), 1994, pp. 79-94
The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
Cheng-Chia Chen
,
I-Peng Lin
Theoretical Computer Science
129
(1), 1994, pp. 95-121
Correctness of fixpoint transformations
Jiawang Wei
Theoretical Computer Science
129
(1), 1994, pp. 123-142
The role of standardising apart in logic programming
J.C. Shepherdson
Theoretical Computer Science
129
(1), 1994, pp. 143-166
A tableau-like proof procedure for normal modal logics
Zoran Ognjanović
Theoretical Computer Science
129
(1), 1994, pp. 167-186
Regular relations and bicartesian squares
R. Banach
Theoretical Computer Science
129
(1), 1994, pp. 187-192
Depth of proofs, depth of cut-formulas and complexity of cut formulas
Wenhui Zhang
Theoretical Computer Science
129
(1), 1994, pp. 193-206
Clans and regions in 2-structures
A.H. Deutz
,
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
129
(2), 1994, pp. 207-262
Canonical positions for the factors in paperfolding sequences
Jean-Paul Allouche
,
Mireille Bousquet-Mélou
Theoretical Computer Science
129
(2), 1994, pp. 263-278
On the effects of noise and speed on computations
Bernard Delyon
,
Oded Maler
Theoretical Computer Science
129
(2), 1994, pp. 279-291
An efficient parallel algorithm for the single function coarsest partition problem
Joseph F. Jájá
,
Kwan Woo Ryu
Theoretical Computer Science
129
(2), 1994, pp. 293-307
One-way functions and the isomorphism conjecture
K. Ganesan
Theoretical Computer Science
129
(2), 1994, pp. 309-321
The complexity of optimizing finite-state transducers
Craig A. Rich
,
Giora Slutzki
Theoretical Computer Science
129
(2), 1994, pp. 323-336
The inference of tree languages from finite samples: An algebraic approach
Timo Knuutila
,
Magnus Steinby
Theoretical Computer Science
129
(2), 1994, pp. 337-367
Tiling and local rank properties of the Morse sequence
S. Ferenczi
Theoretical Computer Science
129
(2), 1994, pp. 369-383
Variations on a game of Gale (II): Markov strategies
Marion Scheepers
Theoretical Computer Science
129
(2), 1994, pp. 385-396
An algorithm for dynamic subset and intersection testing
D.M. Yellin
Theoretical Computer Science
129
(2), 1994, pp. 397-406
Exponentiation using canonical recoding
ömer Eg̑eciog̑lu
,
Çetin Kaya Koç
Theoretical Computer Science
129
(2), 1994, pp. 407-417
Nonerasing Turing machines: A frontier between a decidable halting problem and universality
M. Margenstern
Theoretical Computer Science
129
(2), 1994, pp. 419-424