Guest Editorial for "Group Testing: models and applications"

Ferdinando Cicalese, Ely Porat
2013 Algorithmica  
The search model known as group testing has recently seen a new raising interest in several areas of computer science with new applications in pattern matching, data structures for static membership, communication protocols and more. Group testing and group testing like models have also proved useful in furthering new fertile fields like streaming computation and compressed sensing. The use of randomness extraction structures for group testing has provided new stimulus in the field. The basic
more » ... oup testing problem is about identifying a set of positive elements in a given search space by means of tests or queries asking whether a certain subset includes at least one of the positive elements. In a broad sense we can rephrase group testing as the problem of determining some special substructure within a large structure. Due to its foundational characters it is not surprising that the basic structures for group testing are rediscovered in very different scenarios. In this respect, group testing also serves as a perfect ground for cross-fertilization among different fields of research. This special issue consists of 7 papers focussing on different aspects of group testing and the combinatorial structures at the basis of group testing models. In "Unbounded Contention Resolution in Multiple-Access Channels," the authors study the problem of resolving the contention arising when a set of users try to use a shared resource which can only be accessed by one user at a time. They prove optimality of two protocols for content resolution in radio networks assuming that the
doi:10.1007/s00453-013-9812-1 fatcat:42qlujvmffag7ldxrmcnm5ogsq