Tuesday, October 25, 2011

[DMANET] Special Issue of Algorithmica on "Algorithms & DataStructures for Selection, Identification and Encoding"

CALL FOR PAPERS
Special Issue of Algorithmica on:
"Algorithms and Data Structures for selection, identification and encoding -
Group testing, compressed sensing, multi access communication and more"


Manuscripts are solicited for a special issue in the international journal ALGORITHMICA on "Algorithms and Data Structures for selection, identification and encoding - Group testing, compressed sensing, multi access communication and more"

Theoretical and practical studies in group testing, compressed sensing and in a broader sense combinatorial identification are attracting increasing interest in the areas of Theoretical Computer Science, Computational Biology, Combinatorial Optimization, Multi-access Communications and Distributed Computing.

With this Special Issue, we wish to foster research in group testing and compressed sensing, and their many different facets, by exposing new results and directions for further research and to contribute to the development of further scientific links with this flourishing area of investigation.

Papers presenting use of group testing and selection primitives in pattern matching, data structures for static membership, communication protocols, cryptographic protocols, streaming computation, bioinformatics and computational biology, compressed sensing as well as papers focussing on theoretical aspects of combinatorial structures for identification and coding, like randomness extractors, superimposed codes, list-decodable codes, selectors, and the like are welcome.

Submissions must be received by December 31, 2011. To ensure that all manuscripts are correctly identified for inclusion into the special issue, it is important that authors select "SI: Group Testing & Compressed Sensing" when they reach the step in the submission process.

Papers will be refereed according to the standards of Algorithmica. We will do our best to have the refereeing procedure timely finished.

Please contact the guest editors for additional information.


The Guest Editors
Ferdinando Cicalese and Ely Porat

Ferdinando Cicalese,
Department of Computer Science
University of Salerno, Italy
cicalese@dia.unisa.it

Ely Porat,
Department of Computer Science
Bar Ilan University, Israel
porately@gmail.com


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************