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
[1]
Hilfe
Suche: Author="Gorrieri, Roberto"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quantitative information in the tuple space coordination model
Mario Bravetti
,
Roberto Gorrieri
,
Roberto Lucchi
,
Gianluigi Zavattaro
Theoretical Computer Science
346
(1), 2005, pp. 28-57
Positive non-interference in elementary and trace nets
Nadia Busi
,
Roberto Gorrieri
Lecture Notes in Computer Science
3099
, 2004, pp. 1-16
A comparison of three authentication properties
Riccardo Focardi
,
Roberto Gorrieri
,
Fabio Martinelli
Theoretical Computer Science
291
(3), 2003, pp. 285-327
Process algebraic frameworks for the specification and analysis of cryptographic protocols
Roberto Gorrieri
,
Fabio Martinelli
Lecture Notes in Computer Science
2747
, 2003, pp. 46-67
The theory of interactive generalized semi-Markov processes
Mario Bravetti
,
Roberto Gorrieri
Theoretical Computer Science
282
(1), 2002, pp. 5-32
Vertical implementation
Arend Rensink
,
Roberto Gorrieri
Information and Computation
170
(1), 2001, pp. 95-133
A complete axiomatization for observational congruence of prioritized finite-state behaviors
Mario Bravetti
,
Roberto Gorrieri
Lecture Notes in Computer Science
1853
, 2000, pp. 744-755
On the expressiveness of Linda coordination primitives
Nadia Busi
,
Roberto Gorrieri
,
Gianluigi Zavattaro
Information and Computation
156
(1-2), 2000, pp. 90-121
Comparing three semantics for Linda-like languages
Nadia Busi
,
Roberto Gorrieri
,
Gianluigi Zavattaro
Theoretical Computer Science
240
(1), 2000, pp. 49-90
Non interference for the analysis of cryptographic protocols
Riccardo Focardi
,
Roberto Gorrieri
,
Fabio Martinelli
Lecture Notes in Computer Science
1853
, 2000, pp. 354-372
A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems
Marco Bernardo
,
Lorenzo Donatiello
,
Roberto Gorrieri
Information and Computation
144
(2), 1998, pp. 83-154
A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
Marco Bernardo
,
Roberto Gorrieri
Theoretical Computer Science
202
(1-2), 1998, pp. 1-54
A process algebraic view of Linda coordination primitives
Nadia Busi
,
Roberto Gorrieri
,
Gianluigi Zavattaro
Theoretical Computer Science
192
(2), 1998, pp. 167-199
Randomization and nondeterminism are comparable for oredered read-once branching programs
Farid Ablayev
Lecture Notes in Computer Science
1256
, 1997, pp. 195-202
Minimizing diameters of dynamic trees
Stephen Alstrup
,
Jacob Holm
,
Kristian de Lichtenberg
,
Mikkel Thorup
Lecture Notes in Computer Science
1256
, 1997, pp. 270-280
Upperbound on the communication complexity of private information retrieval
Andris Ambainis
Lecture Notes in Computer Science
1256
, 1997, pp. 401-407
Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
Alexander E. Andreev
,
Andrea E.F. Clementi
,
José D.P. Rolim
Lecture Notes in Computer Science
1256
, 1997, pp. 177-187
From chaotic iteration to constraint propagation
Krzysztof R. Apt
Lecture Notes in Computer Science
1256
, 1997, pp. 36-55
On the dynamics of sharing graphs
Andrea Asperti
,
Cosimo Laneve
Lecture Notes in Computer Science
1256
, 1997, pp. 259-269
Symbolic model ckecking for probabilistic processes
Christel Baier
,
Edmund M. Clarke
,
Vasiliki Hartonas-Garmhausen
,
Marta Kwiatkowska
,
Mark Ryan
Lecture Notes in Computer Science
1256
, 1997, pp. 430-440
The minimum color sum of bipartite graphs
Amotz Bar-Noy
,
Guy Kortsarz
Lecture Notes in Computer Science
1256
, 1997, pp. 738-748
On-line routing in all-optical networks
Yair Bartal
,
Stefano Leonardi
Lecture Notes in Computer Science
1256
, 1997, pp. 516-526
Enumerative sequences of leaves in rational trees
Frédérique Bassino
,
Marie-Pierre Béal
,
Dominique Perrin
Lecture Notes in Computer Science
1256
, 1997, pp. 76-86
Finite loops recognize exactly the regular open languages
Martin Beaudry
,
François Lemieux
,
Denis Thérien
Lecture Notes in Computer Science
1256
, 1997, pp. 110-120
Molecular computing, bounded nondeterminism, and efficient recursion
Richard Beigel
,
Bin Fu
Lecture Notes in Computer Science
1256
, 1997, pp. 816-826
Seiten 1
2
3
4
5
>