Conference on Fun with Algorithms
FUN
National
CORE rank
CORE rank (raw)
National: Italy
Fields of research
Theory of Computation · Data Management and Data Science
Papers indexed
311
2007–2026
Papers per year
200741 peak2026
Most published authors
FUN papers
311 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2022 | Pushing Blocks by Sweeping Lines. | Hugo A. Akitaya, Maarten Lffler, Giovanni Viglietta |
| 2021 | Singletons for Simpletons: Revisiting Windowed Backoff with Chernoff Bounds. | Qian M. Zhou, Aiden Calvert, Maxwell Young |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2021 | Taming the Knight's Tour: Minimizing Turns and Crossings. | Juan Jos Besa Vial, Timothy Johnson, Nil Mamano, Martha C. Osegueda |
| 2021 | Physical Zero-Knowledge Proof for Numberlink. | Suthee Ruangwises, Toshiya Itoh |
| 2021 | Card-Based ZKP Protocols for Takuzu and Juosan. | Daiki Miyahara, Lo Robert, Pascal Lafourcade, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, Hideaki Sone |
| 2021 | Train Tracks with Gaps. | William Kuszmaul |
| 2021 | Hyperbolic Minesweeper Is in P. | Eryk Kopczynski |
| 2021 | Efficient Algorithm for Multiplication of Numbers in Zeckendorf Representation. | Tomasz Idziaszek |
| 2021 | An Open Pouring Problem. | Fabian Frei, Peter Rossmanith, David Wehner |
| 2021 | On the Treewidth of Hanoi Graphs. | David Eppstein, Daniel Frishberg, William Maxwell |
| 2021 | A Phase Transition in Minesweeper. | Ross Dempsey, Charles Guinn |
| 2021 | Efficient Algorithms for Battleship. | Loc Crombez, Guilherme Dias da Fonseca, Yan Gerard |
| 2021 | Speeding up Networks Mining via Neighborhood Diversity. | Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno |
| 2021 | Computational Fun with Sturdy and Flimsy Numbers. | Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman |
| 2021 | Magic: The Gathering Is Turing Complete. | Alex Churchill, Stella Biderman, Austin Herrick |
| 2021 | An Optimal Algorithm for Online Freeze-Tag. | Josh Brunner, Julian Wellman |
| 2021 | 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete. | Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff |
| 2021 | Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard. | Thomas Brocken, G. Wessel van der Heijden, Irina Kostitsyna, Lloyd E. Lo-Wong, Remco J. A. Surtel |
| 2021 | Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots. | Quentin Bramas, Pascal Lafourcade, Stphane Devismes |
| 2021 | Cutting Bamboo down to Size. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Giacomo Scornavacca |
| 2021 | The Computational Complexity of Evil Hangman. | Jrmy Barbay, Bernardo Subercaseaux |
| 2021 | Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets. | Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch |
| 2021 | Collaborative Procrastination. | Aris Anagnostopoulos, Aristides Gionis, Nikos Parotsidis |
| 2021 | Tatamibari Is NP-Complete. | Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch |
101–125 of 311← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing