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=193
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding
M.M. Bonsangue
,
F. van Breugel
,
J.J.M.M. Rutten
Theoretical Computer Science
193
(1-2), 1998, pp. 1-51
A computational model for metric spaces
Abbas Edalat
,
Reinhold Heckmann
Theoretical Computer Science
193
(1-2), 1998, pp. 53-73
Bounded existentials and minimal typing
Giorgio Ghelli
,
Benjamin Pierce
Theoretical Computer Science
193
(1-2), 1998, pp. 75-96
k
-arbiter: A safe and general scheme for
h
-out of-
k
mutual exclusion
Yoshifumi Manabe
,
Roberto Baldoni
,
Michel Raynal
,
Shigemi Aoyagi
Theoretical Computer Science
193
(1-2), 1998, pp. 97-112
A characterization of distance between 1-bounded compact ultrametric spaces through a universal space
Fabio Alessi
,
Paolo Baldan
Theoretical Computer Science
193
(1-2), 1998, pp. 113-127
Rudimentary relations and primitive recursion: A toolbox
Henri-Alex Esbelin
,
Malika More
Theoretical Computer Science
193
(1-2), 1998, pp. 129-148
Foundations of aggregation constraints
Kenneth A. Ross
,
Divesh Srivastava
,
Peter J. Stuckey
,
S. Sudarshan
Theoretical Computer Science
193
(1-2), 1998, pp. 149-179
A decidable canonical representation of the compact elements in Scott's reflexive domain in
P\omega
Thomas Drakengren
Theoretical Computer Science
193
(1-2), 1998, pp. 181-195
On translations of temporal logic of actions into monadic second-order logic
A. Rabinovich
Theoretical Computer Science
193
(1-2), 1998, pp. 197-214
Circumscribing DATALOG: Expressive power and complexity
Marco Cadoli
,
Luigi Palopoli
Theoretical Computer Science
193
(1-2), 1998, pp. 215-244