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=239
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algebraic specification of reactive systems
Manfred Broy
Theoretical Computer Science
239
(1), 2000, pp. 3-40
Object-oriented hybrid systems of coalgebras plus monoid actions
Bart Jacobs
Theoretical Computer Science
239
(1), 2000, pp. 41-95
Finite axiom systems for testing preorder and de Simone process languages
Irek Ulidowski
Theoretical Computer Science
239
(1), 2000, pp. 97-139
Some characteristics of strong innermost normalization
M.R.K. Krishna Rao
Theoretical Computer Science
239
(1), 2000, pp. 141-164
Simplification of Boolean verification conditions
E. Pascal Gribomont
Theoretical Computer Science
239
(1), 2000, pp. 165-185
Information integration using logical views
Jeffrey D. Ullman
Theoretical Computer Science
239
(2), 2000, pp. 189-210
Conjunctive query containment revisited
Chandra Chekuri
,
Anand Rajaraman
Theoretical Computer Science
239
(2), 2000, pp. 211-229
Queries and computation on the web
Serge Abiteboul
,
Victor Vianu
Theoretical Computer Science
239
(2), 2000, pp. 231-255
Games and total Datalog
^\neg
queries
Jörg Flum
,
Max Kubierschky
,
Bertram Ludäscher
Theoretical Computer Science
239
(2), 2000, pp. 257-276
Local properties of query languages
Guozhu Dong
,
Leonid Libkin
,
Limsoon Wong
Theoretical Computer Science
239
(2), 2000, pp. 277-308
A formula for incorporating weights into scoring rules
Ronald Fagin
,
Edward L. Wimmers
Theoretical Computer Science
239
(2), 2000, pp. 309-338