dblp.uni-trier.dewww.uni-trier.de

Miriam Di Ianni

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
35EEStefano Boschi, Miriam Di Ianni, Pilu Crescenzi, Gianluca Rossi, Paola Vocca: MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks. SimuTools 2008: 38
34EEPilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca: Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. WG 2008: 90-100
33EETiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri: Minimum-Energy Broadcast and disk cover in grid wireless networks. Theor. Comput. Sci. 399(1-2): 38-53 (2008)
2007
32EEMiriam Di Ianni, Gianluca Rossi: Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks. AINA Workshops (2) 2007: 121-126
31 Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri: On the bounded-hop MST problem on random Euclidean instances. Theor. Comput. Sci. 384(2-3): 161-167 (2007)
2006
30EEAndrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri: A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. ADHOC-NOW 2006: 60-72
29EETiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri: Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. SIROCCO 2006: 227-239
2005
28EEPilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi, Paola Vocca: Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. ADHOC-NOW 2005: 4-17
27EEAndrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Gianluca Rossi, Riccardo Silvestri: Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. IPDPS 2005
26EEAndrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri: Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. SIROCCO 2005: 89-98
2004
25EEChristoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri: The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. IPDPS 2004
24EEChristoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri: Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. STACS 2004: 418-427
23EELuca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximating call-scheduling makespan in all-optical networks. J. Discrete Algorithms 2(4): 501-515 (2004)
2003
22EEJean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes: Deadlock Prevention by Acyclic Orientations. Discrete Applied Mathematics 129(1): 31-47 (2003)
21EETiziana Calamoneri, Miriam Di Ianni: Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Benes networks. J. Parallel Distrib. Comput. 63(11): 1017-1025 (2003)
20EEAndrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri: The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theor. Comput. Sci. 1-3(299): 751-761 (2003)
2002
19 Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximation algorithms for routing and call scheduling in all-optical chains and rings. Theor. Comput. Sci. 287(2): 429-448 (2002)
2000
18EELuca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximating Call-Scheduling Makespan in All-Optical Networks. WG 2000: 13-22
17EEPiera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni: Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems. IEEE Trans. Parallel Distrib. Syst. 11(10): 1090-1102 (2000)
16 Miriam Di Ianni: Wormhole Deadlock Prediction. Parallel Processing Letters 10(4): 295-304 (2000)
1999
15EELuca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings. FSTTCS 1999: 201-212
1998
14EETiziana Calamoneri, Miriam Di Ianni: Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees. Euro-Par 1998: 1029-1039
13EEMarco Cesati, Miriam Di Ianni: Parameterized Parallel Complexity. Euro-Par 1998: 892-896
12EEMiriam Di Ianni: Efficient Delay Routing. Theor. Comput. Sci. 196(1-2): 131-151 (1998)
1997
11 Miriam Di Ianni: Wormhole Deadlock Prediction. Euro-Par 1997: 188-195
10 Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes: Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). WG 1997: 52-64
9EEMarco Cesati, Miriam Di Ianni: Parameterized Parallel Complexity Electronic Colloquium on Computational Complexity (ECCC) 4(6): (1997)
8 Marco Cesati, Miriam Di Ianni: Computation Models for Parameterized Complexity. Math. Log. Q. 43: 179-202 (1997)
1996
7 Miriam Di Ianni: Efficient Delay Routing (Extended Abstract). Euro-Par, Vol. I 1996: 258-269
6 Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni: Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract). Euro-Par, Vol. II 1996: 594-601
5EEAndrea E. F. Clementi, Miriam Di Ianni: On the hardness of approximating optimum schedule problems in store and forward networks. IEEE/ACM Trans. Netw. 4(2): 272-280 (1996)
1995
4 Miriam Di Ianni, Michele Flammini, Rossella Flammini, Sandro Salomone: Systolic Acyclic Orientations for Deadlock Prevention. SIROCCO 1995: 1-12
3 Andrea E. F. Clementi, Miriam Di Ianni: Optimum Schedule Problems in Store and Forward Networks. Int. J. Found. Comput. Sci. 6(2): 155-168 (1995)
1994
2 Andrea E. F. Clementi, Miriam Di Ianni: Optimum Schedule Problems in Store and Forward Networks. INFOCOM 1994: 1336-1343
1990
1 Daniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi: Deadlock Prediction in the Case of Dynamic Routing. Int. J. Found. Comput. Sci. 1(3): 185-200 (1990)

Coauthor Index

1Christoph Ambühl [24] [25]
2Piera Barcaccia [6] [17]
3Luca Becchetti [15] [18] [19] [23]
4Jean-Claude Bermond [10] [22]
5Maurizio A. Bonuccelli [6] [17]
6Stefano Boschi [35]
7Daniel P. Bovet [1]
8Tiziana Calamoneri [14] [21] [29] [33]
9Marco Cesati [8] [9] [13]
10Andrea E. F. Clementi [2] [3] [5] [20] [24] [25] [26] [27] [29] [30] [31] [33]
11Pierluigi Crescenzi (Pilu Crescenzi) [1] [28] [34] [35]
12Michele Flammini [4] [10] [22]
13Rossella Flammini [4]
14Federico Greco [34]
15Massimo Lauria [26] [29] [30] [31] [33]
16Alessandro Lazzoni [28]
17Nissan Lev-Tov [24]
18Alberto Marchetti-Spaccamela [15] [18] [19] [23]
19Angelo Monti [24] [25] [26] [27] [29] [30] [31] [33]
20David Peleg [24]
21Paolo Penna [28]
22Stéphane Pérennes (Stephane Perennes) [10] [22]
23Gianluca Rossi [24] [25] [26] [27] [28] [30] [31] [32] [34] [35]
24Sandro Salomone [4]
25Riccardo Silvestri [20] [24] [25] [26] [27] [29] [30] [31] [33]
26Paola Vocca [28] [34] [35]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)