The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Luisa Gargano: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro
    Improved Algorithms for Chemical Threshold Testing Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:127-136 [Conf]
  2. Carlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
    On the Information Rate of Secret Sharing Schemes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:148-167 [Conf]
  3. Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
    On the Size of Shares for Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:101-113 [Conf]
  4. Gérard D. Cohen, Luisa Gargano, Ugo Vaccaro
    Unidirectional error-detecting codes. [Citation Graph (0, 0)][DBLP]
    EUROCODE, 1990, pp:94-105 [Conf]
  5. Luisa Gargano
    Multicasting in Optical Networks. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:459-460 [Conf]
  6. Carlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
    Secret Sharing Schemes with Veto Capabilities. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:82-89 [Conf]
  7. 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]
  8. 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]
  9. Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
    Optimal Approximation of Uniform Distributions with a Biased Coin. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:23-38 [Conf]
  10. Luisa Gargano
    Limited Wavelength Conversion in All-Optical Tree Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:544-555 [Conf]
  11. Luisa Gargano, Mikael Hammar
    There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them). [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:802-816 [Conf]
  12. Luisa Gargano, Pavol Hell, Stephane Perennes
    Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:505-515 [Conf]
  13. Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
    Spanning Trees with Bounded Number of Branch Vertices. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:355-365 [Conf]
  14. Luisa Gargano, Adele A. Rescigno
    Coloring Circular Arcs with Applications. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:155-166 [Conf]
  15. Luisa Gargano, Mikael Hammar, Anna Pagh
    Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  16. 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]
  17. Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, Alberto Negro, Vittorio Scarano
    Optimizing the finger table in chord-like DHTs. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  18. Gennaro Cordasco, Luisa Gargano
    How Much Independent Should Individual Contacts Be to Form a Small-World? [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:328-338 [Conf]
  19. Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano
    Degree-Optimal Deterministic Routing for P2P Systems. [Citation Graph (0, 0)][DBLP]
    ISCC, 2005, pp:158-163 [Conf]
  20. Luisa Gargano, Adele A. Rescigno
    Optimally Fast Data Gathering in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:399-411 [Conf]
  21. Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro
    Asynchronous Deterministic Rendezvous in Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:271-282 [Conf]
  22. Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano
    Brief announcement: degree: optimal deterministic routing for P2P systems. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:395- [Conf]
  23. Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano
    F-Chord: Improved Uniform Routing on Chord: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:89-98 [Conf]
  24. Luisa Gargano, Adele A. Rescigno
    Communication Complexity of Fault-Tolerant Information Diffusion. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:564-573 [Conf]
  25. Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
    Communication Complexity of Gossiping by Packets. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:234-245 [Conf]
  26. Gianluca De Marco, Luisa Gargano, Ugo Vaccaro
    Concurrent Multicast in Weighted Networks. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:193-204 [Conf]
  27. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    Time Bound for Broadcasting in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1989, pp:19-33 [Conf]
  28. Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
    Efficient Communication in Unknown Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:172-183 [Conf]
  29. Jean-Claude Bermond, Luisa Gargano, Stephane Perennes
    Optimal Sequential Gossiping by Short Messages. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:86, n:2-3, pp:145-155 [Journal]
  30. Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro
    optimal Detection of a Counterfeit Coin with Multi-arms Balances. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:61, n:2, pp:121-131 [Journal]
  31. Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
    On searching strategies, parallel questions, and delayed answers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:247-262 [Journal]
  32. Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards
    Reliable broadcasting. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:135-148 [Journal]
  33. 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]
  34. Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
    Spanning spiders and light-splitting switches. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:83-95 [Journal]
  35. Luisa Gargano, Ugo Vaccaro, A. Vozella
    Fault Tolerant Routing in the Star and Pancake Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:6, pp:315-320 [Journal]
  36. Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro
    Group Testing with Unreliable Tests. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1997, v:96, n:1&2, pp:1-14 [Journal]
  37. Luisa Gargano, János Körner, Ugo Vaccaro
    Qualitative Independence and Sperner Problems for Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:61, n:2, pp:173-192 [Journal]
  38. Luisa Gargano, János Körner, Ugo Vaccaro
    Capacities: From Information Theory to Extremal Set Theory. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:68, n:2, pp:296-316 [Journal]
  39. Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
    On the Size of Shares for Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:3, pp:157-167 [Journal]
  40. 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]
  41. Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
    Efficient communication in unknown networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:1, pp:39-49 [Journal]
  42. 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]
  43. 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]
  44. Luisa Gargano, Ugo Vaccaro
    Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:178-198 [Journal]
  45. Vincenzo Auletta, Ioannis Caragiannis, Luisa Gargano, Christos Kaklamanis, Pino Persiano
    Sparse and limited wavelength conversion in all-optical tree networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:887-934 [Journal]
  46. 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]
  47. Carlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
    On the Information Rate of Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:154, n:2, pp:283-306 [Journal]
  48. Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro
    Efficient algorithms for chemical threshold testing problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:493-511 [Journal]
  49. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    Decoders with Initial State Invariance for Multivalued Encodings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:86, n:2, pp:365-375 [Journal]
  50. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    A Fast Algorithm for the Unique Decipherability of Multivalued Encodings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:63-78 [Journal]
  51. 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]
  52. Gianluca De Marco, Luisa Gargano, Ugo Vaccaro
    Concurrent multicast in weighted networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:359-377 [Journal]
  53. Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro
    Asynchronous deterministic rendezvous in graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:355, n:3, pp:315-326 [Journal]
  54. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    On the characterization of statistically synchronizable variable-length codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:4, pp:817-825 [Journal]
  55. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
    An efficient algorithm for testing immutability of variable-length codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:6, pp:1310-0 [Journal]
  56. Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro
    On the construction of statistically synchronizable codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:407-414 [Journal]
  57. Luisa Gargano, Ugo Vaccaro
    Efficient generation of fair dice with few biased coins. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:5, pp:1600-1606 [Journal]
  58. Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
    A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3772-3777 [Journal]
  59. Luisa Gargano
    Time Optimal Gathering in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:7-10 [Conf]

  60. Overlay networks with class. [Citation Graph (, )][DBLP]


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


  62. Optimizing the finger tables in Chord-like DHTs. [Citation Graph (, )][DBLP]


  63. Efficient q-ary immutable codes. [Citation Graph (, )][DBLP]


  64. Search problems for two irregular coins with incomplete feedback: the underweight model. [Citation Graph (, )][DBLP]


  65. An improved algorithm for quantitative group testing. [Citation Graph (, )][DBLP]


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


  67. A note on submodular set cover on matroids. [Citation Graph (, )][DBLP]


Search in 0.130secs, Finished in 0.132secs
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