Ugo Vaccaro

IEEE Trans. Inf. Theory, April, 2024

2023

Bounds and algorithms for generalized superimposed codes.

[BibT_eX]

[DOI]

Inf. Process. Lett., August, 2023

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2023

2022

Achievable Rates and Algorithms for Group Testing with Runlength Constraints.

[BibT_eX]

[DOI]

Stefano Della Fiore

Marco Dalai

Proceedings of the IEEE Information Theory Workshop, 2022

2020

Low-weight superimposed codes and related combinatorial structures: Bounds and applications.

[BibT_eX]

[DOI]

Adele Anna Rescigno

Theor. Comput. Sci., 2020

Fast and frugal targeting with incentives.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Whom to befriend to influence people.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A new kind of selectors and their applications to conflict resolution in wireless multichannels networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

2019

Minimum-Entropy Couplings and Their Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

An Information Theoretic Approach to Probability Mass Function Truncation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Bounds on the Entropy of a Function of a Random Variable and Their Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Evangelism in social networks: Algorithms and complexity.

[BibT_eX]

[DOI]

Networks, 2018

Partial Covering Arrays: Algorithms and Asymptotics.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2018

Time-Bounded Influence Diffusion with Incentives.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

Probabilistic Secret Sharing.

[BibT_eX]

[DOI]

Paolo D'Arco

Roberto De Prisco

Angel L. Pérez del Pozo

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Maximum Entropy Interval Aggregations.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Low-Weight Superimposed Codes and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017

ε-Almost Selectors and Their Applications to Multiple-Access Communication.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

How to find a joint probability distribution of minimum entropy (almost) given the marginals.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

H(X) vs. H(f(X)).

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On k-Strong Conflict-Free Multicoloring.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Brief Announcement: Active Information Spread in Networks.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Evangelism in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Approximating probability distributions with short vectors, via information theoretic distance measures.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Influence diffusion in social networks under time window constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Spread of influence in weighted networks under time and budget constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Optimizing Spread of Influence in Weighted Social Networks via Partial Incentives.

[BibT_eX]

[DOI]

CoRR, 2015

Optimizing Spread of Influence in Social Networks via Partial Incentives.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

ϵ-Almost Selectors and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Latency-bounded target set selection in social networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

How to go Viral: Cheaply and Quickly.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Optimal time data gathering in wireless networks with multidirectional antennas.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

On the approximability and exact algorithms for vector domination and related problems in graphs.

[BibT_eX]

[DOI]

Martin Milanic

Discret. Appl. Math., 2013

Information theoretic measures of distances and their econometric applications.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2011

Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs.

[BibT_eX]

[DOI]

Martin Milanic

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

Superselectors: Efficient Constructions and Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Two Batch Search With Lie Cost.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

09281 Abstracts Collection - Search Methodologies.

[BibT_eX]

[DOI]

Rudolf Ahlswede

Proceedings of the Search Methodologies, 05.07. - 10.07.2009, 2009

2007

Tunstall Parse Trees Optimum under Various Criteria.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Asynchronous deterministic rendezvous in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2005

Optimal Two-Stage Algorithms for Group Testing Problems.

[BibT_eX]

[DOI]

Leszek Gasieniec

SIAM J. Comput., 2005

Optimal group testing algorithms with interval queries and their application to splice site detection.

[BibT_eX]

[DOI]

Peter Damaschke

Int. J. Bioinform. Res. Appl., 2005

Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection.

[BibT_eX]

[DOI]

Peter Damaschke

Proceedings of the Computational Science, 2005

2004

Bounding the average length of optimal source codes via majorization theory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Spanning spiders and light-splitting switches.

[BibT_eX]

[DOI]

Discret. Math., 2004

Preface.

[BibT_eX]

[DOI]

Daniele Mundici

Discret. Appl. Math., 2004

On searching strategies, parallel questions, and delayed answers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing procedures.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Binary search with delayed and missing answers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Generalized Framework for Selectors with Applications in Optimal Group Testing.

[BibT_eX]

[DOI]

Leszek Gasieniec

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Supermodularity and subadditivity properties of the entropy on the majorization lattice.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Least adaptive optimal search with unreliable tests.

[BibT_eX]

[DOI]

Daniele Mundici

Theor. Comput. Sci., 2002

Spanning Trees with Bounded Number of Branch Vertices.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

Bounds on entropy in a guessing game.

[BibT_eX]

[DOI]

Antonio Giorgio Gaggia

IEEE Trans. Inf. Theory, 2001

Concurrent multicast in weighted networks.

[BibT_eX]

[DOI]

Gianluca De Marco

Theor. Comput. Sci., 2001

Efficient algorithms for chemical threshold testing problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Efficient communication in unknown networks.

[BibT_eX]

[DOI]

Networks, 2001

2000

Optimal Strategies Against a Liar.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Efficient collective communication in optical networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

An improved heuristic for "Ulam-Rényi game".

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

coping with Delays and Time-Outs in Binary Search Procedures.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Introduction: Approximation and Randomized Algorithms in Communication Networks.

[BibT_eX]

Proceedings of the ICALP Workshops 2000, 2000

Optimal Approximation of Uniform Distributions with a Biased Coin.

[BibT_eX]

Proceedings of the ICALP Workshops 2000, 2000

1999

Efficient generation of fair dice with few biased coins.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Efficient m-ary Balanced Codes.

[BibT_eX]

[DOI]

Luca G. Tallini

Discret. Appl. Math., 1999

Randomness Complexity of Private Computation.

[BibT_eX]

[DOI]

Comput. Complex., 1999

1998

Fast Gossiping by Short Messages.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1998

Broadcasting in Hypercubes and Star Graphs with Dynamic Faults.

[BibT_eX]

[DOI]

Gianluca De Marco

Inf. Process. Lett., 1998

Improved Algorithms for Group Testing with Inhibitors.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

On Secret Sharing Schemes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Perfectly Secure Key Distribution for Dynamic Conferences.

[BibT_eX]

[DOI]

Inf. Comput., 1998

Minimum time broadcast in faulty star networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Improved Algorithms for Chemical Threshold Testing Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Communication Complexity of Gossiping by Packets.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1997

Group Testing with Unreliable Tests.

[BibT_eX]

[DOI]

Inf. Sci., 1997

Tight Bounds on the Information Rate of Secret Sharing Schemes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1997

1996

On the Information Rate of Secret Sharing Schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Fully Dynamic Secret Sharing Schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Randomness in Distribution Protocols.

[BibT_eX]

[DOI]

Inf. Comput., 1996

1995

New bounds on the information rate of secret sharing schemes.

[BibT_eX]

[DOI]

Antonio Giorgio Gaggia

IEEE Trans. Inf. Theory, 1995

Graph Decompositions and Secret Sharing Schemes.

[BibT_eX]

[DOI]

J. Cryptol., 1995

On the capacity of boolean graph formulæ.

[BibT_eX]

[DOI]

Graphs Comb., 1995

optimal Detection of a Counterfeit Coin with Multi-arms Balances.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

On the Number of Random Bits in Totally Private Computation.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

A Fast Algorithm for the Unique Decipherability of Multivalued Encodings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Capacities: From Information Theory to Extremal Set Theory.

[BibT_eX]

J. Comb. Theory, Ser. A, 1994

Randomness in Distributed Protocols.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Multi-Secret Sharing Schemes.

[BibT_eX]

[DOI]

Giovanni Di Crescenzo

Antonio Giorgio Gaggia

Proceedings of the Advances in Cryptology, 1994

1993

Fault - tolerant hypercube broadcasting via information dispersal.

[BibT_eX]

[DOI]

Networks, 1993

On the Size of Shares for Secret Sharing Schemes.

[BibT_eX]

[DOI]

J. Cryptol., 1993

Fault Tolerant Routing in the Star and Pancake Interconnection Networks.

[BibT_eX]

[DOI]

A. Vozella

Inf. Process. Lett., 1993

Sperner capacities.

[BibT_eX]

[DOI]

Graphs Comb., 1993

Efficient Sharing of Many Secrets.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

Secret Sharing Schemes with Veto Capabilities.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Coding, 1993

Size of Shares and Probability of Cheating in Threshold Schemes.

[BibT_eX]

[DOI]

Marco Carpentieri

Proceedings of the Advances in Cryptology, 1993

1992

On the construction of statistically synchronizable codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Qualitative Independence and Sperner Problems for Directed Graphs.

[BibT_eX]

J. Comb. Theory, Ser. A, 1992

An improved algorithm for quantitative group testing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Search problems for two irregular coins with incomplete feedback: the underweight model.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

On the Information Rate of Secret Sharing Schemes (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

1991

Decoders with Initial State Invariance for Multivalued Encodings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Efficient q-ary immutable codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

1990

Unidirectional error-detecting codes.

[BibT_eX]

[DOI]

Gérard D. Cohen

Proceedings of the EUROCODE '90, 1990

1989

An efficient algorithm for testing immutability of variable-length codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

On the construction of minimal broadcast networks.

[BibT_eX]

[DOI]

Networks, 1989

Structure of decoders for multivalued encodings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1989

Time Bound for Broadcasting in Bounded Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1988

On the characterization of statistically synchronizable variable-length codes.

[BibT_eX]

[DOI]