ALENEX13 - Meeting on Algorithm Engineering & Experiments

  • Conference Call
  • Conference Theme

    The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing.

    ALENEX is co-located with the ACM-SIAM Symposium on Discrete Algorithms (SODA13), and Analytic Algorithmics and Combinatorics (ANALCO13). Since researchers in all fields are approaching the problem of learning detailed information about the performance of particular algorithms, we expect that interesting synergies will develop.

    Proceedings of ALENEX and ANALCO will be published openly and electronically in December 2012. A special issue of the ACM Journal of Experimental Algorithmics will be dedicated to selected papers from ALENEX13.

    A paper that has been reviewed and accepted for presentation at SODA is not eligible for submission to ALENEX. 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. regarding ALENEX may be sent to ALENEX co-chairs Peter Sanders (sanders@kit.edu) or Norbert Zeh (nzeh@cs.dal.ca).

    SPECIAL NOTICE: ALENEX will be offered as a fourth "track" on the second day of SODA (January 7, 2013). The ANALCO and ALENEX programs will be integrated with the SODA program and all papers will be available online before the conference.

    ALENEX is supported by SIAM (Society for Industrial and Applied Mathematics) and SIGACT (ACM Special Interest Group on Algorithms and Computation Theory).

    Parallel Conferences

    The meeting is being held with:

    If you are tweeting about the conference, please use the designated hashtag to enable other attendees to keep up with the Twitter conversation and to allow better archiving of our conference discussions. The hashtag for ALENEX is #ALENEX13 and ANALCO is #ANALCO13.

    Program Committee Co-Chairs

    • Peter Sanders, Karlsruhe Institute of Technology, Germany
    • Norbert Zeh, Dalhousie University, Canada

    Program Committee

    • Graham Cormode, AT&T Labs Research, USA
    • Daniel Delling, Microsoft Research, USA
    • Rolf Fagerberg, University of Southern Denmark, Denmark
    • Irene Finocchi, University of Rome "La Sapienza," Italy
    • Bruce Hendrickson, Sandia National Laboratories, USA
    • Alejandro López-Ortiz, University of Waterloo, Canada
    • Gonzalo Navarro, University of Chile, Chile
    • Knut Reinert, Freie Universität Berlin, Germany
    • Martin Skutella, Technische Universität Berlin, Germany
    • Kavitha Telikepalli, Tata Institute of Fundamental Research, India
    • Takeaki Uno, National Institute of Informatics, Japan
    • Ke Yi, Hong Kong University of Science and Technology, Hong Kong

    Timeline

    Conference START

    All deadlines have expired!

    This conference has no more open deadlines. There may be successive conferences coming up you may by interested in.

    Please check our conference list and search...

    Conference Facts

    Location , Address Canal St 739 Category Organiser More Info Conference Website

    Further interesting Conferences

    Currently we have no similar events listed. Please check our website regulary, subscribe to our RSS-Feed or follow us on twitter for new listings.