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