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=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives
H. Wedde
Theoretical Computer Science
24
(1), 1983, pp. 1-20
On the centers of a language
A. de Luca
,
A. Restivo
,
S. Salemi
Theoretical Computer Science
24
(1), 1983, pp. 21-34
On the control power of integer division
O.H. Ibarra
,
S. Moran
,
L.E. Rosier
Theoretical Computer Science
24
(1), 1983, pp. 35-52
Stability in L systems
J.J. Grefenstette
Theoretical Computer Science
24
(1), 1983, pp. 53-71
Approximation properties of abstract data types
D.A. Schmidt
Theoretical Computer Science
24
(1), 1983, pp. 73-94
On the error correcting power of pluralism in BC-type inductive inference
R.P. Daley
Theoretical Computer Science
24
(1), 1983, pp. 95-104
The time-precision tradeoff problem on on-line probabilistic Turing machines
O. Watanabe
Theoretical Computer Science
24
(1), 1983, pp. 105-117
Unbounded hardware is equivalent to deterministic Turing machines
B. Chazelle
,
L. Monier
Theoretical Computer Science
24
(2), 1983, pp. 123-130
Correctness proofs of CSP programs
N. Soundararajan
Theoretical Computer Science
24
(2), 1983, pp. 131-141
Representation of functional dependencies in relational databases using linear graphs
K.K. Nambiar
,
T. Radhakrishnan
,
V.G. Tikekar
Theoretical Computer Science
24
(2), 1983, pp. 143-159
On a relationship between graph L-systems and picture languages
A. Nakamura
,
K. Aizawa
Theoretical Computer Science
24
(2), 1983, pp. 161-177
Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors
M. Toda
,
K. Inoue
,
I. Takanami
Theoretical Computer Science
24
(2), 1983, pp. 179-194
Infinite arrays and infinite computations
R. Siromoney
,
V.R. Dare
,
K.G. Subramanian
Theoretical Computer Science
24
(2), 1983, pp. 195-205
Admissible heuristic search in AND/OR graphs
A. Bagchi
,
A. Mahanti
Theoretical Computer Science
24
(2), 1983, pp. 207-219
Toward an abstract theory of data compression
J.A. Storer
Theoretical Computer Science
24
(3), 1983, pp. 221-237
Definability and fast quantifier elimination in algebraically closed fields
J. Heintz
Theoretical Computer Science
24
(3), 1983, pp. 239-277
Oracle-dependent properties of the lattice of NP sets
S. Homer
,
W. Maass
Theoretical Computer Science
24
(3), 1983, pp. 279-289
A natural encoding scheme proved probabilistic polynomial complete
Umesh V. Vazirani
,
Vijay V. Vazirani
Theoretical Computer Science
24
(3), 1983, pp. 291-300
Decidable sentences of Church-Rosser congruences
R.V. Book
Theoretical Computer Science
24
(3), 1983, pp. 301-312
On some decision questions concerning pushdown machines
O.H. Ibarra
Theoretical Computer Science
24
(3), 1983, pp. 313-322
Succinctness in dependency systems
P.C. Fischer
,
J.H. Jou
,
D.-M. Tsou
Theoretical Computer Science
24
(3), 1983, pp. 323-329
A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional alternating Turing machines
K. Inoue
,
I. Takanami
,
H. Taniguchi
Theoretical Computer Science
24
(3), 1983, pp. 331-336
On the notion of expressiveness and the rule of adaption
E.-R. Olderog
Theoretical Computer Science
24
(3), 1983, pp. 337-347