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=40
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On three-element codes
J. Karhumäki
Theoretical Computer Science
40
(1), 1985, pp. 3-11
Rational languages and the Burnside problem
A. Restivo
,
C. Reutenauer
Theoretical Computer Science
40
(1), 1985, pp. 13-30
The smallest automaton recognizing the subwords of a text
A. Blumer
,
J. Blumer
,
D. Haussler
,
A. Ehrenfeucht
,
M.T. Chen
,
J. Seiferas
Theoretical Computer Science
40
(1), 1985, pp. 31-55
Robust algorithms: A different approach to oracles
U. Schöning
Theoretical Computer Science
40
(1), 1985, pp. 57-66
A linear time solution to the single function coarsest partition problem
R. Paige
,
R.E. Tarjan
,
R. Bonic
Theoretical Computer Science
40
(1), 1985, pp. 67-84
n-level rewriting systems
G. Bauer
Theoretical Computer Science
40
(2,3), 1985, pp. 85-99
On the verifiability of two-party algebraic protocols
R.V. Book
,
F. Otto
Theoretical Computer Science
40
(2,3), 1985, pp. 101-130
On total regulators generated by derivation relations
W. Bucher
,
A. Ehrenfeucht
,
D. Haussler
Theoretical Computer Science
40
(2,3), 1985, pp. 131-148
CTS systems and Petri nets
I.J. Aalbersberg
,
G. Rozenberg
Theoretical Computer Science
40
(2,3), 1985, pp. 149-162
Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages
K. Ayers
Theoretical Computer Science
40
(2,3), 1985, pp. 163-174
On the structure of one-tape nondeterministic Turing machine time hierarchy
K. Kobayashi
Theoretical Computer Science
40
(2,3), 1985, pp. 175-193
Implications of forbidden structures for extremal algorithmic problems
M.A. Huang
,
K.J. Lieberherr
Theoretical Computer Science
40
(2,3), 1985, pp. 195-210
While-programs with nondeterministic assignments and the logic ALNA
G. Mascari
,
M. Venturini Zilli
Theoretical Computer Science
40
(2,3), 1985, pp. 211-235
On bounded query machines
J.L. Balcázar
,
R.V. Book
,
U. Schöning
Theoretical Computer Science
40
(2,3), 1985, pp. 237-243
Homogeneous decomposition of stochastic systems
T. Kanaoka
,
S. Tomita
Theoretical Computer Science
40
(2,3), 1985, pp. 245-255
Transitive closure and related semiring properties via eliminants
S.K. Abdali
,
B.D. Saunders
Theoretical Computer Science
40
(2,3), 1985, pp. 257-274
Parallel and sequential computation on Boolean networks
F. Fogelman-Soullé
Theoretical Computer Science
40
(2,3), 1985, pp. 275-300
Reducibility of synchronization structures
A. Ginzburg
,
M. Yoeli
Theoretical Computer Science
40
(2,3), 1985, pp. 301-314
On Greibach normal form construction
F.J. Urbanek
Theoretical Computer Science
40
(2,3), 1985, pp. 315-317
A lower bound for polynomial multiplication
M. Kaminski
Theoretical Computer Science
40
(2,3), 1985, pp. 319-322
On recursive path ordering
M.S. Krishnamoorthy
,
P. Narendran
Theoretical Computer Science
40
(2,3), 1985, pp. 323-328
Algebraic calculi of processes and net expressions
G. Gonthier
Theoretical Computer Science
40
(2,3), 1985, pp. 329-337