On the characterization of statistically synchronizable variable-length codes. - Renato M. Capocelli; Luisa Gargano; Ugo Vaccaro (IEEE Trans. Inf. Theory, 1988)

Time Bound for Broadcasting in Bounded Degree Graphs. - Renato M. Capocelli; Luisa Gargano; Ugo Vaccaro (WG, 1989)

Structure of decoders for multivalued encodings. - Renato M. Capocelli; Ugo Vaccaro (Discret. Appl. Math., 1989)

On the construction of minimal broadcast networks. - Luisa Gargano; Ugo Vaccaro (Networks, 1989)

An efficient algorithm for testing immutability of variable-length codes. - Renato M. Capocelli; Luisa Gargano; Ugo Vaccaro (IEEE Trans. Inf. Theory, 1989)

Unidirectional error-detecting codes. - Gérard D. Cohen; Luisa Gargano; Ugo Vaccaro (EUROCODE, 1990)

Efficient q-ary immutable codes. - Renato M. Capocelli; Luisa Gargano; Ugo Vaccaro (Discret. Appl. Math., 1991)

Decoders with Initial State Invariance for Multivalued Encodings. - Renato M. Capocelli; Luisa Gargano; Ugo Vaccaro (Theor. Comput. Sci., 1991)

On the Information Rate of Secret Sharing Schemes (Extended Abstract). - Carlo Blundo; Alfredo De Santis; Luisa Gargano; Ugo Vaccaro (CRYPTO, 1992)

Search problems for two irregular coins with incomplete feedback: the underweight model. - Luisa Gargano; János Körner; Ugo Vaccaro (Discret. Appl. Math., 1992)

An improved algorithm for quantitative group testing. - Luisa Gargano; V. Montouri; G. Setaro; Ugo Vaccaro (Discret. Appl. Math., 1992)

Qualitative Independence and Sperner Problems for Directed Graphs. - Luisa Gargano; János Körner; Ugo Vaccaro (J. Comb. Theory A, 1992)

Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults. - Luisa Gargano; Ugo Vaccaro (SIAM J. Discret. Math., 1992)

On the construction of statistically synchronizable codes. - Renato M. Capocelli; Alfredo De Santis; Luisa Gargano; Ugo Vaccaro (IEEE Trans. Inf. Theory, 1992)

Size of Shares and Probability of Cheating in Threshold Schemes. - Marco Carpentieri; Alfredo De Santis; Ugo Vaccaro (EUROCRYPT, 1993)

Secret Sharing Schemes with Veto Capabilities. - Carlo Blundo; Alfredo De Santis; Luisa Gargano; Ugo Vaccaro (Algebraic Coding, 1993)

Efficient Sharing of Many Secrets. - Carlo Blundo; Alfredo De Santis; Ugo Vaccaro (STACS, 1993)

Sperner capacities. - Luisa Gargano; János Körner; Ugo Vaccaro (Graphs Comb., 1993)

Fault Tolerant Routing in the Star and Pancake Interconnection Networks. - Luisa Gargano; Ugo Vaccaro; A. Vozella (Inf. Process. Lett., 1993)

On the Size of Shares for Secret Sharing Schemes. - Renato M. Capocelli; Alfredo De Santis; Luisa Gargano; Ugo Vaccaro (J. Cryptol., 1993)

Fault - tolerant hypercube broadcasting via information dispersal. - Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (Networks, 1993)

Multi-Secret Sharing Schemes. - Carlo Blundo; Alfredo De Santis; Giovanni Di Crescenzo; Antonio Giorgio Gaggia; Ugo Vaccaro (CRYPTO, 1994)

Randomness in Distributed Protocols. - Carlo Blundo; Alfredo De Santis; Ugo Vaccaro (ICALP, 1994)

Capacities: From Information Theory to Extremal Set Theory. - Luisa Gargano; János Körner; Ugo Vaccaro (J. Comb. Theory A, 1994)

A Fast Algorithm for the Unique Decipherability of Multivalued Encodings. - Renato M. Capocelli; Luisa Gargano; Ugo Vaccaro (Theor. Comput. Sci., 1994)

On the Number of Random Bits in Totally Private Computation. - Carlo Blundo; Alfredo De Santis; Giuseppe Persiano; Ugo Vaccaro (ICALP, 1995)

optimal Detection of a Counterfeit Coin with Multi-arms Balances. - Annalisa De Bonis; Luisa Gargano; Ugo Vaccaro (Discret. Appl. Math., 1995)

On the capacity of boolean graph formulæ. - Luisa Gargano; János Körner; Ugo Vaccaro (Graphs Comb., 1995)

Graph Decompositions and Secret Sharing Schemes. - Carlo Blundo; Alfredo De Santis; Douglas R. Stinson; Ugo Vaccaro (J. Cryptol., 1995)

New bounds on the information rate of secret sharing schemes. - Carlo Blundo; Alfredo De Santis; Antonio Giorgio Gaggia; Ugo Vaccaro (IEEE Trans. Inf. Theory, 1995)

Randomness in Distribution Protocols. - Carlo Blundo; Alfredo De Santis; Ugo Vaccaro (Inf. Comput., 1996)

Fully Dynamic Secret Sharing Schemes. - Carlo Blundo; Antonella Cresti; Alfredo De Santis; Ugo Vaccaro (Theor. Comput. Sci., 1996)

On the Information Rate of Secret Sharing Schemes. - Carlo Blundo; Alfredo De Santis; Luisa Gargano; Ugo Vaccaro (Theor. Comput. Sci., 1996)

Tight Bounds on the Information Rate of Secret Sharing Schemes. - Carlo Blundo; Alfredo De Santis; Roberto de Simone; Ugo Vaccaro (Des. Codes Cryptogr., 1997)

Group Testing with Unreliable Tests. - Annalisa De Bonis; Luisa Gargano; Ugo Vaccaro (Inf. Sci., 1997)

Communication Complexity of Gossiping by Packets. - Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (J. Parallel Distributed Comput., 1997)

Improved Algorithms for Chemical Threshold Testing Problems. - Annalisa De Bonis; Luisa Gargano; Ugo Vaccaro (COCOON, 1998)

Minimum time broadcast in faulty star networks. - Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (Discret. Appl. Math., 1998)

Perfectly Secure Key Distribution for Dynamic Conferences. - Carlo Blundo; Alfredo De Santis; Amir Herzberg; Shay Kutten; Ugo Vaccaro; Moti Yung (Inf. Comput., 1998)

On Secret Sharing Schemes. - Carlo Blundo; Alfredo De Santis; Ugo Vaccaro (Inf. Process. Lett., 1998)

Improved Algorithms for Group Testing with Inhibitors. - Annalisa De Bonis; Ugo Vaccaro (Inf. Process. Lett., 1998)

Broadcasting in Hypercubes and Star Graphs with Dynamic Faults. - Gianluca De Marco; Ugo Vaccaro (Inf. Process. Lett., 1998)

Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks. - Adele A. Rescigno; Ugo Vaccaro (Parallel Process. Lett., 1998)

Fast Gossiping by Short Messages. - Jean-Claude Bermond; Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (SIAM J. Comput., 1998)

Randomness Complexity of Private Computation. - Carlo Blundo; Alfredo De Santis; Giuseppe Persiano; Ugo Vaccaro (Comput. Complex., 1999)

Efficient m-ary Balanced Codes. - Luca G. Tallini; Ugo Vaccaro (Discret. Appl. Math., 1999)

Efficient generation of fair dice with few biased coins. - Luisa Gargano; Ugo Vaccaro (IEEE Trans. Inf. Theory, 1999)

Optimal Approximation of Uniform Distributions with a Biased Coin. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ICALP Satellite Workshops, 2000)

Introduction: Approximation and Randomized Algorithms in Communication Networks. - Ugo Vaccaro (ICALP Satellite Workshops, 2000)

coping with Delays and Time-Outs in Binary Search Procedures. - Ferdinando Cicalese; Ugo Vaccaro (ISAAC, 2000)

An improved heuristic for "Ulam-Rényi game". - Ferdinando Cicalese; Ugo Vaccaro (Inf. Process. Lett., 2000)

Efficient collective communication in optical networks. - Jean-Claude Bermond; Luisa Gargano; Stephane Perennes; Adele A. Rescigno; Ugo Vaccaro (Theor. Comput. Sci., 2000)

Optimal Strategies Against a Liar. - Ferdinando Cicalese; Ugo Vaccaro (Theor. Comput. Sci., 2000)

Efficient communication in unknown networks. - Luisa Gargano; Andrzej Pelc; Stephane Perennes; Ugo Vaccaro (Networks, 2001)

Efficient algorithms for chemical threshold testing problems. - Annalisa De Bonis; Luisa Gargano; Ugo Vaccaro (Theor. Comput. Sci., 2001)

Concurrent multicast in weighted networks. - Gianluca De Marco; Luisa Gargano; Ugo Vaccaro (Theor. Comput. Sci., 2001)

Bounds on entropy in a guessing game. - Alfredo De Santis; Antonio Giorgio Gaggia; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2001)

Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels. - Annalisa De Bonis; Ugo Vaccaro (ESA, 2002)

Spanning Trees with Bounded Number of Branch Vertices. - Luisa Gargano; Pavol Hell; Ladislav Stacho; Ugo Vaccaro (ICALP, 2002)

Least adaptive optimal search with unreliable tests. - Ferdinando Cicalese; Daniele Mundici; Ugo Vaccaro (Theor. Comput. Sci., 2002)

Supermodularity and subadditivity properties of the entropy on the majorization lattice. - Ferdinando Cicalese; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2002)

Generalized Framework for Selectors with Applications in Optimal Group Testing. - Annalisa De Bonis; Leszek Gasieniec; Ugo Vaccaro (ICALP, 2003)

Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems. - Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (IPDPS, 2003)

Binary search with delayed and missing answers. - Ferdinando Cicalese; Ugo Vaccaro (Inf. Process. Lett., 2003)

Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. - Annalisa De Bonis; Ugo Vaccaro (Theor. Comput. Sci., 2003)

New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing procedures. - Annalisa De Bonis; Ugo Vaccaro (ISIT, 2004)

On searching strategies, parallel questions, and delayed answers. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (Discret. Appl. Math., 2004)

Preface. - Ferdinando Cicalese; Daniele Mundici; Ugo Vaccaro (Discret. Appl. Math., 2004)

Spanning spiders and light-splitting switches. - Luisa Gargano; Mikael Hammar; Pavol Hell; Ladislav Stacho; Ugo Vaccaro (Discret. Math., 2004)

Bounding the average length of optimal source codes via majorization theory. - Ferdinando Cicalese; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2004)

Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection. - Ferdinando Cicalese; Peter Damaschke; Ugo Vaccaro (International Conference on Computational Science (2), 2005)

Optimal group testing algorithms with interval queries and their application to splice site detection. - Ferdinando Cicalese; Peter Damaschke; Ugo Vaccaro (Int. J. Bioinform. Res. Appl., 2005)

Optimal Two-Stage Algorithms for Group Testing Problems. - Annalisa De Bonis; Leszek Gasieniec; Ugo Vaccaro (SIAM J. Comput., 2005)

Asynchronous deterministic rendezvous in graphs. - Gianluca De Marco; Luisa Gargano; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc; Ugo Vaccaro (Theor. Comput. Sci., 2006)

Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes. - Annalisa De Bonis; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2006)

A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2006)

Tunstall Parse Trees Optimum under Various Criteria. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2007)

09281 Abstracts Collection - Search Methodologies. - Rudolf Ahlswede; Ferdinando Cicalese; Ugo Vaccaro (Search Methodologies, 2009)

Two Batch Search With Lie Cost. - Rudolf Ahlswede; Ferdinando Cicalese; Christian Deppe; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2009)

Superselectors: Efficient Constructions and Applications. - Ferdinando Cicalese; Ugo Vaccaro (ESA (1), 2010)

Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. - Ferdinando Cicalese; Martin Milanic; Ugo Vaccaro (FCT, 2011)

Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. - Jean-Claude Bermond; Luisa Gargano; Stéphane Pérennes; Adele A. Rescigno; Ugo Vaccaro (SIROCCO, 2011)

Information theoretic measures of distances and their econometric applications. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2013)

On the approximability and exact algorithms for vector domination and related problems in graphs. - Ferdinando Cicalese; Martin Milanic; Ugo Vaccaro (Discret. Appl. Math., 2013)

Optimal time data gathering in wireless networks with multidirectional antennas. - Jean-Claude Bermond; Luisa Gargano; Stéphane Pérennes; Adele A. Rescigno; Ugo Vaccaro (Theor. Comput. Sci., 2013)

How to go Viral: Cheaply and Quickly. - Ferdinando Cicalese; Gennaro Cordasco; Luisa Gargano; Martin Milanic; Joseph G. Peters; Ugo Vaccaro (FUN, 2014)

Latency-bounded target set selection in social networks. - Ferdinando Cicalese; Gennaro Cordasco; Luisa Gargano; Martin Milanic; Ugo Vaccaro (Theor. Comput. Sci., 2014)

A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks. - Gennaro Cordasco; Luisa Gargano; Marco Mecchia; Adele A. Rescigno; Ugo Vaccaro (COCOA, 2015)

ϵ-Almost Selectors and Their Applications. - Annalisa De Bonis; Ugo Vaccaro (FCT, 2015)

Optimizing Spread of Influence in Social Networks via Partial Incentives. - Gennaro Cordasco; Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (SIROCCO, 2015)

Optimizing Spread of Influence in Weighted Social Networks via Partial Incentives. - Gennaro Cordasco; Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (CoRR, 2015)

Spread of influence in weighted networks under time and budget constraints. - Ferdinando Cicalese; Gennaro Cordasco; Luisa Gargano; Martin Milanic; Joseph G. Peters; Ugo Vaccaro (Theor. Comput. Sci., 2015)

Influence diffusion in social networks under time window constraints. - Luisa Gargano; Pavol Hell; Joseph G. Peters; Ugo Vaccaro (Theor. Comput. Sci., 2015)

Approximating probability distributions with short vectors, via information theoretic distance measures. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2016)

Evangelism in Social Networks. - Gennaro Cordasco; Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (IWOCA, 2016)

Brief Announcement: Active Information Spread in Networks. - Gennaro Cordasco; Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (PODC, 2016)

On k-Strong Conflict-Free Multicoloring. - Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (COCOA (2), 2017)

H(X) vs. H(f(X)). - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2017)

How to find a joint probability distribution of minimum entropy (almost) given the marginals. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2017)

ε-Almost Selectors and Their Applications to Multiple-Access Communication. - Annalisa De Bonis; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2017)

Low-Weight Superimposed Codes and Their Applications. - Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (FAW, 2018)

Maximum Entropy Interval Aggregations. - Ferdinando Cicalese; Ugo Vaccaro (ISIT, 2018)

Probabilistic Secret Sharing. - Paolo D'Arco; Roberto De Prisco; Alfredo De Santis; Angel L. Pérez del Pozo; Ugo Vaccaro (MFCS, 2018)

Time-Bounded Influence Diffusion with Incentives. - Gennaro Cordasco; Luisa Gargano; Joseph G. Peters; Adele A. Rescigno; Ugo Vaccaro (SIROCCO, 2018)

Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm. - Gennaro Cordasco; Luisa Gargano; Marco Mecchia; Adele A. Rescigno; Ugo Vaccaro (Algorithmica, 2018)

Partial Covering Arrays: Algorithms and Asymptotics. - Kaushik Sarkar; Charles J. Colbourn; Annalisa De Bonis; Ugo Vaccaro (Theory Comput. Syst., 2018)

Evangelism in social networks: Algorithms and complexity. - Gennaro Cordasco; Luisa Gargano; Adele Anna Rescigno; Ugo Vaccaro (Networks, 2018)

Bounds on the Entropy of a Function of a Random Variable and Their Applications. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2018)

An Information Theoretic Approach to Probability Mass Function Truncation. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (ISIT, 2019)

Minimum-Entropy Couplings and Their Applications. - Ferdinando Cicalese; Luisa Gargano; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2019)

A new kind of selectors and their applications to conflict resolution in wireless multichannels networks. - Annalisa De Bonis; Ugo Vaccaro (Theor. Comput. Sci., 2020)

Whom to befriend to influence people. - Gennaro Cordasco; Luisa Gargano; Manuel Lafond; Lata Narayanan; Adele A. Rescigno; Ugo Vaccaro; Kangkang Wu (Theor. Comput. Sci., 2020)

Fast and frugal targeting with incentives. - Gennaro Cordasco; Luisa Gargano; Joseph G. Peters; Adele A. Rescigno; Ugo Vaccaro (Theor. Comput. Sci., 2020)

Low-weight superimposed codes and related combinatorial structures: Bounds and applications. - Luisa Gargano; Adele Anna Rescigno; Ugo Vaccaro (Theor. Comput. Sci., 2020)

Achievable Rates and Algorithms for Group Testing with Runlength Constraints. - Stefano Della Fiore; Marco Dalai; Ugo Vaccaro (ITW, 2022)

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. - Marco Dalai; Stefano Della Fiore; Adele A. Rescigno; Ugo Vaccaro (ITW, 2023)

Bounds and algorithms for generalized superimposed codes. - Adele A. Rescigno; Ugo Vaccaro (Inf. Process. Lett., 2023)

A Note on Equivalent Conditions for Majorization. - Roberto Bruno 002; Ugo Vaccaro (CoRR, 2024)

Entropic Bounds on the Average Length of Codes with a Space. - Roberto Bruno 002; Ugo Vaccaro (Entropy, 2024)

Improved Algorithms and Bounds for List Union-Free Families. - Adele A. Rescigno; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2024)

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees. - Roberto Bruno 002; Roberto De Prisco; Alfredo De Santis; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2024)

Old and New Results on Alphabetic Codes. - Roberto Bruno 002; Roberto De Prisco; Ugo Vaccaro (Information Theory and Related Fields, 2025)

An efficient algorithm for group testing with runlength constraints. - Marco Dalai; Stefano Della Fiore; Adele A. Rescigno; Ugo Vaccaro (Discret. Appl. Math., 2025)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications. - Roberto Bruno 002; Roberto De Prisco; Ugo Vaccaro (CoRR, 2025)