| |||||||||||||||
FUN 2022 : Fun with AlgorithmsConference Series : Fun with Algorithms | |||||||||||||||
Link: https://sites.google.com/view/fun2022/home?authuser=0 | |||||||||||||||
| |||||||||||||||
Call For Papers | |||||||||||||||
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.). The conference is planned to be with all participants on site, if the situation with the pandemic allows FUN to be held that way. FUN 2022 will be co-located with FUN 2020, which was postponed due to the pandemic. Important dates: Submission deadline: February 18, 2022 (End of Day, Anywhere on Earth (AoE)) Notification date: March 22, 2022 Final version due: March 30, 2022 Conference date: May 30 - June 3, 2022 Proceedings published by LIPIcs, Schloss Dagstuhl – Leibniz Center for Informatics. A selected set of papers accepted to FUN 2022 will be invited to a special issue of Theoretical Computer Science (TCS). |
|