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="Degano, Pierpaolo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Synapses as stochastic concurrent systems
Andrea Bracciali
,
Marcello Brunelli
,
Enrico Cataldo
,
Pierpaolo Degano
Theoretical Computer Science
408
(1), 2008, pp. 66-82
Weakening the perfect encryption assumption in Dolev-Yao adversaries
Roberto Zunino
,
Pierpaolo Degano
Theoretical Computer Science
340
(1), 2005, pp. 154-178
Primitives for authentication in process algebras
Chiara Bodei
,
Pierpaolo Degano
,
Riccardo Focardi
,
Corrado Priami
Theoretical Computer Science
283
(2), 2002, pp. 271-304
A causal semantics for CCS via rewriting logic
Pierpaolo Degano
,
Fabio Gadducci
,
Corrado Priami
Theoretical Computer Science
275
(1-2), 2002, pp. 259-282
Static analysis for the
\pi
-calculus with applications to security
Chiara Bodei
,
Pierpaolo Degano
,
Flemming Nielson
,
Hanne Riis Nielson
Information and Computation
168
(1), 2001, pp. 68-92
Names of the
\pi
-calculus agents handled locally
Chiara Bodei
,
Pierpaolo Degano
,
Corrado Priami
Theoretical Computer Science
253
(2), 2001, pp. 155-184
A tool for quantitative analysis of
\pi
-calculus processes
Linda Brodo
,
Pierpaolo Degano
,
Corrado Priami
Proceedings in Informatics
8
, 2000, pp. 535-549
Causality for debugging mobile agents
Pierpaolo Degano
,
Corrado Priami
,
Lone Leth
,
Bent Thomsen
Acta Informatica
36
(5), 1999, pp. 335-374
Non-interleaving semantics for mobile processes
Pierpaolo Degano
,
Corrado Priami
Theoretical Computer Science
216
(1-2), 1999, pp. 237-270
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
An algebra-based method to associate rewards with EMPA terms
Marco Bernardo
Lecture Notes in Computer Science
1256
, 1997, pp. 358-368
Constructive linear time algorithms for branchwidth
Hans L. Bodlaender
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
1256
, 1997, pp. 627-637
Basic observables for processes
Michele Boreale
,
Rocco de Nicola
,
Rosario Pugliese
Lecture Notes in Computer Science
1256
, 1997, pp. 482-492
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Ahmed Bouajjani
,
Peter Habermehl
Lecture Notes in Computer Science
1256
, 1997, pp. 560-570
Seiten 1
2
3
4
>