Category FUN 2012

Deadline: January 15, 2012 | Date: June 25, 2012-June 27, 2012

Venue/Country: Venice, Italy

Updated: 2011-10-24 09:45:10 (GMT+9)

Call For Papers - CFP

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 opimization algorithms

FUN with robotics algorithms

FUN with string 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

FUN with algorithm visualization

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 program committee will determine appropriate time allocations for presentations (between 20 and 45 minutes).

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.