TOPICS [Click here for the PRINTABLE VERSION]
This is the third conference 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 first two conferences were held in Elba Island, and a special issue of Theoretical Computer Science (Fun 1998) and of Discrete Applied Mathematics (Fun 2001) were dedicated to them. Among the covered topics:
FUN with biological algorithms
FUN with compression algorithms
FUN with distributed algorithms
FUN with geometrical algorithms
FUN with mobile algorithms
FUN with optimization algorithms
FUN with string algorithms
FUN with combinatorial algorithms
FUN with cryptographic algorithms
FUN with game algorithms
FUN with internet algorithms
FUN with network algorithms
FUN with robot algorithms
FUN with ...
The deadline for receiving submissions is February 27, 2004. Notification of acceptance will be sent by March 26, 2004. Final version of accepted papers is due by April 27, 2004 (please download the LaTeX package file plus.sty and the example file plus.tex, with maximum 12 pages allowed). Conference dates are May 26-28, 2004. Early registration is before May 12, 2004.
A co-located event is a two-day intensive research meeting on Mobile Agent Computing (MAC'04) to be held on May 24-25, 2004, just before FUN, in the same conference site. It is organized by Evangelos Kranakis, Danny Krizanc and Nicola Santoro on topics related to (but not limited to) models for mobile agents, distributed algorithmics with mobile agents, peer-to-peer (P2P) computing, and interconnection of P2P networks.
Erik D. DEMAINE (MIT, USA), Fabrizio LUCCIO (Pisa U., Italy), S. MUTHUKRISHNAN (AT&T & Rutgers, USA), Godfried TOUSSAINT (McGill, Canada).
Lars ARGE (Duke University, USA), Michael BENDER (State U. of NY at Stony Brook), Gerth BRODAL (BRICS, Denmark), Pierluigi CRESCENZI (Firenze U., Italy), Martin FARACH-COLTON (Rutgers U., USA), Paolo FERRAGINA (co-Chair, Pisa U., Italy), Rudolf FLEISCHER (The Hong Kong U. of Science and Technology), Paola FLOCCHINI (Ottawa U., Canada), Pierre FRAIGNIAUD (Paris-Sud U., France), Roberto GROSSI (co-Chair, Pisa U., Italy), Stefano LEONARDI (Universita' di Roma "La Sapienza"), Giovanni MANZINI (Piemonte Orientale U., Italy), Gonzalo NAVARRO (Universidad de Chile), Andrea PIETRACAPRINA (Padova U., Italy), Giuseppe PRENCIPE (Pisa U., Italy), Rajeev RAMAN (Leicester U., UK), Kunihiko SADAKANE (Kyushu U., Japan), Peter SANDERS (Max-Planck-Institut fur Informatik), Steven SKIENA (State U. of NY at Stony Brook), Christos ZAROLIAGIS (Patras U.).
Elena LODI (Pisa U., Italy), Linda PAGLI (Siena U., Italy), Nicola SANTORO (Carleton U., Canada).
CONFERENCE FORMATThe conference will have two tracks: Paper Track and Tutorial Track. For the Paper Track, we solicit papers that provide amusing, original and scientifically profound contributions to the algorithmic area. For the Tutorial Track, we solicit brilliant surveys on novel or revitalized algorithmic fields, with fascinating open problems.
SPECIAL ISSUEThere will be a special issue on the journal Theory of Computing Systems (Springer Verlag) dedicated to the conference, edited by Paolo Ferragina, Roberto Grossi, and Fabrizio Luccio.
SUBMISSION INSTRUCTIONSAuthors should send an extended abstract of their submitted paper (at most 12 pages) or tutorial proposal (at most 4 pages) via electronic mail, in Postscript or PDF format, to the address firstname.lastname@example.org. All accepted papers and tutorials are expected to be presented at the conference and will appear in the proceedings of the conference.
LOCATION and SHUTTLE SERVICEThe conference venue is at Grand Hotel Elba International, in Isola d'Elba (Island of Elba, Tuscany, Italy), a famous Mediterranean resort for its white sand, deep blue sea, and fascinating nature. Hotel rooms will be reserved at a special price for the conference attendants. At your arrival in Portoferraio on May 25th, there will be a shuttle service from 3pm to 7pm.