The Sixth International conference on Fun with Algorithms (FUN 2012) is dedicated to the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area. The previous FUNs were held in Elba Island, in Castiglioncello, Tuscany, Italy, and in Ischia Island, Italy, and special issues of
Theoretical Computer Science (FUN'98),
Discrete Applied Mathematics (FUN'01), and
Theory of Computing Systems (FUN'04,
were dedicated to them.
The topics of interest include (but are not limited to):
FUN with biological algorithms
FUN with cryptographic algorithms
FUN with game-theoretic algorithms
FUN with internet algorithms
FUN with algorithm visualization
FUN with string algorithms
FUN with opimization algorithms
FUN with robotics algorithms
FUN with combinatorial algorithms
FUN with distributed algorithms
FUN with geometrical algorithms
FUN with mobile algorithms
FUN with parallel algorithms
FUN with space-conscious algorithms
- Paper Submission: January 23, 2012
- Acceptance Notification: February 20, 2012
- Hotel reservation: March 11, 2012
- Final version due: March 15, 2012
- Conference: June 4-6, 2012
Alan Borodin University of Toronto, Canada
Erik Demaine MIT, U.S.A.
Luc Devroye McGill University, Canada
- Shlomi Dolev
Ben-Gurion University of the Negev
University of California, Irvine, U.S.A.
University of Waterloo, Canada
CNRS and LaBRI,
University of Athens, Greece
University of Patras, Greece
Carleton University, Canada (Program
Rensselaer Polytechnic Institute, U.S.A
Wesleyan University, U.S.A (Program
Université Libre de Bruxelles, Belgium
University Ca' Foscari, Italy,
Yahoo! Research, U.S.A.
Concordia University, Canada
University of Pisa,
Weizmann Institute, Israel
University of Warwick,
University of Leicester, United Kingdom
Carleton University, Canada
PontifÍcia Universidade Católica do Rio
de Janeiro, Brasil
University of Trieste, Italy
University of Salerno, Italy
ETH Zürich, Switzerland
The Fun with algorithms 2012 will be held in the
facilities of Venice International University, located on the island
of San Servolo, about 10 minutes by water ferry from the Piazza San
Conference proceedings will be published by Springer in the LNCS
series. A special issue of Theory of Computing Systems will be
dedicated to a selected set of papers.
Submitted papers must not substantially overlap with papers that have
been published or that are simultaneously submitted to a journal or a
conference with published proceedings. A full paper should be submitted by January 15, 2012 following
the submission link given at the FUN 2012 web site. Manuscripts
should not exceed 12 pages. Authors of accepted papers are
expected to present their work at the conference.
The paper submission website will be open in January 2012.
Additional details can be found in
FUN with algorithms 2012 Web page.
is a text version of this call for papers.