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="Clementi, Andrea E.F."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
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
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
The minimum range assignment problem on linear radio networks
Andrea E.F. Clementi
,
Afonso Ferreira
,
Paolo Penna
,
St'ephane Perennes
,
Riccardo Silvestri
Algorithmica
35
(2), 2003, pp. 95-110
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Andrea E.F. Clementi
,
Miriam Di Ianni
,
Riccardo Silvestri
Theoretical Computer Science
299
(1-3), 2003, pp. 751-761
Distributed broadcast in radio networks of unknown topology
Andrea E.F. Clementi
,
Angelo Monti
,
Riccardo Silvestri
Theoretical Computer Science
302
(1-3), 2003, pp. 337-364
Optimal
F
-reliable protocols for the do-all problem on single-hop wireless networks
Andrea E.F. Clementi
,
Angelo Monti
,
Riccardo Silvestri
Lecture Notes in Computer Science
2518
, 2002, pp. 320-331
On the complexity of computing minimum energy consumption broadcast subgraphs
Andrea E.F. Clementi
,
Pilu Crescenzi
,
Paolo Penna
,
Gianluca Rossi
,
Paola Vocca
Lecture Notes in Computer Science
2010
, 2001, pp. 121-131
Round robin is optimal for fault-tolerant broadcasting on wireless networks
Andrea E.F. Clementi
,
Angelo Monti
,
Riccardo Silvestri
Lecture Notes in Computer Science
2161
, 2001, pp. 452-463
A note on parallel read operations on large public databases
Giancarlo Bongiovanni
,
Andrea E.F. Clementi
,
Paolo Penna
Proceedings in Informatics
8
, 2000, pp. 123-133
The power range assignment problem in radio networks on the plane
Andrea E.F. Clementi
,
Paolo Penna
,
Riccardo Silvestri
Lecture Notes in Computer Science
1770
, 2000, pp. 651-660
Small pseudo-random sets yield hard functions: New tight explicit lower bounds for branching programs
Alexander E. Andreev
,
Juri L. Baskakov
,
Andrea E.F. Clementi
,
José D.P. Rolim
Lecture Notes in Computer Science
1644
, 1999, pp. 179-189
Memory organization schemes for large shared data: A randomized solution for distributed memory machines
Alexander E. Andreev
,
Andrea E.F. Clementi
,
Paolo Penna
,
José D.P. Rolim
Lecture Notes in Computer Science
1563
, 1999, pp. 68-77
Weak random sources, hitting sets, and BPP simulations
Alexander E. Andreev
,
Andrea E.F. Clementi
,
José D.P. Rolim
,
Luca Trevisan
SIAM Journal on Computing
28
(6), 1999, pp. 2103-2116
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
Theoretical Computer Science
221
(1-2), 1999, pp. 3-18
On the complexity of approximating colored-graph problems
Andrea E.F. Clementi
,
Pierluigi Crescenzi
,
Gianluca Rossi
Lecture Notes in Computer Science
1627
, 1999, pp. 281-290
Hardness results for the power range assignment problem in packet radio networks
Andrea E.F. Clementi
,
Paolo Penna
,
Riccardo Silvestri
Lecture Notes in Computer Science
1671
, 1999, pp. 197-208
Improved non-approximability results for minimum vertex cover with density constraints
Andrea E.F. Clementi
,
Luca Trevisan
Theoretical Computer Science
225
(1-2), 1999, pp. 113-128
Seiten 1
2
>