CFP: 3rd FUN with Algorithms - DEADLINE FEB 27, 2004

From: Roberto Grossi (grossi_at_di.unipi.it)
Date: 02/07/04


Date: Sat, 07 Feb 2004 19:04:22 +0100


                             CALL FOR PAPERS

        3rd International Conference on FUN with Algorithms (FUN 2004)

                   Isola d'Elba, Italy, May 26-28, 2004
                        http://www.di.unipi.it/fun04

----------------------------------------------------------------------
         "... 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)
----------------------------------------------------------------------

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 I)  and of  Discrete Applied  Mathematics (Fun  II) were
dedicated to them.

TOPICS:
FUN with biological algorithms     FUN with combinatorial algorithms
FUN with compression algorithms    FUN with cryptographic algorithms
FUN with distributed algorithms    FUN with game algorithms
FUN with geometrical algorithms    FUN with internet algorithms
FUN with mobile algorithms         FUN with network algorithms
FUN with optimization algorithms   FUN with robot algorithms
FUN with string algorithms         FUN with....

LOCATION:  
The conference will  take place at Grand Hotel  Elba International, in
Isola d'Elba, a  famous resort for its white sand,  deep blue sea, and
fascinating nature.  Hotel rooms will  be reserved at a  special price
for the conference attendants.

CONFERENCE  FORMAT:
The 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.

IMPORTANT DATES:
The deadline for receiving submissions is  FEBRUARY 27, 2004.
Notification of acceptance will be sent by MARCH 26, 2004.
Final copies of accepted papers due by APRIL 13, 2004.

SUBMISSION  INSTRUCTIONS:
Authors 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:

                           fun04@di.unipi.it

All accepted papers and tutorials  are expected to be presented at the
workshop and will appear in the proceedings of the conference.

SPECIAL ISSUE:
There  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.

INVITED SPEAKERS:
Erik Demaine (MIT, USA)
Fabrizio Luccio (Pisa U., Italy)
S. Muthukrishnan (AT&T, USA)
Godfried Toussaint (McGill, Canada)

PROGRAM COMMITTEE:
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 (Pisa U., Italy), co-Chair
Rudolf Fleischer (The Hong Kong U. of Science and Technology)
Paola Flocchini (Ottawa U., Canada)
Pierre Fraigniaud (Paris-Sud U., France)
Roberto Grossi (Pisa U., Italy), co-Chair
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.)

STEERING COMMITTEE:
Elena Lodi (Siena U., Italy)
Linda Pagli (Pisa U., Italy)
Nicola Santoro (Carleton U., Canada)
=================================================================



Relevant Pages

  • Re: fov algorithms comparison method
    ... I'm not arguing against the use of FOV algorithms. ... Comparing algorithms by running selected implementions against a few ... The problem is that its special cases that people find fun. ... is not to make the monsters play fair, it's to make the game fun. ...
    (rec.games.roguelike.development)
  • Re: Some confusion about virtual cache
    ... creating arch dependant code is fun! ... |> important algorithms in as pure and machine-independent form as you can, ... |> you'll wind up spending all your time chasing architecture variations, ... in case it creeps into a real program. ...
    (comp.arch)
  • Re: Some confusion about virtual cache
    ... creating arch dependant code is fun! ... important algorithms in as pure and machine-independent form as you can, ... you'll wind up spending all your time chasing architecture variations, ...
    (comp.arch)
  • Re: When do YOU optimize?
    ... at home for fun. ... Sometimes my algorithms are just in need of refactoring or ... of .NET code I write is used in back-end server systems that process roughly ...
    (borland.public.delphi.non-technical)
  • TAMC 2008, Xian, China - Final call for papers
    ... 5th Annual Conference on Theory and Applications of Models of Computation ... Computability, Complexity, and Algorithms. ... Accepted papers will be published in the conference proceedings, ... Ying Jiang (Chinese Academy of Sciences) ...
    (comp.specification.z)