1. Proceedings of 35th International Workshop on Combinatorial Algorithms (IWOCA 2024)
   Lecture Notes in Computer Science, Volume 14764, Springer-Verlag, 2024.
   (Co-edited with A. Rescigno)

2. Proceedings of 26th Annual Symposium on Combinatorial Pattern Matching (CPM2015)
   Lecture Notes in Computer Science, Volume 9133, Springer-Verlag, 2015.
   (Co-edited with F. Cicalese and E. Porat)

3. Search Methodologies,
   Dagstuhl Seminar Proceedings vol. 09281, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2009
   (co-edited with R. Ahlswede and F. Cicalese).

4. COSSAC: Combinatorics of Sorting, Searching, and Coding,
   Special Issue of Discrete Applied Mathematics, vol. 137, Issue 1, February 27, 2004.
   (Co-edited with F. Cicalese and D. Mundici).

5. Proceedings of ARACNE2000: Approximation and Randomized Algorithms in Communication Networks,
   Carleton University Press, 2000.

6. Proceedings of the Sixth Italian Conference on Theoretical Computer Science,
   World Scientific Publishing, 1998.
   (Co-edited with P. Degano and G. Pirillo).

7. Compression and Complexity of Sequences 1997,
   IEEE Computer Society, 1998.
   (Co-edited with B. Carpentieri, A. De Santis, and J. Storer).

8. Sequences II: Methods in Communication, Security and Computer Science,
   Springer-Verlag, 1993.
   (Co-edited with R. M. Capocelli and A. De Santis.)

Papers in Journals

1. ``An Efficient Algorithm for Group Testing with Runlength Constraints",
   Discrete Applied Mathematics, vol. 360, pp. 181-187, 2025.
   (With M. Dalai, S. Della Fiore, and A. Rescigno).
   

2. ``Bounds and Algorithms for Alphabetic Codes and Binary Search Trees",
   IEEE Transactions on Information Theory, vol 70, Issue 10, pp. 6974-6988, 2024.
   (With R. Bruno, R. De Prisco, and A. De Santis).
   

3. ``Improved Algorithms and Bounds for List Union-Free Families",
   IEEE Transactions on Information Theory, vol. 70, Issue 4, pp. 2456-2463, 2024.
   (With A.A. Rescigno).
   

4. ``Entropic Bounds on the Average Length of Codes with a Space",
   Entropy: Special Issue on Extremal and Additive Combinatorial Aspects of Information Theory , vol. 26, Issue 4, 283, 2024
   (With R. Bruno).
   

5. ``A Note on Equivalent Conditions for Majorization",
   AIMS Mathematics: Special Issue on Mathematical Foundations of Information Theory , vol. 9, Issue 4, pp. 8641-8660, 2024.
   (With R. Bruno).
   

6. ``Bounds and Algorithms for Generalized Superimposed Codes",
   Information Processing Letters, vol. 182 106365, 2023.
   (With A.A. Rescigno).
   

7. ``Fast and Frugal Targeting with Incentives",
   Theoretical Computer Science, vol. 812, pp. 62-79, 2020.
   (With G. Cordasco, L. Gargano, J. Peters, and A.A. Rescigno).
   

8. ``Whom to Befriend to Influence People",
   Theoretical Computer Science, vol. 810, pp. 26-42, 2020.
   (With G. Cordasco, L. Gargano, M. Lafond, L. Narayanan, A.A. Rescigno, and K. Wu).
   

9. ``Low-Weight Superimposed Codes and Related Combinatorial Structures: Bounds and Applications",
   Theoretical Computer Science, vol. 806, pp. 655-672, 2020.
   (With L. Gargano and A.A. Rescigno).
   

10. ``A New Kind of Selectors, and their Applications to Conflict Resolution in Wireless Multichannels Networks",
    Theoretical Computer Science, vol. 806, pp. 219-235, 2020.
    (With A. De Bonis).
    

11. ``Minimum-Entropy Couplings and their Applications",
    IEEE Transactions on Information Theory, vol. 65, pp. 3436-3451, 2019.
    (With F. Cicalese and L. Gargano).
    

12. ``Bounds on the Entropy of a Function of a Random Variable and their Applications",
    IEEE Transactions on Information Theory, vol. 64, pp. 2220-2230, 2018.
    (With F. Cicalese and L. Gargano).
    

13. ``Evangelism in Social Networks: Algorithms and Complexity",
    Networks, vol. 71, Issue 4, pp. 346-357, 2018.
    (With G. Cordasco, L. Gargano and A.A. Rescigno)
    

14. "Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm",
    Algorithmica, vol. 80, pp. 1804-1833, 2018.
    (With G. Cordasco, L. Gargano, M. Mecchia and A.A. Rescigno).
    

15. ``Partial Covering Arrays: Algorithms and Asymptotics",
    Theory of Computing Systems, vol. 62, pp. 1470-1489, 2018.
    (With K. Sarkar, C. J. Colbourn and A. De Bonis)
    

16. ```ε-Almost Selectors and their Applications to Multiple-Access Communication",
    IEEE Transactions on Information Theory, vol. 63, pp. 7304-7319, 2017.
    (With A. De Bonis)
    

17. ``Spread of Influence in Weighted Networks under Time and Budget Constraints",
    Theoretical Computer Science, vol. 586, pp. 40-58, 2015.
    (With F. Cicalese, G. Cordasco, L. Gargano, M. Milanic and J. Peters).

18. ``Influence Diffusion in Social Networks under Time Window Constraints",
    Theoretical Computer Science, vol. 584, pp. 53-66, 2015.
    (With L. Gargano, P. Hell and J. Peters).

19. ``Latency-Bounded Target Set Selection in Social Networks",
    Theoretical Computer Science, vol. 535, pp. 1-15, 2014.
    (With F. Cicalese, G. Cordasco, L. Gargano and M. Milanic).

20. ``Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas",
    Theoretical Computer Science, vol. 509, pp. 122-139, 2013.
    (With J.-C. Bermond, L. Gargano, A. Rescigno and S. Perennes).

21. ``On the Approximability and Exact Algorithms for Vector Domination and Related Problems in Graphs",
    Discrete Applied Mathematics, vol. 161, pp. 750-767, 2013.
    (With F. Cicalese and M. Milanic).

22. ``Spider Covers and their Applications",
    ISRN Discrete Mathematics, Volume 2012 (2012), Article ID 347430, 11 pages.
    (With F. De Santis, M. Hammar, L. Gargano, and A. Negro).

23. ``Two Batch Search with weighted lies''.
    IEEE Transactions on Information Theory, vol. 55, No. 4, pp. 1433-1439, 2009.
    (With R. Ahlswede, F. Cicalese, and C. Deppe).

24. ``Optimal Algorithms for Two Group Testing Problems and New Bounds on Generalized Superimposed Codes''.
    IEEE Transactions on Information Theory, vol. 52, No. 10, pp. 4673-4680, 2006.
    (With A. De Bonis).

25. ``A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes''.
    IEEE Transactions on Information Theory, vol. 52, No. 8, pp. 3772-3777, 2006.
    (With F. Cicalese and L. Gargano).

26. ``Asynchronous Deterministic Rendezvous in Graphs''.
    Theoretical Computer Science , vol. 355, pp. 315-326, 2006
    (With G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc).

27. ``Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection''
    International Journal of Bioinformatics Research and Applications, vol. 1, No. 4, pp. 363-388, 2005.
    (With F. Cicalese and P. Damaschke).

28. ``Optimal Two-Stage Algorithms for Group Testing Problems",
    SIAM Journal on Computing, vol. 34, No. 5, pp. 1253-1270, 2005
    (With A. De Bonis and L. Gasieniec)

29. ``On Searching Strategies, Parallel Questions, and Delayed Answers'',
    Discrete Applied Mathematics, vol. 144, Issue 3, pp. 247-262, 2004.
    (With F. Cicalese and L. Gargano)

30. ``Spanning Spiders and Light- Splitting Switches'',
    Discrete Mathematics, vol. 285, Issue 1-3, pp. 83-95, 2004.
    (With L. Gargano, M. Hammer, P. Hell, L. Stacho).

31. ``Bounding the Average Length of Optimal Source Codes via Majorization Theory'',
    IEEE Transactions on Information Theory,, vol. 50, No. 4, pp. 633-637, 2004.
    (With F. Cicalese)

32. ``Constructions of Generalized Superimposed Codes with Applications to Group Testing
    and Conflict Resolution in Multiple Access Channels'',
    Theoretical Computer Science, vol. 306, Issue 1-3, pp. 223-243, 2003.
    (With A. De Bonis)

33. ``Binary Search with Delayed and Missing Answers'',
    Information Processing Letters, Vol. 85, n. 5, pp. 239-247, 2003.
    (With F. Cicalese)

34. ``Supermodularity and Subadditivity Properties of the Entropy on the Majorization Lattice'',
    IEEE Transactions in Information Theory, Vol. 48, Issue 4, pp. 933-938, 2002.
    (With F. Cicalese).

35. ``Least Adaptive Optimal Search with Unreliable Tests'',
    Theoretical Computer Science, Vol. 270, Issue 1-2, pp. 877-893, 2002.
    (With F. Cicalese and D. Mundici).

36. ``Efficient Communication in Unknown Networks'',
    NETWORKS, Vol. 38, Issue 1, pp. 39-49, 2001.
    (With L. Gargano, A. Pelc, and S. Perennes).

37. ``Concurrent Multicast in Weighted Networks'',
    Theoretical Computer Science, vol. 259, no. 1-2, pp. 359-377, 2001.
    (With G. De Marco and L. Gargano).

38. ``Efficient Algorithms for Chemical Threshold Testing Problems'',
    Theoretical Computer Science, vol. 259, no. 1-2, pp. 493-511, 2001.
    (With A. De Bonis and L. Gargano).

39. ``Bounds on Entropy in a Guessing Game'',
    IEEE Transactions on Information Theory, vol. 47, no. 1, pp. 468-473, 2001.
    (With A. De Santis and A. Giorgio Gaggia)

40. ``An Improved Heuristic for Ulam-Renyi Game'',
    Information Processing Letters, vol. 73, no. 3-4, pp. 119-124, 2000.
    (With F. Cicalese).

41. ``Efficient Collective Communication in Optical Networks'',
    Theoretical Computer Science, vol. 233, no. 1-2, pp. 165-189, 2000.
    (With J.-C. Bermond, L. Gargano, S. Perennes, and A. A. Rescigno).

42. ``Optimal Strategies Against a Liar'',
    Theoretical Computer Science, vol. 230, no. 1-2, pp. 167-193, 2000.
    (With F. Cicalese).

43. ``The Randomness Complexity of Private Computation'',
    Computational Complexity, vol. 8, no. 2, pp. 145-168, 1999.
    (With C. Blundo, A. De Santis, and G. Persiano).

44. ``Efficient Generation of Fair Dice with Few Biased Coins'',
    IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1600-1606, 1999.
    (With L. Gargano).

45. ``On Efficient m-ary Balanced Codes'',
    Discrete Applied Mathematics, vol. 92, no. 1, pp. 17-56, 1999.
    (With L. Tallini).

46. ``Perfectly-Secure Key Distribution for Dynamic Conferences'',
    Information and Computation, vol. 146, no.1, pp. 1-23, 1998 .
    (With C. Blundo, A. De Santis, A. Herzberg, S. Kutten, and M. Yung).

47. ``Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks'',
    Parallel Processing Letters (Special Issue on Graph Theory and Communication Networks), vol 8, pp. 221-230, 1998.
    (With A. A. Rescigno)

48. ``Improved Algorithms for Group Testing with Inibithors'',
    Information Processing Letters, vol. 67, pp. 57-64, 1998.
    (With A. De Bonis).

49. ``Broadcasting in Hypercubes and Star Graphs with Dynamic Faults'',
    Information Processing Letters, vol. 66, pp. 321-326, 1998.
    (With G. De Marco).

50. ``Fast Gossiping by Short Messages'',
    SIAM Journal on Computing, vol. 27, pp. 917-941, 1998.
    (With J.-C. Bermond, L. Gargano and A. Rescigno).

51. ``A Note on Secret Sharing Schemes'',
    Information Processing Letters, vol. 65, pp. 25-32, 1998.
    (With C. Blundo and A. De Santis).

52. ``Minimum Time Broadcast in Faulty Star Networks'',
    Discrete Applied Mathematics, vol. 82, pp. 95-117, 1998.
    (With L. Gargano and A. Rescigno).

53. ``Communication Complexity of Gossiping by Short Messages'',
    Journal of Parallel and Distributed Computing, vol. 45, pp. 73-81, 1997.
    (With L. Gargano and A. Rescigno).

54. ``Group Testing with Unreliable Tests'',
    Information Sciences, vol. 96, pp. 1-14, 1997.
    (With A. De Bonis and L. Gargano).

55. ``Tight Bounds on the Information Rate of Secret Sharing Schemes'',
    Design, Codes, and Cryptography, vol. 11, pp. 107-122, 1997.
    (With C. Blundo, A. De Santis, and R. De Simone).

56. ``Randomness in Distribution Protocols'',
    Information and Computation, vol. 131, no. 2, pp. 111-139, 1996.
    (With C. Blundo and A. De Santis).

57. ``Fully Dynamic Secret Sharing Schemes'',
    Theoretical Computer Science., vol. 165, pp. 407-440, 1996.
    (With C. Blundo, A. Cresti and A. De Santis).

58. ``On the Information Rate of Secret Sharing Schemes'',
    Theoretical Computer Science, vol. 154, pp. 283-306, 1996.
    (With C. Blundo, A. De Santis and L. Gargano).

59. ``New Bounds on the Information Rate of Secret Sharing Schemes'',
    IEEE Transactions on Information Theory, vol IT-41, n. 2, pp. 549-554, 1995.
    (With C. Blundo, A. De Santis and G. Gaggia).

60. ``Graph Decompositions and Secret Sharing Schemes'',
    Journal of Cryptology, vol. 8, pp. 39-64, 1995.
    (With C. Blundo, A. De Santis and D. R. Stinson).

61. ``Optimal Detection of a Counterfeit Coin with Multi-Arms Balances'',
    Discrete Applied Mathematics, vol. 61, pp. 121-131, 1995.
    (With A. De Bonis and L. Gargano).

62. ``On the Capacity of Boolean Graph Formulæ'',
    Graphs and Combinatorics, vol. 11, pp. 29-48, 1995.
    (With L. Gargano and J. Körner).

63. ``Capacities: from Information Theory to Extremal Set Theory'',
    J. Combinatorial Theory, Series A, vol. 68, pp. 296-316, 1994.
    (With L. Gargano and J. Körner).

64. ``A Fast Algorithm for the Unique Decipherability of Multivalued Encodings'',
    Theoretical Computer Science, vol. 134, pp. 63-78, 1994.
    (With R. M. Capocelli and L. Gargano).

65. ``On the Sizes of Shares for Secret Sharing Schemes'',
    Journal of Cryptology, vol. 6, pp. 157-167, 1993.
    (With R. M. Capocelli, A. De Santis, and L. Gargano).

66. ``Fault Tolerant Routing in the Star and Pancake Interconnection Networks'',
    Information Processing Letters, vol. 45, 315-320, 1993.
    (With L. Gargano and A. Vozella).

67. ``Fault-Tolerant Hypercube Broadcasting via Information Dispersal'',
    NETWORKS, vol. 23, pp. 271-282, 1993.
    (With L. Gargano and A.A. Rescigno).

68. ``Sperner Capacities'',
    Graphs and Combinatorics, vol. 9, 31-46, 1993.
    (With L. Gargano and J. Körner).

69. ``Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults'',
    SIAM J. on Discrete Mathematics, vol. 5, pp. 178-198, 1992.
    (With L. Gargano).

70. ``Search Problems for Two Irregular Coins with Incomplete Feedback: the Underweight Model'',
    Discrete Applied Mathematics, vol. 36, pp. 191-197, 1992.
    (With L. Gargano and J. Körner).

71. ``An Improved Algorithm for Quantitative Group Testing'',
    Discrete Applied Mathematics, vol. 36, 1992, pp. 299-306, 1992.
    (With L. Gargano, V. Montuori, G. Setaro)

72. ``Qualitative Independence and Sperner Problems for Directed Graphs'',
    J. Combinatorial Theory, Series A, vol. 61, pp. 173-192, 1992.
    (With L. Gargano and J. Körner).

73. ``On the Construction of Statistically Sinchronizable Codes'',
    IEEE Transactions on Information Theory, vol. IT-38, No. 2, pp. 407-414, 1992.
    (With R. M. Capocelli, A. De Santis and L. Gargano).

74. ``Efficient q-ary Immutable Codes'',
    Discrete Applied Mathematics, vol. 33, pp. 25-41, 1991.
    (With R. M. Capocelli and L. Gargano).

75. ``Decoders with Initial State Invariance for Multivalued Encodings'',
    Theoretical Computer Science, vol. 86, pp. 365-375, 1991.
    (With R. M. Capocelli and L. Gargano).

76. ``Coding, Synchronization and Randomization of Source Messages'',
    Note, Recensioni and Notizie, vol. 40, n.3, Settembre 1990, pp. 79-85.
    (With R. M. Capocelli and L. Gargano).

77. ``On the Construction of Minimal Broadcast Networks'',
    NETWORKS, vol. 19, pp. 673-689, 1989.
    (With L. Gargano).

78. ``An Efficient Algorithm for Testing Immutability of Variable Length Codes'',
    IEEE Transactions on Information Theory, vol. IT-35, No. 6, pp. 1310-1314, 1989.
    (With R. M. Capocelli and L. Gargano).

79. ``Structure of Decoders for Multivalued Encodings'',
    Discrete Applied Mathematics, vol. 23, No. 1, pp. 55-71, 1989.
    (With R. M. Capocelli).

80. ``On the Characterization of Statistically Synchronizable Variable Length Codes'',
    IEEE Transactions on Information Theory, vol. IT-34, No. 4, pp. 817-825, 1988.
    (With R. M. Capocelli and L. Gargano).

Papers in Proceedings

1. "Old and New Results on Alphabetic Codes",
   in: Information Theory and Related Fields, Springer Verlag, to apear.
   (With R. Bruno and R. De Prisco)

2. "Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures",
   in: Proceedings of the 2023 IEEE Information Theory Workshop (ITW 2023), pp. 544-549.
   (With M. Dalai, S. Della Fiore and A.A. Rescigno)

3. "Achievable Rates and Algorithms for Group Testing with Runlength Constraints",
   in: Proceedings of the 2022 IEEE Information Theory Workshop (ITW 2022), pp. 576-581.
   (With M. Dalai and S. Della Fiore)

4. ''An Information Theoretic Approach to Probability Mass Function Truncation'',
   in: Proceedings of the 2019 IEEE International Symposium on Information Theory (ISIT 2019), pp. 702-706.
   (With F. Cicalese and L. Gargano)

5. ``Time-Bounded Influence Diffusion with Incentives",
   in: Proceedings of the 25th International Colloquium on Structural Information and Communication Complexity (Sirocco 2018),
   Lectures Notes in Computer Science vol. 11085, Zvi Lotker and Boaz Patt-Shamir (Eds.), pp. 280-295, 2018.
   (With G. Cordasco, L. Gargano, J. Peters and A. Rescigno)

6. ``Probabilistic Secret Sharing Schemes",
   in: Proceedings of 43th International Symposium on Mathematical Foundations of Computer Science (MFCS 2018),
   Igor Potapov, Paul Spirakis and James Worrell (Eds.), Leibniz International Proceedings in Informatics (LIPIcs) vol. 117, pp. 64:1-64:16, 2018.
   (With P. D' Arco, R. De Prisco, A. De Santis, Á. Pérez Del Pozo)

7. ``Maximum Entropy Interval Aggregations",
   in: Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT 2018), pp. 1764-1768.
   (With F. Cicalese)

8. ``Low-Weight Superimposed Codes and their Applications",
   in: Proceedings of the 12th International Frontiers of Algorithmics Workshop (FAW'18),
   Lectures Notes in Computer Science vol. 10823, Jianer Chen and Pinyan Lu (Eds.), pp. 197-211, 2018.
   (With L. Gargano and A. Rescigno)

9. ``On k-Strong Conflict-Free Multicoloring",
   in: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA'17),
   Lectures Notes in Computer Science vol. 10628, X. Gao et al. (Eds.), pp. 276-290, 2017.
   (With L. Gargano and A. Rescigno)

10. ``H(X) vs. H(f(X))",
    in: Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT 2017), pp. 51-55.
    (With F. Cicalese and L. Gargano)

11. ``How to Find a Joint Probability Distribution of Minimum Entropy (almost) given the Marginals",
    in: Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT 2017), 2178-2182.
    (With F. Cicalese and L. Gargano)

12. ``A New Kind of Selectors, and their Applications to Conflict Resolution in Wireless Multichannels Networks",
    in: Proceedings of 12th International Symposium on Algorithms and Experiments for Wireless Sensor Network (ALGOSENSOR 2016),
    Lectures Notes in Computer Science, vol. 10050, Marek Chrobak, Antonio Fernández Anta, Leszek Gasieniec, and Ralf Klasing (Eds), pp.45-61, 2017.
    (With A. De Bonis)

13. ``Evangelism in Social Networks",
    in: Proceedings of 27th International Workshop on Combinatorial Algorithms, (IWOCA2016),
    Lectures Notes in Computer Science vol. 9843, V. Makinen, S. J. Puglisi and L. Salmela (Eds.), pp. 96-108, 2016.
    (With G. Cordasco, L. Gargano, and A.A. Rescigno)
    

14. ``Partial Covering Arrays: Algorithms and Asymptotics",
    in: Proceedings of 27th International Workshop on Combinatorial Algorithms, (IWOCA2016),
    Lectures Notes in Computer Science vol. 9843, V. Makinen, S. J. Puglisi and L. Salmela (Eds.), pp. 437-448, 2016.
    (With K. Sarkar, C. J. Colbourn and A. De Bonis)
    

15. ``Active Information Spread in Networks",
    in: Proceedings of 35th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2016), pp. 435-437, 2016.
    (With G. Cordasco, L. Gargano, and A.A. Rescigno)
    

16. ``Approximating Probability Distributions with Short Vectors, via Information Theoretic Distance Measures",
    in: Proceedings of 2016 IEEE International Symposium on Information Theory (ISIT 2016), pp. 1138-1142, 2016. .
    (With F. Cicalese and L. Gargano)
    

17. ``ε-Almost Selectors and their Applications",
    in: Proceedings of FCT 2015: 20th International Symposium on Fundamentals of Computation Theory,
    Lectures Notes in Computer Science vol. 9210, A. Kosowski and I. Walukiewicz (Eds.), pp. 255-268, 2015.
    (With A. De Bonis)

18. "A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks",
    in: Proceedings of the 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA'15),
    Lectures Notes in Computer Science vol. 9486, Zaixin Lu, Donghyun Kim, Weili Wu, Wei Li, and Ding-Zhu Du (Eds.), pp. 193-208, 2015.
    (With G. Cordasco, L. Gargano, M. Mecchia and A.A. Rescigno).

19. "Optimizing Spread of Influence in Social Networks via Partial Incentives",
    in: Proceedings of 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2015),
    Lectures Notes in Computer Science vol. 9439, C. Scheideler (Ed.), pp. 119-134, 2015.
    (With G. Cordasco, L. Gargano and A.A. Rescigno).

20. ``How to go Viral: Quickly and Cheaply",
    in: Proceedings of FUN 2014: Seventh International Conference on FUN WITH ALGORITHMS,
    Lectures Notes in Computer Science vol. 8496, A. Ferro, F. Luccio and P. Widmayer (Eds.), pp. 100-112, 2014.
    (With F. Cicalese, G. Cordasco, L. Gargano, M. Milanic, and J. Peters)

21. ``Influence Diffusion in Social Networks under Time Window Constraints",
    In: Proceedings of 20th International Colloquium on Structural Information and Communication Complexity (Sirocco 2013),
    Lectures Notes in Computer Science vol. 8179, T. Moscibroda and A.A. Reescigno (Eds.), pp. 141-152, 2013.
    (With L. Gargano, P. Hell and J. Peters).

22. ``Information Theoretic Measures of Distances and their Econometric Applications",
    In: Proceedings of 2013 International Symposium in Information Theory (ISIT2013), pp. 409-413, Istanbul, 2013.
    (With F. Cicalese and L. Gargano).

23. ``Latency-Bounded Target Set Selection in Social Networks",
    In: Proceedings of Computability in Europe 2013 (CiE 2013), The Nature of Computation: Logic, Algorithms, Applications,
    Lectures Notes in Computer Science vol. 7921, P. Bonizzoni, V. Brattka, B. Loewe (Eds.), pp. 65-77, 2013.
    (With F. Cicalese, G. Cordasco, L. Gargano and M. Milanic).

24. ``Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs",
    In: Proceedings of 18th International Symposium on Fundamentals of Computer Theory (FCT 2011)
    Lectures Notes in Computer Science, vol. 6914, Olaf Owe, Martin Steffen and Jan Arne Telle (Eds.), pp. 288-297, 2011.
    (With F. Cicalese and M. Milanic).

25. ``Optimal Time Data Gathering in Wireless Networks with Omni--Directional Antennas",
    In: Proceedings of 18th International Colloquium on Structural Information and Communication Complexity (Sirocco 2011),
    Lectures Notes in Computer Science, vol. 6796, A. Kosowoski and M. Yamashita (Eds.), pp. 306-318, 2011.
    (With J.-C. Bermond, L. Gargano, A. Rescigno and S. Perennes)

26. ``Superselectors: Efficient Constructions and Applications''.
    In: Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010),
    Lectures Notes in Computer Science, vol. 6346, M. de Berg and U. Meyer (Eds.), pp. 207-218, 2010.
    (With F. Cicalese).

27. ``Analysis and comparison of information theory-based distances for genomic strings''.
    In: Proceedings of Collective Dynamics: Topics on Competition and Cooperation in the Biosciences (BIOCOMP 2007),
    L. Ricciardi et al. (Eds.), AIP Conference Proceedings vol. 1028, pp. 292-310.
    (With W. Balzano, F. Cicalese, M. Del Sorbo).

28. ``Tunstall Parse Trees Optimum under Various Criteria''.
    In: Proceedings of 2007 International Symposium in Information Theory (ISIT2007), pp. 81-85, Nice, 2007.
    (With F. Cicalese and L. Gargano).

29. ``Asynchronous deterministic rendezvous in graphs''.
    in: Proceedings of 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005),
    Lecture Notes in Computer Science, vol. 3618, J. Jedrzejowicz and A. Szepietowski (Eds.), pp. 271--282, 2005.
    (With G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc).

30. ``Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection''
    in: Proceedings of 2005 International Workshop on Bioinformatics Research and Applications,
    Lecture Notes in Computer Science, vol. 3515, Vaidy S. Sunderam et al. (Eds.), pp. 1029--1037, 2005.
    (With F. Cicalese and P. Damaschke).

31. ``New Results and Applications of Superimposed Codes (and Related Combinatorial Structures)
    to the Design of Efficient Group Testing Procedures''
    in: Proceedings of 2004 International Symposium in Information Theory (ISIT2004), p. 257.
    (With A. De Bonis).

32. ``Generalized Framework for Selectors with Applications in Optimal Group Testing'',
    in: ICALP '03 , J.C.M. Baeten, J.K. Lenstra, J. Parrow, G.J. Woeginger (Eds.), Lectures Notes in Computer Science, vol. 2719,
    pp. 81-96, Springer-Verlag, 2003.
    (with A. De Bonis and L. Gasieniec).

33. ``Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems'',
    in: Proceedings of 3rd IEEE International Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN), 2003.
    (with L. Gargano and A. Rescigno).

34. ``Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing
    and Conflict Resolution in Multiple Access Channels'',
    in: ESA '02 , R. Möring and R. Raman (Eds.), Lectures Notes in Computer Science, vol. 2461,
    pp. 335-347, Springer-Verlag, 2002.
    (With A. De Bonis)

35. ``Spanning Trees with Bounded Number of Branch Vertices'',
    in: ICALP '02 , P. Widmayer et al. (Eds.), Lectures Notes in Computer Science, vol. 2380,
    pp. 355-365, Springer-Verlag, 2002.
    (With L. Gargano, P. Hell, and L. Stacho).

36. ``Bounding the Average Length of Optimal Source Codes'',
    in: Proceedings of 2002 International Symposium in Information Theory (ISIT2002), p. 177, IEEE Press, 2002.
    (With F. Cicalese).

37. ``Generalizations of Superimposed Codes with Applications to Efficient Design of Pooling Experiments'',
    in: Proceedings of 2002 International Symposium in Information Theory (ISIT2002), p. 488, IEEE Press, 2002.
    (With A. De Bonis).

38. ``The Entropy is Supermodular on the Majorization Lattice'',
    in: Proceedings of 2001 International Symposium in Information Theory (ISIT2001), p. 230, IEEE Press, 2001.
    (With F. Cicalese)

39. ``On Searching Strategies, Parallel Questions, and Delayed Answers'',
    in: Proceedings of Fun with Algorithms (FUN01), E. Lodi, L. Pagli and N. Santoro (Eds.), pp. 27--42, Carleton Scientific Press, 2001.
    (With F. Cicalese and L. Gargano).

40. ``Coping with Delays and Time-Outs in Binary Search Procedures'',
    in: Eleventh Annual International Symposium on Algorithms and Computation (ISAAC2000) D. T. Lee and Shang-Hua Teng (Eds.), Lectures Notes in Computer Science, vol. 1969, pp. 96-107, Springer-Verlag, (2000).
    (With F. Cicalese).

41. ``Rota-Metropolis cubic logic and Ulam-Renyi games'',
    in: Algebraic Combinatorics and Computer Science ˇ A Tribute to Giancarlo Rota Senato, D.; Crapo, H., (Eds.), pp. 193-240, Springer-Verlag, (2000)
    (With F. Cicalese and D. Mundici)

42. ``Efficient Communication in Unknown Networks'',
    in: Proceedings of 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000) U. Brandes and D. Wagner (Eds.), Lectures Notes in Computer Science, vol. 1928, pp. 172-183, Springer-Verlag, 2000.
    (With L. Gargano, A. Pelc, and S. Perennes).

43. ``Optimal Approximation of Uniform Distributions with a Biased Coin'',
    in: Proceedings of RANDOM2000, A. Broder (Ed.), Carleton University Press, pp. 23-37, 2000.
    (With F. Cicalese and L. Gargano ).

44. ``Least Adaptive Optimal Search with Unreliable Tests'',
    in: Algorithm Theory - SWAT2000, M. Halldorsson (Ed.), Lectures Notes in Computer Science, vol. 1851, pp. 547-562, Springer-Verlag, 2000.
    (With F. Cicalese and D. Mundici).

45. ``Perfect, Minimally Adaptive, Error-Correcting Searching Strategies'',
    in: Proceedings of International Symposium in Information Theory (ISIT2000), pp. 377, IEEE Press, 2000.
    (With F. Cicalese and D. Mundici).

46. ``Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems'',
    in: Numbers, Information and Complexity, I. Althofer et al. (Eds.), Kluwer Academic Publisher, pp. 555-578, Feb. 2000.
    (With L. Gargano).

47. ``Improved Algorithms for Chemical Threshold Testing Problems'',
    in: Proceedings of 4th International Conference on Computing and Combinatorics- COCOON'98, W.-L. Hsu and M.-Y. Kao (Eds.), Lectures Notes in Computer Science, vol. 1449, pp. 127-136, Springer-Verlag, 1998.
    (With A. De Bonis and L. Gargano).

48. ``Concurrent Multicast in Weighted Networks'',
    in : Algorithm Theory-SWAT '98, S. Arnborg and L. Ivansson (Eds.), Lectures Notes in Computer Science, vol. 11432, pp. 127-136, Springer-Verlag, 1998.
    (With G. De Marco and L. Gargano).

49. ``On Efficient m-ary Balanced Codes'',
    in: Proceedings of 1997 IEEE International Symposium in Information Theory, p. 217, Ulm, Germany.
    (With L. Tallini)

50. ``Graph Problems Arising from Wavelength-Routing in All-Optical Networks'',
    presented at: 2nd Workshop on Optics and Computer Science (WOCS),
    (With B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, and S. Perennes).

51. ``Efficient Collective Communication in Optical Networks''.
    in: ICALP '96, F. Meyer auf der Heide and B. Monien (Eds.), Lectures Notes in Computer Science, vol. 1099, pp. 574-585, Springer-Verlag, 1996.
    (With J.-C. Bermond, L. Gargano, S. Perennes, and A. A. Rescigno).

52. ``Communication Complexity of Gossiping by Short Messages''
    in: Algorithm Theory-SWAT '96, Rolf Karlsson and Andrzej Lingas (Eds.), Lectures Notes in Computer Science, vol. 1097, pp. 234-245, Springer-Verlag, 1996.
    (With L. Gargano and A. Rescigno).

53. ``New Bounds on the Share's Size in Secret Sharing Schemes''
    in: Proceedings of the 1st International Conference on the Theory and Applications of Cryptology, PRAGOCRYPT '96'', J. Pribyl ( Ed.), CTU Publishing House, pp. 349-358, 1996.
    ((With C. Blundo, A. De Santis, and R. De Simone)

54. ``On the Number of Random Bits in Totally Private Computation'',
    in: ICALP '95, Z. Fülöp and F. Gécseg (Eds.), Lectures Notes in Computer Science, vol. 944, pp. 171-182, Springer-Verlag, 1995.
    (With C. Blundo, A. De Santis, and G. Persiano).

55. ``Fast Gossiping by Short Messages'',
    in: ICALP '95, Z. Fülöp and F. Gécseg (Eds.), Lectures Notes in Computer Science, vol. 944, pp. 135-146, Springer-Verlag, 1995.
    (With J.-C. Bermond, L. Gargano and A. Rescigno).

56. ``Multi-Secret Sharing Schemes''
    in: Advances in Cryptology - CRYPTO '94, Y. Desmedt (Ed.) Lectures Notes in Computer Science, vol. 839, pp. 150-163, Springer-Verlag, 1994.
    (With C. Blundo, A. De Santis, G. Di Crescenzo and A. Giorgio Gaggia)

57. ``Randomness in Distribution Protocols'',
    in: ICALP '94, S. Abiteboul and E. Shamir (Eds.), Lectures Notes in Computer Science, vol. 820, pp. 568-579, Springer-Verlag, 1994.
    (With C. Blundo and A. De Santis).

58. ``Secret Sharing Schemes with Veto Capabilities'',
    in: Proceedings of French-Israeli Workshop in Algebraic Coding, G. Cohen, S. Litsyn, A. Lobstein, and G. Zemor, (Eds), Lectures Notes in Computer Science, vol. 781, pp. 82-89, 1994, Springer-Verlag.
    (With C. Blundo, A. De Santis and L. Gargano)

59. `` A Fast Algorithm for the Unique Decipherability of Multivalued Encodings,"
    in: Selected Papers of the Second International Colloquium on Words, Languages and Combinatorics, M. Ito, (Ed.), Kyoto, Japan, pp. 63-78, 1994, Elsevier.
    (With R.M. Capocelli and L. Gargano).

60. ``Fully Dynamic Secret Sharing Schemes''
    in: Advances in Cryptology - CRYPTO '93, D. Stinson (Ed.), Lectures Notes in Computer Science, vol. 773, pp. 110-125, 1994, Springer-Verlag.
    (With C. Blundo, A. Cresti and A. De Santis).

61. ``Size of Shares and Probability of Cheating in Threshold Schemes'',
    in: Advances in Cryptology - EUROCRYPT '93, T. Helleseth (Ed.), Lectures Notes in Computer Science, vol. 765, pp. 118-125, Springer-Verlag, 1994.
    (With M. Carpentieri and A. De Santis).

62. ``Lower Bounds in Secret Sharing Schemes''
    in: Proceedings of 1994 IEEE International Symposium in Information Theory, p. 494, Trondheim, Norway, June 27-July 1, 1994.
    (With C. Blundo, and A. De Santis)

63. ``Key Distribution Schemes''
    in: Proceedings of 1994 IEEE International Symposium in Information Theory, p. 496, Trondheim, Norway, June 27-July 1, 1994.
    (With C. Blundo, and A. Cresti)

64. ``On the Information Rate of Secret Sharing Schemes'',
    in: Advances in Cryptology - CRYPTO '92, E. Brickell (Ed.), Lectures Notes in Computer Science, vol. 740, pp. 149-169, 1993, Springer-Verlag.
    (With C. Blundo, A. De Santis and L. Gargano).

65. ``Perfectly-Secure Conference Key Distribution'',
    in: Advances in Cryptology - CRYPTO '92, E. Brickell (Ed.), vol. 740, Lectures Notes in Computer Science, pp. 471-486, 1993, Springer-Verlag.
    (With C. Blundo, A. De Santis, A. Herzberg, S. Kutten, and M. Yung).

66. ``Efficient Sharing of Many Secrets'',
    in: STACS '93, 10th Annual Symposium on Theoretical Aspects of Computer Science, P. Enjalbert, A. Finkel, and K. W. Wagner (Eds.), Lecture Notes in Computer Science, vol. 665, pp. 692-703, 1993, Springer-Verlag.
    (With C. Blundo and A. De Santis )

67. ``Graph Decompositions and Secret Sharing Schemes'',
    in: Advances in Cryptology - EUROCRYPT '92, R. Rueppel (Ed.), Lectures Notes in Computer Science, vol. 658, pp. 1-24, 1993, Springer-Verlag,
    (With C. Blundo, A. De Santis and D. R. Stinson).

68. ``A Note on Secret Sharing Schemes'',
    in: Sequences II: Methods in Communication, Security and Computer Science, R. M. Capocelli, A. De Santis and U. Vaccaro (Eds.), Springer-Verlag, pp. 335-344, 1993.
    (With R. M. Capocelli, A. De Santis, and L. Gargano).

69. ``On the Shannon Capacity of Graph Formulæ'',
    in: Sequences II: Methods in Communication, Security and Computer Science, R. M. Capocelli, A. De Santis and U. Vaccaro (Eds.), Springer-Verlag, pp. 203-211,1993.
    (With L. Gargano and J. Körner).

70. ``Fault-Tolerance Properties of the Star Interconnection Network'',
    in: CODIGRAF '93, pp. 101-112, Platja D'Aro (Barcellona), 1993.
    (With L. Gargano and A.A. Rescigno).

71. ``On the Sizes of Shares for Secret Sharing Schemes'',
    in: Advances in Cryptology - CRYPTO '91, J. Feigenbaum (Ed.), Lectures Notes in Computer Science, vol. 576, pp. 101-113, 1992, Springer-Verlag.
    (With R. M. Capocelli, A. De Santis, and L. Gargano).

72. `` Extremal Set Theory as Information Theory'',
    in: Proceedings of 1991 International Symposium in Information Theory (ISIT1991), p. 263, IEEE Press, 1991.
    (With L. Gargano and J. Körner).

73. `` Small Probability Spaces: Qualitative Independence And Beyond'',
    in: Proceedings of 1991 International Symposium in Information Theory (ISIT1991), p. 96, IEEE Press, 1991.
    (With L. Gargano and J. Körner).

74. ``Coding, Synchronization and Randomization of Source Messages'',
    in: Atti del Secondo Simposio su Stato and Prospettive della Ricerca Crittografica in Italia, Roma 23-24 Nov. 1989, Fondazione Ugo Bordoni, pp. 232-245, relazione invitata.
    (With R. M. Capocelli and L. Gargano).

75. ``On the Size of Shares for Secret Sharing Schemes'',
    in: Proceedings of Symposium on Computer Security, 51--59, Fondazione Bordoni, Roma, Italy (1990).
    (With R. M. Capocelli, L. Gargano, and A. De Santis).

76. ``Unidirectional Error Detecting Codes'',
    in: EUROCODE 90, P. Charpin and G. Cohen (Eds.), Lectures Notes in Computer Science, vol. 514, pp. 94-105, Springer-Verlag, 1991.
    (With L. Gargano and G. Cohen).

77. "An Information-Theoretic Treatment of Secret Sharing Schemes,"
    in: Proceedings of the 1991 IEEE International Symposium on Information Theory , Budapest, Hungary, June 1991.
    (With R. M. Capocelli, A. De Santis and L. Gargano)

78. ``Time Bounds for Broadcasting in Bounded Degree Graphs'',
    in: Graph-Theoretic Concepts in Computer Science, M. Nagl (Ed.), Lectures Notes in Computer Science, vol. 411, pp. 19-33, Springer-Verlag, 1990.
    (With R. M. Capocelli and L. Gargano).

79. ``Immutable Codes'',
    in: Sequences: Combinatorics, Compression, Security and Transmission, R.M. Capocelli (Ed.). Springer-Verlag, 1990, pp. 467-478.
    (With R. M. Capocelli and L. Gargano).

80. ``Improved Balanced Encodings'',
    in: Proceedings of IEEE International Symposium on Information Theory, p. 150, San Diego, CA, Gennaio 1990.
    (With R. M. Capocelli, L. Gargano and G. Landi).

81. ``Synchronizability of Multivalued Encodings'',
    in: Transactions of the Tenth Prague Conference on Information Theory, Statistical Decision Functions and Random Processes'', vol. A, pp. 225-234, Academia, 1988.
    (With R. M. Capocelli and L. Gargano).

82. ``A Model for Communication over Noisy Channels'',
    in: Physics of Cognitive Processes, E. R. Caianiello (Ed.), pp. 117-162, World Scientific, 1987.
    (With R. M. Capocelli and L. Gargano).

83. ``Generalized Distance Measures and Error Bounds'',
    in: Proceedings of 1985 IEEE International Conference on System, Man & Cybernetics, Tucson, Arizona, USA, 1985, pp. 78-82;
    (With R. M. Capocelli, L. Gargano and I. J. Taneja).

84. ``Generalized Distance Measures and Error Bounds'',
    in : Proceedings of IEEE International Symposium on Information Theory, Brighton, England, 1985.
    (With R. M. Capocelli, L. Gargano and I. J. Taneja).

85. ``Finite Decipherability of Multivalued Encodings'',
    in: Proceedings of Twenty-First Annual Allerton Conference on Communication, Control and Computing, Urbana, Illinois, USA, 1983, pp. 528-536.
    (With R. M. Capocelli).

86. ``Decoding Automata for Multivalued Encodings'',
    in: IEEE International Symposium on Information Theory , 1983, 59--60, Montreal, Canada.
    (With R. M. Capocelli)