held on January 16, 2012, at The Westin Miyako, Kyoto, Japan.
ANALCO is co-located with the ACM-SIAM Symposium on Discrete Algorithms
(SODA12), and will take place the day preceding that conference. ANALCO
is also co-located with Algorithm Engineering and Experimentation
(ALENEX12) and will take place on the same day. Since researchers in
both fields are approaching the problem of learning detailed information
about the performance of particular algorithms, we expect that
interesting synergies will develop.
http://www.siam.org/meetings/analco12/
The aim of ANALCO is to provide a forum for the presentation of original
research in the analysis of algorithms and associated combinatorial
structures. We invite both papers that study properties of fundamental
combinatorial structures that arise in practical computational
applications (such as permutations, trees, strings, tries, and graphs)
and papers that address the precise analysis of algorithms for
processing such structures, including: average-case analysis; analysis
of moments, extrema, and distributions; probabilistic analysis of
randomized algorithms, and so on. Submissions that present significant
new information about classic algorithms are welcome, as are new
analyses of new algorithms that present unique analytic challenges. We
also invite submissions that address tools and techniques for the
analysis of algorithms and combinatorial structures, both mathematical
and computational.
The scientific program will include invited talks, contributed research
papers, and ample time for discussion and debate of topics in this area.
Registrants from ALENEX and ANALCO will be cross-registered with the
other. Proceedings of ALENEX and ANALCO will be available online in
January 2012.
Authors are invited to submit 10-page extended abstracts by 5:00 PM EDT,
on Monday, October 3, 2011, to the ANALCO12 submission server
https://www.easychair.org/conferences/?conf=analco12
Papers should be submitted in the form of an extended abstract, which
begins with the title of the paper, each author's name, affiliation, and
e-mail address, followed by a clear statement of the problem considered,
a succinct summary of the results obtained, a brief discussion of the
significance and novelty of the research, and a clear comparison with
related work. The remainder of the extended abstract should provide
sufficient detail to allow the program committee to evaluate the
validity, quality, and relevance of the contribution.
Submissions, excluding title page, bibliography and appendix, should not
exceed 10 pages in 11 point font. Supplementary material may be included
in the appendix.
A paper that has been reviewed and accepted for presentation at SODA is
not eligible for submission to ANALCO. We recognize, however that some
research projects spawn multiple papers that elaborate on different
aspects of the work and are willing to respond to inquiries about SODA,
ALENEX, and ANALCO papers that may overlap. Papers of interest to both
the ALENEX and the ANALCO communities are particularly encouraged. Such
papers may be submitted to either meeting and will, as appropriate, be
presented in a joint session.
ANALCO is supported by SIAM (Society for Industrial and Applied
Mathematics).
Hsien-Kuei Hwang
Conrado Martinez
Co-chairs of the Program Committee of ANALCO 2012
**********************************************************
*
* 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
