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=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximal serializability of iterated transactions
M.P. Flé
,
G. Roucairol
Theoretical Computer Science
38
(1), 1985, pp. 1-16
Type 2 recursion theory
K. Weihrauch
Theoretical Computer Science
38
(1), 1985, pp. 17-33
Theory of representations
C. Kreitz
,
K. Weihrauch
Theoretical Computer Science
38
(1), 1985, pp. 35-53
On the complexity of slice functions
I. Wegener
Theoretical Computer Science
38
(1), 1985, pp. 55-68
Lower bounds on probabilistic linear decision trees
M. Snir
Theoretical Computer Science
38
(1), 1985, pp. 69-82
Permutation representation of k-ary trees
P.V. Ramanan
,
C.L. Liu
Theoretical Computer Science
38
(1), 1985, pp. 83-98
Formal systems for join dependencies
C. Beeri
,
M.Y. Vardi
Theoretical Computer Science
38
(1), 1985, pp. 99-116
A characterization of power-free morphisms
M. Leconte
Theoretical Computer Science
38
(1), 1985, pp. 117-122
Ensembles code-compatibles et une généralisation du théorme de Sardinas-Patterson
D.L. Van
Theoretical Computer Science
38
(1), 1985, pp. 123-132
Succinct representation of regular languages by boolean automata II
E. Leiss
Theoretical Computer Science
38
(1), 1985, pp. 133-136
Une généralisation des théormes de Higman et de Simon aux mots infinis
A. Finkel
Theoretical Computer Science
38
(1), 1985, pp. 137-142
The recursion-theoretic structure of complexity classes
D. Schmidt
Theoretical Computer Science
38
(2,3), 1985, pp. 143-156
On one-one polynomial time equivalence relations
O. Watanabe
Theoretical Computer Science
38
(2,3), 1985, pp. 157-165
Periodic character sequences where identifying two characters strictly reduces the period
M. Imori
,
H. Yamada
Theoretical Computer Science
38
(2,3), 1985, pp. 167-192
An investigation of controls for concurrent systems based on abstract control languages
H.D. Burkhard
Theoretical Computer Science
38
(2,3), 1985, pp. 193-222
Extending regular expressions with iterated shuffle
M. Jantzen
Theoretical Computer Science
38
(2,3), 1985, pp. 223-247
An approach to the subgraph homeomorphism problem
T. Asano
Theoretical Computer Science
38
(2,3), 1985, pp. 249-267
Hierarchical verification of asynchronous circuits using temporal logic
B. Mishra
,
E. Clarke
Theoretical Computer Science
38
(2,3), 1985, pp. 269-291
Clustering to minimize the maximum intercluster distance
T.F. Gonzalez
Theoretical Computer Science
38
(2,3), 1985, pp. 293-306
Process logic with regular formulas
D. Harel
,
D. Peleg
Theoretical Computer Science
38
(2,3), 1985, pp. 307-322
Testing for grammatical coverings
D.J. Rosenkrantz
,
H.B. Hunt III
Theoretical Computer Science
38
(2,3), 1985, pp. 323-341
Deciding hypergraph 2-colourability by H-resolution
N. Linial
,
M. Tarsi
Theoretical Computer Science
38
(2,3), 1985, pp. 343-347