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="Di Ianni, Miriam"
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
Smooth movement and Manhattan path based Random Waypoint mobility
Pilu Crescenzi
,
Miriam Di Ianni
,
Andrea Marino
,
Donatella Merlini
,
Gianluca Rossi
,
Paola Vocca
Information Processing Letters
111
(5), 2011, pp. 239-246
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
Making role assignment feasible: A polynomial-time algorithm for computing ecological colorings
Pilu Crescenzi
,
Miriam Di Ianni
,
Federico Greco
,
Gianluca Rossi
,
Paola Vocca
Lecture Notes in Computer Science
5344
, 2008, pp. 90-100
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
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
Interval routing & layered cross product: Compact routing schemes for butterflies, meshes of trees, fat trees and Benes̑ networks
Tiziana Calamoneri
,
Miriam Di Ianni
Journal Parallel Distributed Computing
63
(11), 2003, pp. 1017-1025
Wormhole deadlock prediction
Miriam Di Ianni
Parallel Processing Letters
10
(4), 2000, pp. 295-303
Efficient delay routing
Miriam di Ianni
Theoretical Computer Science
196
(1-2), 1998, pp. 131-151
Wormhole deadlock prediction
Miriam di Ianni
Lecture Notes in Computer Science
1300
, 1997, pp. 188-195
Minimum length scheduling of precedence constrained messages in distributed systems
Piera Barcaccia
,
Maurizio A. Bonuccelli
,
Miriam Di Ianni
Lecture Notes in Computer Science
1124
, 1996, pp. 594-601
Efficient delay routing
Miriam di Ianni
Lecture Notes in Computer Science
1123
, 1996, pp. 258-269