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, FUN'07, and FUN'10) were dedicated to them.The topics of interest include (but are not limited to):FUN with biological algorithmsFUN with cryptographic algorithmsFUN with game-theoretic algorithmsFUN with internet algorithmsFUN with opimization algorithmsFUN with robotics algorithmsFUN with string algorithmsFUN with combinatorial algorithmsFUN with distributed algorithmsFUN with geometrical algorithmsFUN with mobile algorithmsFUN with parallel algorithmsFUN with space-conscious algorithmsFUN with algorithm visualizationA 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.
Keywords: Accepted papers list. Acceptance Rate. EI Compendex. Engineering Index. ISTP index. ISI index. Impact Factor. Disclaimer: ourGlocal is an open academical resource system, which anyone can edit or update. Usually, journal information updated by us, journal managers or others. So the information is old or wrong now. Specially, impact factor is changing every year. Even it was correct when updated, it may have been changed now. So please go to Thomson Reuters to confirm latest value about Journal impact factor.