Incipit...".... pleasure has probably been the main goal all along. But I hesitate to admit it, because computer scientists want to maintain their image as hard-working individuals who deserve high salaries. Sooner or later society will realise that certain kinds of hard work are in fact admirable even though they are more fun than just about anything else."D. E. Knuth, Stanford U., The Stanford Graph Base: A Platform for Combinatorial Computing. |
TOPICS [Click here for the PRINTABLE VERSION]
The fourth conference on Fun with Algorithms (FUN 2007) 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 three FUNs were held in Elba Island, Tuscany, 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. Among the
covered topics, we seek submissions on FUN with: |
|
|
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 |
IMPORTANT DATES
The deadline for receiving submissions is extended to January 22, 2007 (further extensions will not be granted). Notification of acceptance will be sent by February 26, 2007. Final version of accepted papers is due by March 20, 2007. Conference dates are June 3-5, 2007.
NOTE: Due to the deadline extension, notification of acceptance is delayed until March 1st, 2007
Conference proceedings will be published by Springer in the LNCS series.
INVITED SPEAKERS
Giuseppe DI BATTISTA (U. Roma III), Nicola SANTORO (Carleton U.), Luca TREVISAN (U. C. Berkeley)
PROGRAM COMMITTEE
Nancy AMATO (Texas A&M U.), Nina AMENTA (U.C. Davis), Marcella ANSELMO (U. Salerno), Anna BERNASCONI (U. Pisa), Paolo BOLDI (U. Milano), Pilu CRESCENZI (U. Firenze, co-chair), Irene FINOCCHI (U. Roma La Sapienza), Luisa GARGANO (U. Salerno), Sandy IRANI (U.C. Irvine), Christos KAKLAMANIS (U. Patras), Shay KUTTEN (Technion), Fabrizio LUCCIO (U. Pisa), Bernard MANS (Macquarie U.), Paolo PENNA (U. Salerno), Geppino PUCCI (U. Padova, co-chair), Andrea RICHA (Arizona State U.), Iain STEWART (U. Durham), Erkki SUTINEN (U. Joensuu), Denis TRYSTRAM (ID-IMAG, Grenoble), Peter WIDMAYER (ETH Zurich)
STEERING COMMITTEE
Elena LODI (Siena U., Italy), Linda PAGLI (Pisa U., Italy), Nicola SANTORO (Carleton U., Canada).
MORE ...
|
|
SPECIAL ISSUETo be decided. |
SUBMISSION INSTRUCTIONSAuthors are encouraged to submit their manuscript electronically (at most 12 pages) using the electronic submission system. Authors unable to submit
electronically should contact the FUN 2007 co-chairs for instructions
(email: funwithalgorithms@gmail.com). |
LOCATIONThe conference venue is at Castello Pasquini , in Castiglioncello (Tuscany, Italy). Hotel rooms will be reserved at a special price for the conference attendants. |
