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=66
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the order of approximation in approximative triadic decompositions of tensors
Thomas Lehmkuhl
,
Thomas Lickteig
Theoretical Computer Science
66
, 1989, pp. 1-14
On monotone simulations of nonmonotone networks
Paul E. Dunne
Theoretical Computer Science
66
, 1989, pp. 15-25
Abstraction problems in combinatory logic: A compositive approach
Adolfo Piperno
Theoretical Computer Science
66
, 1989, pp. 27-43
Observations concerning a public-key cryptosystem based on iterated morphisms
Jarkko Kari
Theoretical Computer Science
66
, 1989, pp. 45-53
An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group
Zhang Luo Xin
Theoretical Computer Science
66
, 1989, pp. 55-63
On
LC(0)
grammars and languages
Rieks op den Akker
Theoretical Computer Science
66
, 1989, pp. 65-85
The complexity of Gentzen systems for propositional logic
Alasdair Urquhart
Theoretical Computer Science
66
, 1989, pp. 87-97
On sets of solutions to combinator equations
Rick Statman
Theoretical Computer Science
66
, 1989, pp. 99-104
Weakly adaptive comparison searching
Andrzej Pelc
Theoretical Computer Science
66
, 1989, pp. 105-111
Functions computed by monotone Boolean formulas with no repeated variables
Daniele Mundici
Theoretical Computer Science
66
, 1989, pp. 113-114
On the Knuth-Bendix completion for concurrent processes
Volker Diekert
Theoretical Computer Science
66
, 1989, pp. 117-136
Lower bounds for sorting of sums
Martin Dietzfelbinger
Theoretical Computer Science
66
, 1989, pp. 137-155
Testing the necklace condition for shortest tours and optimal factors in the plane
Herbert Edelsbrunner
,
Günter Rote
,
Emo Welzl
Theoretical Computer Science
66
, 1989, pp. 157-180
Heuristics for optimum binary search trees and minimum weight triangulation problems
Christos Levcopoulos
,
Andrzej Lingas
,
Jörg R. Sack
Theoretical Computer Science
66
, 1989, pp. 181-203
A logico-algebraic approach to the model theory of knowledge
M.A. Nait Abdallah
Theoretical Computer Science
66
, 1989, pp. 205-232
Inverse monoids of dot-depth two
Pascal Weil
Theoretical Computer Science
66
, 1989, pp. 233-245
Language-theoretical representations of
\omega
-languages
Hideki Yamasaki
Theoretical Computer Science
66
, 1989, pp. 247-254
Training sequences
Dana Angluin
,
William I. Gasarch
,
Carl H. Smith
Theoretical Computer Science
66
, 1989, pp. 255-272
Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through
180^\circ
-rotation
Akira Ito
,
Katsushi Inoue
,
Itsuo Takanami
Theoretical Computer Science
66
, 1989, pp. 273-287
Generation of invertible functions
G. Jacopini
,
P. Mentrasti
Theoretical Computer Science
66
, 1989, pp. 289-297
Weak second order characterizations of various program verification systems
J.A. Makowsky
,
I. Sain
Theoretical Computer Science
66
, 1989, pp. 299-321
On pseudo-
c\beta
-normal form in combinatory logic
Mohamed Mezgiche
Theoretical Computer Science
66
, 1989, pp. 323-331
Probabilistic termination versus fair termination
Michael Tiomkin
Theoretical Computer Science
66
, 1989, pp. 333-340
A necessary condition for the rationality of the zeta function of a regular language
Juha Honkala
Theoretical Computer Science
66
, 1989, pp. 341-347