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=63
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Avoidable patterns on two letters
Ursula Schmidt
Theoretical Computer Science
63
, 1989, pp. 1-17
Stable families of behavioural equivalences
M. Livesey
Theoretical Computer Science
63
, 1989, pp. 19-41
On the relative complexity of hard problems for complexity classes without complete problems
Klaus Ambos-Spies
Theoretical Computer Science
63
, 1989, pp. 43-61
Cohesion of object histories
Seymour Ginsburg
,
Chang-jie Tang
Theoretical Computer Science
63
, 1989, pp. 63-90
A unified framework for disambiguating finite transductions
J. Howard Johnson
Theoretical Computer Science
63
, 1989, pp. 91-111
Generalization from partial parametrization in higher-order type theory
Masami Hagiya
Theoretical Computer Science
63
, 1989, pp. 113-139
Concatenation of inputs in a two-way automaton
Jean-Camille Birget
Theoretical Computer Science
63
, 1989, pp. 141-156
Construction of a family of finite maximal codes
Clelia De Felice
Theoretical Computer Science
63
, 1989, pp. 157-184
Searching with known error probability
Andrzej Pelc
Theoretical Computer Science
63
, 1989, pp. 185-202
Tradeoffs for language recognition on alternating machines
Juraj Hromkovic̑
Theoretical Computer Science
63
, 1989, pp. 203-221
Structural and behavioral equivalence relations in automata networks
Takashi Saito
,
Hidenosuke Nishio
Theoretical Computer Science
63
, 1989, pp. 223-237
On inefficient special cases of
NP
-complete problems
Ding-Zhu Du
,
Ronald V. Book
Theoretical Computer Science
63
, 1989, pp. 239-252
Translation of logic programs into functional fixpoint equations
Georges Gardarin
,
Irène Guessarian
,
Christophe de Maindreville
Theoretical Computer Science
63
, 1989, pp. 253-274
Fixed points in free process algebras, Part I
David B. Benson
,
Jerzy Tiuryn
Theoretical Computer Science
63
, 1989, pp. 275-294
Subgraph isomorphism for biconnected outerplanar graphs in cubic time
Andrzej Lingas
Theoretical Computer Science
63
, 1989, pp. 295-302
Equational logic of circular data type specification
Stephen L. Bloom
,
Zoltan Esik
Theoretical Computer Science
63
, 1989, pp. 303-331
Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
Aldo de Luca
,
Stefano Varricchio
Theoretical Computer Science
63
, 1989, pp. 333-348