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=240
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A transition system semanatics for the control-driven coordination language Manifold
M.M. Bonsangue
,
F. Arbab
,
J.W. de Bakker
,
J.J.M.M. Rutten
,
A. Scutellà
,
G. Zavattaro
Theoretical Computer Science
240
(1), 2000, pp. 3-47
Comparing three semantics for Linda-like languages
Nadia Busi
,
Roberto Gorrieri
,
Gianluigi Zavattaro
Theoretical Computer Science
240
(1), 2000, pp. 49-90
Coordinating action systems
Eric J. Hedman
,
Joost N. Kok
,
Kaisa Sere
Theoretical Computer Science
240
(1), 2000, pp. 91-115
Continuation-based transformations for coordination languages
Suresh Jagannathan
Theoretical Computer Science
240
(1), 2000, pp. 117-146
On modelling mobility
Roberto M. Amadio
Theoretical Computer Science
240
(1), 2000, pp. 147-176
Mobile ambients
Luca Cardelli
,
Andrew D. Gordon
Theoretical Computer Science
240
(1), 2000, pp. 177-213
Types for access control
Rocco de Nicola
,
GianLuigi Ferrari
,
Rosario Pugliese
,
Betti Venneri
Theoretical Computer Science
240
(1), 2000, pp. 215-254
Resolution of Hartmanis' conjecture for NL-hard sparse sets
Jin-Yi Cai
,
D. Sivakumar
Theoretical Computer Science
240
(2), 2000, pp. 257-269
Inferring evolutionary trees with strong combinatorial evidence
Vincent Berry
,
Olivier Gascuel
Theoretical Computer Science
240
(2), 2000, pp. 271-298
A selected tour of the theory of identification matrices
Lin Chen
Theoretical Computer Science
240
(2), 2000, pp. 299-318
Can large fanin circuits perform reliable computations in the presence of faults?
Rüdiger Reischuk
Theoretical Computer Science
240
(2), 2000, pp. 319-335
Repetitiveness of languages generated by morphisms
Y. Kobayashi
,
F. Otto
Theoretical Computer Science
240
(2), 2000, pp. 337-378
Spring algorithms and symmetry
Peter Eades
,
Xuemin Lin
Theoretical Computer Science
240
(2), 2000, pp. 379-405
Algorithms for generalized vertex-rankings of partial
k
-trees
Md. Abul Kashem
,
Xiao Zhou
,
Takao Nishizeki
Theoretical Computer Science
240
(2), 2000, pp. 407-427
Edge and node searching problems on trees
Sheng-Lung Peng
,
Chin-Wen Ho
,
Tsan-sheng Hsu
,
Ming-Tat Ko
,
Chuan Yu Tang
Theoretical Computer Science
240
(2), 2000, pp. 429-446
Image compression for fast wavelet-based subregion retrieval
A.S. Poulakidas
,
A. Srinivasan
,
Ö. Eğecioğlu
,
O. Ibarra
,
T. Yang
Theoretical Computer Science
240
(2), 2000, pp. 447-469
Contrast-optimal
k
out of
n
secret sharing schemes in visual cryptography
Thomas Hofmeister
,
Matthias Krause
,
Hans U. Simon
Theoretical Computer Science
240
(2), 2000, pp. 471-485
A multi-tree routing scheme using acyclic orientations
Fred S. Annexstein
,
Kenneth A. Berman
,
Tsan-Sheng Hsu
,
Ram Swaminathan
Theoretical Computer Science
240
(2), 2000, pp. 487-494