The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Miriam Di Ianni: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2006, pp:60-72 [Conf]
  2. Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi, Paola Vocca
    Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2005, pp:4-17 [Conf]
  3. Miriam Di Ianni, Gianluca Rossi
    Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP]
    AINA Workshops (2), 2007, pp:121-126 [Conf]
  4. Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni
    Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. II, 1996, pp:594-601 [Conf]
  5. Tiziana Calamoneri, Miriam Di Ianni
    Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:1029-1039 [Conf]
  6. Marco Cesati, Miriam Di Ianni
    Parameterized Parallel Complexity. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:892-896 [Conf]
  7. Miriam Di Ianni
    Efficient Delay Routing (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:258-269 [Conf]
  8. Miriam Di Ianni
    Wormhole Deadlock Prediction. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:188-195 [Conf]
  9. Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
    Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:201-212 [Conf]
  10. Andrea E. F. Clementi, Miriam Di Ianni
    Optimum Schedule Problems in Store and Forward Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1994, pp:1336-1343 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  13. 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. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:227-239 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:89-98 [Conf]
  15. Miriam Di Ianni, Michele Flammini, Rossella Flammini, Sandro Salomone
    Systolic Acyclic Orientations for Deadlock Prevention. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1995, pp:1-12 [Conf]
  16. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:418-427 [Conf]
  17. Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
    Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:52-64 [Conf]
  18. Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
    Approximating Call-Scheduling Makespan in All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:13-22 [Conf]
  19. Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
    Deadlock Prevention by Acyclic Orientations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:1, pp:31-47 [Journal]
  20. Marco Cesati, Miriam Di Ianni
    Parameterized Parallel Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:6, pp:- [Journal]
  21. Andrea E. F. Clementi, Miriam Di Ianni
    Optimum Schedule Problems in Store and Forward Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1995, v:6, n:2, pp:155-168 [Journal]
  22. Daniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi
    Deadlock Prediction in the Case of Dynamic Routing. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:3, pp:185-200 [Journal]
  23. Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
    Approximating call-scheduling makespan in all-optical networks. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:4, pp:501-515 [Journal]
  24. Tiziana Calamoneri, Miriam Di Ianni
    Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Benes networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2003, v:63, n:11, pp:1017-1025 [Journal]
  25. Marco Cesati, Miriam Di Ianni
    Computation Models for Parameterized Complexity. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1997, v:43, n:, pp:179-202 [Journal]
  26. Miriam Di Ianni
    Wormhole Deadlock Prediction. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2000, v:10, n:4, pp:295-304 [Journal]
  27. Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
    Approximation algorithms for routing and call scheduling in all-optical chains and rings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:429-448 [Journal]
  28. Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri
    The minimum broadcast range assignment problem on linear multi-hop wireless networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:751-761 [Journal]
  29. Miriam Di Ianni
    Efficient Delay Routing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:196, n:1-2, pp:131-151 [Journal]
  30. Andrea E. F. Clementi, Miriam Di Ianni
    On the hardness of approximating optimum schedule problems in store and forward networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1996, v:4, n:2, pp:272-280 [Journal]
  31. Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni
    Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:10, pp:1090-1102 [Journal]
  32. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:161-167 [Journal]

  33. Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. [Citation Graph (, )][DBLP]


  34. Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. [Citation Graph (, )][DBLP]


  35. MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.022secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002