LIPIcs, Volume 291, FUN 2024

• Andrei Z. Broder and Tami Tamir LIPIcs, Volume 291, FUN 2024, Complete Volume 10.4230/LIPIcs.FUN.2024
• Andrei Z. Broder and Tami Tamir Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FUN.2024.0
• Zachary Abel and Della Hendrickson Baba Is Universal 10.4230/LIPIcs.FUN.2024.1
• Guillaume Bagan, Eric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalački, Nacim Oijid, Aline Parreau, and Miloš Stojaković Poset Positional Games 10.4230/LIPIcs.FUN.2024.2
• Philip Bille, Martín Farach-Colton, Inge Li Gørtz, and Ivor van der Hoog Snake in Optimal Space and Time 10.4230/LIPIcs.FUN.2024.3
• Davide Bilò, Luca Di Donato, Luciano Gualà, and Stefano Leucci Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard 10.4230/LIPIcs.FUN.2024.4
• Davide Bilò, Maurizio Fiusco, Luciano Gualà, and Stefano Leucci Swapping Mixed-Up Beers to Keep Them Cool 10.4230/LIPIcs.FUN.2024.5
• Gerth Stølting Brodal Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin 10.4230/LIPIcs.FUN.2024.6
• Xavier Bultel Physical Ring Signature 10.4230/LIPIcs.FUN.2024.7
• Kyle Burke, Matthew Ferland, Svenja Huntemann, and Shanghua Teng A Tractability Gap Beyond Nim-Sums: It’s Hard to Tell Whether a Bunch of Superstars Are Losers 10.4230/LIPIcs.FUN.2024.8
• Basile Couëtoux, Bastien Gastaldi, and Guyslain Naves The Steady-States of Splitter Networks 10.4230/LIPIcs.FUN.2024.9
• Antoine Dailly, Pascal Lafourcade, and Gaël Marcadet How Did They Design This Game? Swish: Complexity and Unplayable Positions 10.4230/LIPIcs.FUN.2024.10
• Marnix Deurloo, Mitchell Donkers, Mieke Maarse, Benjamin G. Rin, and Karen Schutte Hamiltonian Paths and Cycles in NP-Complete Puzzles 10.4230/LIPIcs.FUN.2024.11
• Reo Eriguchi, Kazumasa Shinagawa, and Takao Murakami Card-Based Cryptography Meets Differential Privacy 10.4230/LIPIcs.FUN.2024.12
• Simone Faro, Francesco Pio Marino, Andrea Moschetto, Arianna Pavone, and Antonio Scardace The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples 10.4230/LIPIcs.FUN.2024.13
• Thomas Garrison, Marijn J. H. Heule, and Bernardo Subercaseaux PackIt!: Gamified Rectangle Packing 10.4230/LIPIcs.FUN.2024.14
• Leszek Gąsieniec, Benjamin Smith, and Sebastian Wild Polyamorous Scheduling 10.4230/LIPIcs.FUN.2024.15
• Matthias Gehnen and Luca Venier Tetris Is Not Competitive 10.4230/LIPIcs.FUN.2024.16
• Yuki Iburi and Ryuhei Uehara Computational Complexity of Matching Match Puzzle 10.4230/LIPIcs.FUN.2024.17
• Christian Ikenmeyer and Dylan Khangure Advanced Spikes `n' Stuff: An NP-Hard Puzzle Game in Which All Tutorials Are Efficiently Solvable 10.4230/LIPIcs.FUN.2024.18
• Jaehyun Koo Anarchy in the APSP: Algorithm and Hardness for Incorrect Implementation of Floyd-Warshall 10.4230/LIPIcs.FUN.2024.19
• Fabrizio Luccio, Linda Pagli, and Nicola Santoro Variations on the Tournament Problem 10.4230/LIPIcs.FUN.2024.20
• MIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, and Matias Korman PSPACE-Hard 2D Super Mario Games: Thirteen Doors 10.4230/LIPIcs.FUN.2024.21
• MIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Ricardo Ruiz, and Naveen Venkat You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games 10.4230/LIPIcs.FUN.2024.22
• MIT Hardness Group, Josh Brunner, Lily Chung, Erik D. Demaine, Della Hendrickson, and Andy Tockman ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles 10.4230/LIPIcs.FUN.2024.23
• MIT Hardness Group, Erik D. Demaine, Holden Hall, and Jeffery Li Tetris with Few Piece Types 10.4230/LIPIcs.FUN.2024.24
• MIT Hardness Group, Della Hendrickson, and Andy Tockman Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants 10.4230/LIPIcs.FUN.2024.25
• Alessandro Panconesi, Pietro Maria Posta, and Mirko Giacchini Coordinating "7 Billion Humans" Is Hard 10.4230/LIPIcs.FUN.2024.26
• Benjamin G. Rin and Atze Schipper Arimaa Is PSPACE-Hard 10.4230/LIPIcs.FUN.2024.27
• Jiří Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, and Zsolt Tuza No Tiling of the 70 × 70 Square with Consecutive Squares 10.4230/LIPIcs.FUN.2024.28
• Rikhav Shah Achieving the Highest Possible Elo Rating 10.4230/LIPIcs.FUN.2024.29
• Kazumasa Shinagawa, Kazuki Kanai, Kengo Miyamoto, and Koji Nuida How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik’s Cube 10.4230/LIPIcs.FUN.2024.30
• Howe Choong Yin and Alex Churchill A Programming Language Embedded in Magic: The Gathering 10.4230/LIPIcs.FUN.2024.31
• Kien Huynh and Valentin Polishchuk Eating Ice-Cream with a Colander 10.4230/LIPIcs.FUN.2024.32
• Kai Li Retrospective: Avoiding the Disk Bottleneck in the Data Domain Deduplication File System 10.4230/LIPIcs.FUN.2024.33
• Victor S. Miller Short Programs for Functions on Curves: A STOC Rejection 10.4230/LIPIcs.FUN.2024.34