2008 |
23 | EE | Annalisa De Bonis:
New combinatorial structures with applications to efficient group testing with inhibitors.
J. Comb. Optim. 15(1): 77-94 (2008) |
2007 |
22 | EE | Annalisa De Bonis,
Gyula O. H. Katona:
Largest Families Without an r -Fork.
Order 24(3): 181-191 (2007) |
2006 |
21 | EE | Annalisa De Bonis,
Ugo Vaccaro:
Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes.
IEEE Transactions on Information Theory 52(10): 4673-4680 (2006) |
2005 |
20 | EE | Carlo Blundo,
Stelvio Cimato,
Annalisa De Bonis:
Secure E-Coupons.
Electronic Commerce Research 5(1): 117-139 (2005) |
19 | EE | Annalisa De Bonis,
Gyula O. H. Katona,
Konrad J. Swanepoel:
Largest family without A union B subset of C intersection D.
J. Comb. Theory, Ser. A 111(2): 331-336 (2005) |
18 | EE | Annalisa De Bonis,
Leszek Gasieniec,
Ugo Vaccaro:
Optimal Two-Stage Algorithms for Group Testing Problems.
SIAM J. Comput. 34(5): 1253-1270 (2005) |
2004 |
17 | EE | Annalisa De Bonis,
Alfredo De Santis:
Randomness in secret sharing and visual cryptography schemes.
Theor. Comput. Sci. 314(3): 351-374 (2004) |
2003 |
16 | EE | Annalisa De Bonis,
Leszek Gasieniec,
Ugo Vaccaro:
Generalized Framework for Selectors with Applications in Optimal Group Testing.
ICALP 2003: 81-96 |
15 | EE | Annalisa De Bonis,
Ugo Vaccaro:
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
Theor. Comput. Sci. 306(1-3): 223-243 (2003) |
2002 |
14 | EE | Annalisa De Bonis,
Ugo Vaccaro:
Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels.
ESA 2002: 335-347 |
13 | EE | Carlo Blundo,
Stelvio Cimato,
Annalisa De Bonis:
A lightweight protocol for the generation and distribution of secure e-coupons.
WWW 2002: 542-552 |
2001 |
12 | EE | Stelvio Cimato,
Annalisa De Bonis:
Online Advertising: Secure E-coupons.
ICTCS 2001: 370-383 |
11 | | Annalisa De Bonis,
Alfredo De Santis:
Secret Sharing and Visual Cryptography Schemes.
SEC 2001: 123-138 |
10 | | Carlo Blundo,
Annalisa De Bonis,
Alfredo De Santis:
Improved Schemes for Visual Cryptography.
Des. Codes Cryptography 24(3): 255-278 (2001) |
9 | EE | Annalisa De Bonis,
Luisa Gargano,
Ugo Vaccaro:
Efficient algorithms for chemical threshold testing problems.
Theor. Comput. Sci. 259(1-2): 493-511 (2001) |
2000 |
8 | EE | Carlo Blundo,
Annalisa De Bonis,
Barbara Masucci:
Metering Schemes with Pricing.
DISC 2000: 194-208 |
7 | EE | Annalisa De Bonis,
Alfredo De Santis:
Randomness in Visual Cryptography.
STACS 2000: 626-638 |
6 | EE | Carlo Blundo,
Annalisa De Bonis,
Barbara Masucci,
Douglas R. Stinson:
Dynamic Multi-threshold Metering Schemes.
Selected Areas in Cryptography 2000: 130-143 |
1998 |
5 | EE | Annalisa De Bonis,
Luisa Gargano,
Ugo Vaccaro:
Improved Algorithms for Chemical Threshold Testing Problems.
COCOON 1998: 127-136 |
4 | EE | Annalisa De Bonis:
A Predetermined Algorithm for Detecting a Counterfeit Coin with a Multi-arms Balance.
Discrete Applied Mathematics 86(2-3): 181-200 (1998) |
3 | EE | Annalisa De Bonis,
Ugo Vaccaro:
Improved Algorithms for Group Testing with Inhibitors.
Inf. Process. Lett. 67(2): 57-64 (1998) |
1997 |
2 | | Annalisa De Bonis,
Luisa Gargano,
Ugo Vaccaro:
Group Testing with Unreliable Tests.
Inf. Sci. 96(1&2): 1-14 (1997) |
1995 |
1 | EE | Annalisa De Bonis,
Luisa Gargano,
Ugo Vaccaro:
optimal Detection of a Counterfeit Coin with Multi-arms Balances.
Discrete Applied Mathematics 61(2): 121-131 (1995) |