Processing math: 0%
Annalisa De Bonis - IEEE Xplore Author Profile
Subscribe
ADVANCED SEARCH

Author details

< Back

Annalisa De Bonis

Also published under: A. De Bonis

Publications
6
Citations
27
Publications by Year
20002017
Co-Authors:
Headshot silhouette indicating that no photo is available for this author

Annalisa De Bonis

Also published under: A. De Bonis

Affiliation

Dipartimento di Informatica
Università di Salerno
Fisciano, Italy

Publication Topics

Biography

Annalisa De Bonis got her Laurea (cum laude) in Computer Science from Università degli Studi di Salerno in 1991. In 1996 she got a Master of Science in Engineering from the Computer Science Department of Princeton University, and in 2001 she got a PhD in Computer Science from Università di Salerno. In 2001 she was awarded a Postdoc Fellowship from Università di Salerno and from 2002 through 2015 she has been "Ricercatore" (Assistant Professor) at Università di Salerno. Since 2015 she has been Associate Professor at Università di Salerno. Her research interests include algorithms, combinatorics, group testing, multiple access communication, and criptography.(Based on document published on 11 September 2017).
Publications
6
Citations
27
Publications by Year
20002017
Co-Authors:
Author's Published Works

Showing 1-6 of 6 results

  • Sort

Filter Results

Show

Sort By

Results

\epsilon -Almost Selectors and Their Applications to Multiple-Access Communication

Annalisa De Bonis;Ugo Vaccaro

IEEE Transactions on Information Theory
Year: 2017 | Volume: 63, Issue: 11 | Journal Article |
Cited by: Papers (6)
Consider a group of stations connected through a multiple-access channel, with the constraint that if at a time instant exactly one station transmits a message, then the message is successfully received by any other station, whereas if two or more stations simultaneously transmit their messages then a conflict occurs and all messages are lost. Let us assume that n is the number of stations and tha...Show More

\epsilon -Almost Selectors and Their Applications to Multiple-Access Communication

Annalisa De Bonis;Ugo Vaccaro

Year: 2017 | Volume: 63, Issue: 11 | Journal Article |

A lower bound for generalized superimposed codes with application to group testing with inhibitors

Annalisa De Bonis

2007 IEEE International Symposium on Information Theory
Year: 2007 | Conference Paper |
It has been introduced a new generalization of superimposed codes that finds application to the design of efficient algorithms for a variant of group testing known as group testing with inhibitors (GTI). Families associated to these codes have the property that for every q + Sigmai=1 s pi pairwise different members F1 1,hellip,Fp1 1,hellip, F1 s,hellip,Fps s,G1, hellip,Gq of the family it holds ca...Show More

A lower bound for generalized superimposed codes with application to group testing with inhibitors

Annalisa De Bonis

Year: 2007 | Conference Paper |

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

A. De Bonis;U. Vaccaro

IEEE Transactions on Information Theory
Year: 2006 | Volume: 52, Issue: 10 | Journal Article |
Cited by: Papers (18)
Two variants of the well-known group testing problem are considered. In the first variant a finite set of items O and an unknown subset PsubeO are given, and one wants to identify the set P by asking the least number of questions of the form "Is |QcapP|=1?", where QsubeO. This problem naturally arises in the design of efficient contention resolution algorithms for certain random multiple-access co...Show More

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

A. De Bonis;U. Vaccaro

Year: 2006 | Volume: 52, Issue: 10 | Journal Article |

Generalizations of superimposed codes with applications to efficient design of pooling experiments

A. De Bonis;U. Vaccaro

Proceedings IEEE International Symposium on Information Theory,
Year: 2002 | Conference Paper |
We introduce a parameterized generalization of the well known superimposed codes. We give algorithms for their constructions and provide non-existential results. We apply our new combinatorial structures to the efficient solution of group testing problems arising in the realm of computational molecular biology.Show More

Generalizations of superimposed codes with applications to efficient design of pooling experiments

A. De Bonis;U. Vaccaro

Year: 2002 | Conference Paper |

An information theoretic approach to metering schemes

A. De Bonis;B. Masucci

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
Year: 2000 | Conference Paper |
Cited by: Papers (3)
A metering scheme is a method to count the number of clients which visit each server. Naor and Pinkas (see Eurocrypt '98) presented metering schemes which allow to identify servers which are visited by at least a certain number h of clients and is secure against attempts by servers of inflating the count of their visits. We consider secure metering schemes for ramp access structures. We provide lo...Show More

An information theoretic approach to metering schemes

A. De Bonis;B. Masucci

Year: 2000 | Conference Paper |

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.