• 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)
• Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximating call-scheduling makespan in all-optical networks. J. Discrete Algorithms 2(4): 501-515 (2004)
• Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes: Deadlock Prevention by Acyclic Orientations. Discrete Applied Mathematics 129(1): 31-47 (2003)
• Tiziana 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)
• Andrea 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)
• 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)
• Piera 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)
• Miriam Di Ianni: Wormhole Deadlock Prediction. Parallel Processing Letters 10(4): 295-304 (2000)
• Miriam Di Ianni: Efficient Delay Routing. Theor. Comput. Sci. 196(1-2): 131-151 (1998)
• Andrea E. F. Clementi, Miriam Di Ianni: On the hardness of approximating optimum schedule problems in store and forward networks. >i>IEEE/ACM Trans. Netw. 4(2): 272-280 (1996)
• 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)
• 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)

• Andrea 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, Lecture Notes in Computer Science 4104, Springer: 60-72 (2006)
• Tiziana 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, Lecture Notes in Computer Science 4056, Springer: 227-239 (2006)
• Pilu 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, Lecture Notes in Computer Science 3738, Springer: 4-17 (2005)
• Andrea 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 (2005)
• Andrea 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, Lecture Notes in Computer Science 3499, Springer: 89-98 (2005)
• Christoph 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 (2004)
• Christoph 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, Lecture Notes in Computer Science 2996, Springer: 418-427 (2004)
• Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximating Call-Scheduling Makespan in All-Optical Networks. WG 2000v Lecture Notes in Computer Science 1928, Springer: 13-22 (2000)
• Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela: Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings. FSTTCS 1999, Lecture Notes in Computer Science 1738, Springer: 201-212 (1999)
• Tiziana Calamoneri, Miriam Di Ianni: Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees. Euro-Par 1998, Lecture Notes in Computer Science 1470, Springer: 1029-1039 (1998)
• Marco Cesati, Miriam Di Ianni: Parameterized Parallel Complexity. Euro-Par 1998, Lecture Notes in Computer Science 1470, Springer: 892-896 (1998)
• Miriam Di Ianni: Wormhole Deadlock Prediction. Euro-Par 1997, Lecture Notes in Computer Science 1300, Springer: 188-195 (1997)
• Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes: Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). WG 1997, Lecture Notes in Computer Science 1335, Springer: 52-64 (1997)
• Marco Cesati, Miriam Di Ianni: Parameterized Parallel Complexity. Electronic Colloquium on Computational Complexity (ECCC) 4(6): (1997)
• Miriam Di Ianni: Efficient Delay Routing (Extended Abstract). Euro-Par, Vol. I 1996, Lecture Notes in Computer Science 1123, Springer: 258-269 (1996)
• 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, Lecture Notes in Computer Science 1124, Springer: 594-601 (1996)
• Miriam Di Ianni, Michele Flammini, Rossella Flammini, Sandro Salomone: Systolic Acyclic Orientations for Deadlock Prevention. SIROCCO 1995: 1-12 (1995)
• Andrea E. F. Clementi, Miriam Di Ianni: Optimum Schedule Problems in Store and Forward Networks. IEEE INFOCOM 1994: 1336-1343 (1994)
• A. Clementi, M. Di Ianni, P. Mentrasti: The class of refractory neural nets. International Conference on Artificial Neural Networks and Genetic Algorithms: 3-9 (1993)

   Back to the home page