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: Author="Silvestri, Riccardo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Distributed community detection in dynamic graphs
Andrea Clementi
,
Miriam Di Ianni
,
Giorgio Gambosi
,
Emanuele Natale
,
Riccardo Silvestri
Theoretical Computer Science
584
, 2015, pp. 19-41
Rumor spreading in random evolving graphs
Andrea Clementi
,
Pierluigi Crescenzi
,
Carola Doerr
,
Pierre Fraigniaud
,
Marco Isopi
,
Alessandro Panconesi
,
Francesco Pasquale
,
Riccardo Silvestri
Lecture Notes in Computer Science
8125
, 2013, pp. 325-336
Optimal gossiping in geometric radio networks in the presence of dynamical faults
Andrea Clementi
,
Angelo Monti
,
Francesco Pasquale
,
Riccardo Silvestri
Networks
59
(3), 2012, pp. 289-298
Flooding time of edge-Markovian evolving graphs
Andrea E.F. Clementi
,
Claudio Macci
,
Angelo Monti
,
Francesco Pasquale
,
Riccardo Silvestri
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1694-1712
Modelling mobility: A {\sl Discrete} revolution
Andrea E.F. Clementi
,
Angelo Monti
,
Riccardo Silvestri
Lecture Notes in Computer Science
6199
, 2010, pp. 490-501
Broadcasting in dynamic radio networks
Andrea E.F. Clementi
,
Angelo Monti
,
Francesco Pasquale
,
Riccardo Silvestri
Journal of Computer and System Sciences
75
(4), 2009, pp. 213-230
MANETS: High mobility can make up for low transmission power
Andrea E.F. Clementi
,
Francesco Pasquale
,
Riccardo Silvestri
Lecture Notes in Computer Science
5556
, 2009, pp. 387-398
Minimum-energy broadcast and disk cover in grid wireless networks
Tiziana Calamoneri
,
Andrea E.F. Clementi
,
Miriam Di Ianni
,
Massimo Lauria
,
Angelo Monti
,
Riccardo Silvestri
Theoretical Computer Science
399
(1-2), 2008, pp. 38-53
On the bounded-hop MST problem on random Euclidean instances
Andrea E.F. Clementi
,
Miriam Di Ianni
,
Massimo Lauria
,
Angelo Monti
,
Gianluca Rossi
,
Riccardo Silvestri
Theoretical Computer Science
384
(2-3), 2007, pp. 161-167
Optimal gossiping in directed geometric radio networks in presence of dynamical faults
Andrea E.F. Clementi
,
Angelo Monti
,
Francesco Pasquale
,
Riccardo Silvestri
Lecture Notes in Computer Science
4708
, 2007, pp. 430-441
An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem
Angelo Monti
,
Paolo Penna
,
Riccardo Silvestri
Lecture Notes in Computer Science
4769
, 2007, pp. 154-165
On the approximability of the range assignment problem on radio networks in presence of selfish agents
Christoph Ambühl
,
Andrea E.F. Clementi
,
Paolo Penna
,
Gianluca Rossi
,
Riccardo Silvestri
Theoretical Computer Science
343
(1-2), 2005, pp. 27-41
An experimental analysis of simple, distributed vertex coloring algorithms
Irene Finocchi
,
Alessandro Panconesi
,
Riccardo Silvestri
Algorithmica
41
(1), 2005, pp. 1-23
Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks
Christoph Ambühl
,
Andrea E.F. Clementi
,
Miriam di Ianni
,
Nissan Lev-Tov
,
Angelo Monti
,
David Peleg
,
Gianluca Rossi
,
Riccardo Silvestri
Lecture Notes in Computer Science
2996
, 2004, pp. 418-427
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Andrea E.F. Clementi
,
Angelo Monti
,
Riccardo Silvestri
Journal Parallel Distributed Computing
64
(1), 2004, pp. 89-96
Approximation of a retrieval problem for parallel disks
Joep Aerts
,
Jan Korst
,
Frits Spieksma
Lecture Notes in Computer Science
2653
, 2003, pp. 178-188
Some properties of MOD
_m
circuits computing simple functions
Kazuyuki Amano
,
Akira Maruoka
Lecture Notes in Computer Science
2653
, 2003, pp. 227-237
Fast approximation of minimum multicast congestion - Implementation versus theory
Andreas Baltz
,
Anand Srivastav
Lecture Notes in Computer Science
2653
, 2003, pp. 165-177
Differential approximation for some routing problems
Cristina Bazgan
,
Refael Hassin
,
Jérôme Monnot
Lecture Notes in Computer Science
2653
, 2003, pp. 277-288
An improved algorithm for point set pattern matching under rigid motion
Arijit Bishnu
,
Sandip Das
,
Subhas C. Nandy
,
Bhargab B. Bhattacharya
Lecture Notes in Computer Science
2653
, 2003, pp. 36-45
On
k
-edge-connectivity problems with sharpened triangle inequality
Hans-Joachim Böckenhauer
,
Dirk Bongartz
,
Juraj Hromkovic̑
,
Ralf Klasing
,
Guido Proietti
,
Sebastian Seibert
,
Walter Unger
Lecture Notes in Computer Science
2653
, 2003, pp. 189-200
XOR-based schemes for fast parallel IP lookups
Giancarlo Bongiovanni
,
Paolo Penna
Lecture Notes in Computer Science
2653
, 2003, pp. 238-250
Reconciling gene trees to a species tree
Paola Bonizzoni
,
Gianluca Della Vedova
,
Riccardo Dondi
Lecture Notes in Computer Science
2653
, 2003, pp. 120-131
The relative worst order ratio for on-line algorithms
Joan Boyar
,
Lene M. Favrholdt
Lecture Notes in Computer Science
2653
, 2003, pp. 58-69
Efficient update strategies for geometric computing with uncertainty
Richard Bruce
,
Michael Hoffmann
,
Danny Krizanc
,
Rajeev Raman
Lecture Notes in Computer Science
2653
, 2003, pp. 12-23
Seiten 1
2
3
>