Annalisa De Bonis

Orcid: 0000-0001-8792-4799

According to our database1, Annalisa De Bonis authored at least 41 papers between 1995 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improved bounds for group testing in arbitrary hypergraphs.
CoRR, 2024

Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023
Conflict Resolution in Arbitrary Hypergraphs.
Proceedings of the Algorithmics of Wireless Networks - 19th International Symposium, 2023

2020
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks.
Theor. Comput. Sci., 2020

2019
New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions.
Theor. Comput. Sci., 2019

2018
Partial Covering Arrays: Algorithms and Asymptotics.
Theory Comput. Syst., 2018

2017
ε-Almost Selectors and Their Applications to Multiple-Access Communication.
IEEE Trans. Inf. Theory, 2017

2016
Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing.
J. Comb. Optim., 2016

Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions.
CoRR, 2016

Generalized Selectors and Locally Thin Families with Applications to Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015
ϵ-Almost Selectors and Their Applications.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014
Efficient Group Testing Algorithms with a Constrained Number of Positive Responses.
Proceedings of the Combinatorial Optimization and Applications, 2014

2011
An Almost Optimal Algorithm for Generalized Threshold Group Testing with Inhibitors.
J. Comput. Biol., 2011

A Group Testing Approach to Improved Corruption Localizing Hashing.
IACR Cryptol. ePrint Arch., 2011

Combinatorial Group Testing for Corruption Localizing Hashing.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2008
New combinatorial structures with applications to efficient group testing with inhibitors.
J. Comb. Optim., 2008

2007
Largest Families Without an <i>r</i> -Fork.
Order, 2007

A lower bound for generalized superimposed codes with application to group testing with inhibitors.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes.
IEEE Trans. Inf. Theory, 2006

2005
Optimal Two-Stage Algorithms for Group Testing Problems.
SIAM J. Comput., 2005

Largest family without <i>A</i> union <i>B</i> subset of <i>C</i> intersection <i>D</i>.
J. Comb. Theory A, 2005

Secure E-Coupons.
Electron. Commer. Res., 2005

2004
Randomness in secret sharing and visual cryptography schemes.
Theor. Comput. Sci., 2004

New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing procedures.
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.
Theor. Comput. Sci., 2003

Generalized Framework for Selectors with Applications in Optimal Group Testing.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Bounds and constructions for metering schemes.
Commun. Inf. Syst., 2002

A lightweight protocol for the generation and distribution of secure e-coupons.
Proceedings of the Eleventh International World Wide Web Conference, 2002

Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels.
Proceedings of the Algorithms, 2002

2001
Efficient algorithms for chemical threshold testing problems.
Theor. Comput. Sci., 2001

Improved Schemes for Visual Cryptography.
Des. Codes Cryptogr., 2001

Secret Sharing and Visual Cryptography Schemes.
Proceedings of the Trusted Information: The New Decade Challenge, 2001

Online Advertising: Secure E-coupons.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000
Metering Schemes with Pricing.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Randomness in Visual Cryptography.
Proceedings of the STACS 2000, 2000

Dynamic Multi-threshold Metering Schemes.
Proceedings of the Selected Areas in Cryptography, 7th Annual International Workshop, 2000

1998
Improved Algorithms for Group Testing with Inhibitors.
Inf. Process. Lett., 1998

A Predetermined Algorithm for Detecting a Counterfeit Coin with a Multi-arms Balance.
Discret. Appl. Math., 1998

Improved Algorithms for Chemical Threshold Testing Problems.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
Group Testing with Unreliable Tests.
Inf. Sci., 1997

1995
optimal Detection of a Counterfeit Coin with Multi-arms Balances.
Discret. Appl. Math., 1995


  Loading...