EXTENDED PAPER SUBMISSION DEADLINE: May 20, 2011
--------------------------------------------------------------------------------------------------------------------
SELECTED PAPERS WILL BE INVITED FOR A SPECIAL ISSUE OF ALGORITHMICA
--------------------------------------------------------------------------------------------------------------------
CALL FOR PAPERS
ICALP 2011 Workshop on
ALGORITHMS AND DATA STRUCTURES FOR SELECTION,
IDENTIFICATION AND ENCODING
Group testing, compressed sensing, multi access communication and more.
July, 3, 2011, Zurich (Switzerland)
https://sites.google.com/site/icalp2011gt/
SCOPE:
The workshop aims at bringing together researchers to exchange ideas and results related to the theoretical and practical aspects of group testing, compressed sensing, and combinatorial identification in a broad sense.
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.
All the above topics are open to both research and industry contributions. Papers reporting on original research unpublished elsewhere as well as surveys of important results, especially recent ones, are invited.
SUBMISSIONS:
Authors should send an extended abstract via the online submission system (easy chair) at
https://www.easychair.org/account/signin.cgi?conf=icalp2011gt
Since there are no official proceedings, simultaneous submission to other conferences are possible. Accepted papers are expected to be presented at the workshop.
PROCEEDINGS and SPECIAL ISSUE:
A selection of the papers accepted for presentation at the workshop will be invited for a special issue of Algorithmica. There are no official proceedings. A booklet with the extended abstracts of the papers presented at the conference will be distributed to the participants.
IMPORTANT DATES:
* Paper submission due (extended): May 20, 2011
* Notification of acceptance: June 5, 2011
ORGANIZING COMMITTEE:
Ferdinando Cicalese, University of Salerno, Italy
Ely Porat, Bar Ilan University, Israel
PROGRAM COMMITTE:
Ferdinando Cicalese - University of Salerno, Italy (co-chair)
Charles J. Colbourn - Arizona State University, USA
Peter Damaschke - Chalmers University, Sweden
Avinatan Hassidim - Google inc.
Sampath Kannan - University of Pennsylvania, USA
Hung Q. Ngo - University at Buffalo, The State University of New York
Ely Porat - Bar Ilan University, Israel (co-chair)
Atri Rudra - University at Buffalo, The State University of New York, USA
Miklós Ruszinkó - MTA SZTAKI, Hungary
Milan Ružić - ITU, Denmark
Noam Shental - Open University of Israel, Israel
Martin J. Strauss - University of Michigan, USA
Ugo Vaccaro - University of Salerno, Italy
CONTACT INFORMATION:
For any further information regarding the workshop, please contact the organizers:
Ferdinando Cicalese, cicalese@dia.unisa.it
Ely Porat, porately@gmail.com
SPONSORS:
Department of Computer Science, University of Salerno, Italy
Department of Computer Science, Bar Ilan University, Israel
**********************************************************
*
* 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/
*
**********************************************************
Posts
