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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024
2023
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
2017
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
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015
2014
Proceedings of the Combinatorial Optimization and Applications, 2014
2011
J. Comput. Biol., 2011
IACR Cryptol. ePrint Arch., 2011
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
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
Largest family without <i>A</i> union <i>B</i> subset of <i>C</i> intersection <i>D</i>.
J. Comb. Theory A, 2005
2004
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
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
2002
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
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
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001
2000
Proceedings of the Distributed Computing, 14th International Conference, 2000
Proceedings of the Selected Areas in Cryptography, 7th Annual International Workshop, 2000
1998
A Predetermined Algorithm for Detecting a Counterfeit Coin with a Multi-arms Balance.
Discret. Appl. Math., 1998
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998
1997
1995
Discret. Appl. Math., 1995