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 YEAR=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
Hajo Broersma
,
Petr A. Golovach
,
Viresh Patel
Theoretical Computer Science
485
, 2013, pp. 69-84
Modular tree transducers
Joost Engelfriet
,
Heiko Vogler
Theoretical Computer Science
78
, 1990, pp. 267-303
On computational complexity and honest polynomial degrees
Rod Downey
Theoretical Computer Science
78
, 1990, pp. 305-317
Graphs and free partially commutative monoids
Roman König
Theoretical Computer Science
78
, 1990, pp. 319-346
The equivalence problem of multitape finite automata
T. Harju
,
J. Karhumäki
Theoretical Computer Science
78
, 1990, pp. 347-355
A note on some languages in uniform
\mbox{ACC}^0
David A. Mix Barrington
,
James Corbett
Theoretical Computer Science
78
, 1990, pp. 357-362
Searching subsequences
Ricardo A. Baeza-Yates
Theoretical Computer Science
78
, 1990, pp. 363-376
On the number of databases and closure operations
G. Burosch
,
J. Demetrovics
,
G.O.H. Katona
,
D.J. Kleitman
,
A.A. Sapozhenko
Theoretical Computer Science
78
, 1990, pp. 377-381
Abstract language design
Laurette Bradley
Theoretical Computer Science
77
, 1990, pp. 5-26
Computability problems in the development of algebraic module specifications
Hartmut Ehrig
,
Werner Fey
,
Horst Hansen
,
Michael Löwe
,
Dean Jacobs
,
Francesco Parisi-Presicce
Theoretical Computer Science
77
, 1990, pp. 27-71
Category-sorted algebra-based action semantics
Susan Even
,
David A. Schmidt
Theoretical Computer Science
77
, 1990, pp. 73-95
Transformations of sequential specifications into concurrent specifications by synchronization guards
Ryszard Janicki
,
Tomasz Müldner
Theoretical Computer Science
77
, 1990, pp. 97-129
Equational type logic
V. Manca
,
A. Salibra
,
G. Scollo
Theoretical Computer Science
77
, 1990, pp. 131-159
Data types over multiple-valued logics
Don Pigozzi
Theoretical Computer Science
77
, 1990, pp. 161-194
An algebraically specified language for data directed design
Eric W. Wagner
Theoretical Computer Science
77
, 1990, pp. 195-219
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
Seiten 1
2
3
4
5
6
>