CALL FOR PAPERS

Fun with Algorithms

Call for Papers - Fun with Algorithms

Fun with Algorithms (FUN) is a series of conferences dedicated to the use, design, and analysis of algorithms and data structures, focusing on results that are "fun" but also original and scientifically solid. "Fun" can be defined in many ways: we think of fun results as being amusing or entertaining by their display of elegance, simplicity, surprise, originality, wit, and so on. The topics of interest include all aspects of algorithm design and analysis, and computational complexity, under any computing model.

The topics of interest include (but are not limited to)...

FUN with biological algorithms
FUN with combinatorial algorithms
FUN with cryptographic algorithms
FUN with distributed algorithms
FUN with game-theoretic algorithms
FUN with geometrical algorithms
FUN with graph algorithms
FUN with mobile algorithms

FUN with machine learning algorithms
FUN with optimization algorithms
FUN with parallel algorithms
FUN with randomized algorithms
FUN with robotics algorithms
FUN with space-conscious algorithms
FUN with string algorithms
FUN with visualization of algorithms
FUN with web algorithms
FUN with algorithmic simplicity

Important dates:

Submission deadline (extended): February 20 27, 2024 (End of Day, Anywhere on Earth (AoE))
Notification date: April 2, 2024
Final version due: April 15, 2024 (AoE)
Conference date: June 4 - 8, 2024

Submissions should be made via our Easychair submission server. (Choose the Fun with Algorithms track) For more details see the submissions page.

Proceedings will be published by LIPIcs, Schloss Dagstuhl – Leibniz Center for Informatics. A selected set of papers accepted to FUN 2024 will be invited to a special issue of Theoretical Computer Science (TCS).

Report abuse