default search action
Annalisa De Bonis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Annalisa De Bonis:
Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures. SOFSEM 2024: 154-168 - [i6]Annalisa De Bonis:
Improved bounds for group testing in arbitrary hypergraphs. CoRR abs/2404.18783 (2024) - 2023
- [c18]Annalisa De Bonis:
Conflict Resolution in Arbitrary Hypergraphs. ALGOWIN 2023: 13-27 - [i5]Annalisa De Bonis:
Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures. CoRR abs/2307.09608 (2023) - 2020
- [j21]Annalisa De Bonis, Ugo Vaccaro:
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks. Theor. Comput. Sci. 806: 219-235 (2020)
2010 – 2019
- 2019
- [j20]Annalisa De Bonis:
New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions. Theor. Comput. Sci. 796: 34-50 (2019) - 2018
- [j19]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. Theory Comput. Syst. 62(6): 1470-1489 (2018) - 2017
- [j18]Annalisa De Bonis
, Ugo Vaccaro
ε-Almost Selectors and Their Applications to Multiple-Access Communication. IEEE Trans. Inf. Theory 63(11): 7304-7319 (2017) - 2016
- [j17]Annalisa De Bonis:
Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing. J. Comb. Optim. 32(4): 1254-1287 (2016) - [c17]Annalisa De Bonis, Ugo Vaccaro:
A New Kind of Selectors and Their Applications to Conflict Resolution in Wireless Multichannels Networks. ALGOSENSORS 2016: 45-61 - [c16]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. IWOCA 2016: 437-448 - [c15]Annalisa De Bonis:
Generalized Selectors and Locally Thin Families with Applications to Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions. OPODIS 2016: 22:1-22:16 - [i4]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. CoRR abs/1605.02131 (2016) - [i3]Annalisa De Bonis:
Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions. CoRR abs/1606.03198 (2016) - [i2]Annalisa De Bonis:
Constraining the Number of Positive Responses in Adaptive, Non-Adaptive, and Two-Stage Group Testing. CoRR abs/1606.03200 (2016) - 2015
- [c14]Annalisa De Bonis, Ugo Vaccaro:
ϵ-Almost Selectors and Their Applications. FCT 2015: 255-268 - 2014
- [c13]Annalisa De Bonis:
Efficient Group Testing Algorithms with a Constrained Number of Positive Responses. COCOA 2014: 506-521 - 2011
- [j16]Hong-Bin Chen, Annalisa De Bonis:
An Almost Optimal Algorithm for Generalized Threshold Group Testing with Inhibitors. J. Comput. Biol. 18(6): 851-864 (2011) - [c12]Annalisa De Bonis, Giovanni Di Crescenzo:
Combinatorial Group Testing for Corruption Localizing Hashing. COCOON 2011: 579-591 - [i1]Annalisa De Bonis, Giovanni Di Crescenzo:
A Group Testing Approach to Improved Corruption Localizing Hashing. IACR Cryptol. ePrint Arch. 2011: 562 (2011)
2000 – 2009
- 2008
- [j15]Annalisa De Bonis:
New combinatorial structures with applications to efficient group testing with inhibitors. J. Comb. Optim. 15(1): 77-94 (2008) - 2007
- [j14]Annalisa De Bonis, Gyula O. H. Katona:
Largest Families Without an r -Fork. Order 24(3): 181-191 (2007) - [c11]Annalisa De Bonis:
A lower bound for generalized superimposed codes with application to group testing with inhibitors. ISIT 2007: 341-345 - 2006
- [j13]Annalisa De Bonis, Ugo Vaccaro:
Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes. IEEE Trans. Inf. Theory 52(10): 4673-4680 (2006) - 2005
- [j12]Carlo Blundo
Secure E-Coupons. Electron. Commer. Res. 5(1): 117-139 (2005) - [j11]Annalisa De Bonis, Gyula O. H. Katona, Konrad J. Swanepoel:
Largest family without A union B subset of C intersection D. J. Comb. Theory A 111(2): 331-336 (2005) - [j10]Annalisa De Bonis, Leszek Gasieniec, Ugo Vaccaro:
Optimal Two-Stage Algorithms for Group Testing Problems. SIAM J. Comput. 34(5): 1253-1270 (2005) - 2004
- [j9]Annalisa De Bonis, Alfredo De Santis
Randomness in secret sharing and visual cryptography schemes. Theor. Comput. Sci. 314(3): 351-374 (2004) - [c10]Annalisa De Bonis, Ugo Vaccaro:
New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing procedures. ISIT 2004: 257 - 2003
- [j8]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) - [c9]Annalisa De Bonis, Leszek Gasieniec, Ugo Vaccaro:
Generalized Framework for Selectors with Applications in Optimal Group Testing. ICALP 2003: 81-96 - 2002
- [j7]Carlo Blundo, Annalisa De Bonis, Barbara Masucci:
Bounds and constructions for metering schemes. Commun. Inf. Syst. 2(1): 1-28 (2002) - [c8]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 - [c7]Carlo Blundo
A lightweight protocol for the generation and distribution of secure e-coupons. WWW 2002: 542-552 - 2001
- [j6]Carlo Blundo, Annalisa De Bonis, Alfredo De Santis:
Improved Schemes for Visual Cryptography. Des. Codes Cryptogr. 24(3): 255-278 (2001) - [j5]Annalisa De Bonis, Luisa Gargano
Efficient algorithms for chemical threshold testing problems. Theor. Comput. Sci. 259(1-2): 493-511 (2001) - [c6]Stelvio Cimato, Annalisa De Bonis:
Online Advertising: Secure E-coupons. ICTCS 2001: 370-383 - [c5]Annalisa De Bonis, Alfredo De Santis:
Secret Sharing and Visual Cryptography Schemes. SEC 2001: 123-138 - 2000
- [c4]Carlo Blundo, Annalisa De Bonis, Barbara Masucci, Douglas R. Stinson:
Dynamic Multi-threshold Metering Schemes. Selected Areas in Cryptography 2000: 130-143 - [c3]Annalisa De Bonis, Alfredo De Santis
Randomness in Visual Cryptography. STACS 2000: 626-638 - [c2]Carlo Blundo, Annalisa De Bonis, Barbara Masucci:
Metering Schemes with Pricing. DISC 2000: 194-208
1990 – 1999
- 1998
- [j4]Annalisa De Bonis:
A Predetermined Algorithm for Detecting a Counterfeit Coin with a Multi-arms Balance. Discret. Appl. Math. 86(2-3): 181-200 (1998) - [j3]Annalisa De Bonis, Ugo Vaccaro:
Improved Algorithms for Group Testing with Inhibitors. Inf. Process. Lett. 67(2): 57-64 (1998) - [c1]Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro:
Improved Algorithms for Chemical Threshold Testing Problems. COCOON 1998: 127-136 - 1997
- [j2]Annalisa De Bonis, Luisa Gargano
Group Testing with Unreliable Tests. Inf. Sci. 96(1&2): 1-14 (1997) - 1995
- [j1]Annalisa De Bonis, Luisa Gargano
optimal Detection of a Counterfeit Coin with Multi-arms Balances. Discret. Appl. Math. 61(2): 121-131 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: