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=76
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hypothetical datalog: Complexity and expressibility
Anthony J. Bonner
Theoretical Computer Science
76
, 1990, pp. 3-51
Semantics of types for database objects
Atsushi Ohori
Theoretical Computer Science
76
, 1990, pp. 53-91
Parallel update transactions
Dino Karabeg
,
Victor Vianu
Theoretical Computer Science
76
, 1990, pp. 93-114
Transformation of dynamic integrity constraints into transaction specifications
Udo W. Lipeck
Theoretical Computer Science
76
, 1990, pp. 115-142
On the decomposition of datalog program mappings
Guozhu Dong
,
Seymour Ginsburg
Theoretical Computer Science
76
, 1990, pp. 143-177
Contractions in comparing concurrency semantics
Joost N. Kok
,
Jan J.M.M. Rutten
Theoretical Computer Science
76
, 1990, pp. 179-222
Learning context-free grammars from structural data in polynomial time
Yasubumi Sakakibara
Theoretical Computer Science
76
, 1990, pp. 223-242
The three subfamilies of rational
\omega
-languages closed under
\omega
-transduction
E. Timmerman
Theoretical Computer Science
76
, 1990, pp. 243-250
Products of languages with counter
Pascal Weil
Theoretical Computer Science
76
, 1990, pp. 251-260
The congruence theory of closure properties of regular tree languages
Seppo Tirri
Theoretical Computer Science
76
, 1990, pp. 261-271
Extended regular expressions of star degree at most two
Kosaburo Hashiguchi
,
Heekeun Yoo
Theoretical Computer Science
76
, 1990, pp. 273-284
Distribution and synchronized automata
A. Petit
Theoretical Computer Science
76
, 1990, pp. 285-308
Recursion equation sets computing logic programs
Susumu Yamasaki
Theoretical Computer Science
76
, 1990, pp. 309-322
On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals
Tao Jiang
Theoretical Computer Science
76
, 1990, pp. 323-330
On optimal parallelization of sorting networks
Ethan Gannett
,
Suraj C. Kothari
,
Hsu-Chun Yen
Theoretical Computer Science
76
, 1990, pp. 331-341
A
\P
-complete graph partition problem
R. Sarnath
,
Xim He
Theoretical Computer Science
76
, 1990, pp. 343-351