The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Adele A. Rescigno: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro
    Efficient Collective Communication in Optical Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:574-585 [Conf]
  2. Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
    Fast Gossiping by Short Messages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:135-146 [Conf]
  3. Luisa Gargano, Adele A. Rescigno
    Coloring Circular Arcs with Applications. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:155-166 [Conf]
  4. Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
    Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:223- [Conf]
  5. Luisa Gargano, Adele A. Rescigno
    Optimally Fast Data Gathering in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:399-411 [Conf]
  6. Luisa Gargano, Adele A. Rescigno
    Communication Complexity of Fault-Tolerant Information Diffusion. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:564-573 [Conf]
  7. Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
    Communication Complexity of Gossiping by Packets. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:234-245 [Conf]
  8. Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
    Minimum time broadcast in faulty star networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:97-119 [Journal]
  9. Adele A. Rescigno
    On the Communication Complexity of Polling. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:6, pp:317-323 [Journal]
  10. Adele A. Rescigno
    Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:137, n:1-4, pp:259-276 [Journal]
  11. Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
    Communication Complexity of Gossiping by Packets. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:45, n:1, pp:73-81 [Journal]
  12. Luisa Gargano, Adele A. Rescigno
    Fast collective communication by packets in the postal model. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:2, pp:67-79 [Journal]
  13. Gianluca De Marco, Adele A. Rescigno
    Tighter Time Bounds on Broadcasting in Torus Networks in Presence of Dynamic Faults. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2000, v:10, n:1, pp:39-49 [Journal]
  14. Adele A. Rescigno
    Fault-Tolerant Parallel Communication in the Star Network. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1997, v:7, n:1, pp:57-68 [Journal]
  15. Adele A. Rescigno, Ugo Vaccaro
    Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:2, pp:221-230 [Journal]
  16. Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
    Fast Gossiping by Short Messages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:917-941 [Journal]
  17. Adele A. Rescigno
    Optimally Balanced Spanning Tree of the Star Network. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2001, v:50, n:1, pp:88-91 [Journal]
  18. Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro
    Efficient collective communication in optical networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:165-189 [Journal]
  19. Luisa Gargano, Adele A. Rescigno
    Communication Complexity of Fault-Tolerant Information Diffusion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:195-211 [Journal]
  20. Adele A. Rescigno
    Optimal Polling in Communication Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:5, pp:449-461 [Journal]

  21. Gathering with Minimum Delay in Tree Sensor Networks. [Citation Graph (, )][DBLP]


  22. Collision-free path coloring with application to minimum-delay gathering in sensor networks. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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