FUN is a series of conferences 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.
Fun is a notion that can be judged from different perspectives, and be defined in many different manners. The conference defines fun in a broad sense, including aspects such as elegance, simplicity, amusement, surprise, originality, etc.
The topics of interest include all aspects of algorithm design and analysis, and of computational complexity, under all types of models (sequential, parallel, distributed, streaming, online, etc.).
At least one author of each accepted paper is expected to physically attend the conference and present the paper.
Proceedings published by LIPIcs, Schloss Dagstuhl – Leibniz Center for Informatics.