@Proceedings{broder_et_al:LIPIcs.FUN.2024,
title = {{LIPIcs, Volume 291, FUN 2024, Complete Volume}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {1--570},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024},
URN = {urn:nbn:de:0030-drops-199079},
doi = {10.4230/LIPIcs.FUN.2024},
annote = {Keywords: LIPIcs, Volume 291, FUN 2024, Complete Volume}
}
@InProceedings{broder_et_al:LIPIcs.FUN.2024.0,
author = {Broder, Andrei Z. and Tamir, Tami},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.0},
URN = {urn:nbn:de:0030-drops-199080},
doi = {10.4230/LIPIcs.FUN.2024.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{abel_et_al:LIPIcs.FUN.2024.1,
author = {Abel, Zachary and Hendrickson, Della},
title = {{Baba Is Universal}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {1:1--1:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.1},
URN = {urn:nbn:de:0030-drops-199093},
doi = {10.4230/LIPIcs.FUN.2024.1},
annote = {Keywords: Undecidability, Baba is You, RE-hardness, counter machines, universal computation}
}
@InProceedings{bagan_et_al:LIPIcs.FUN.2024.2,
author = {Bagan, Guillaume and Duch\^{e}ne, Eric and Galliot, Florian and Gledel, Valentin and Mikala\v{c}ki, Mirjana and Oijid, Nacim and Parreau, Aline and Stojakovi\'{c}, Milo\v{s}},
title = {{Poset Positional Games}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {2:1--2:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.2},
URN = {urn:nbn:de:0030-drops-199100},
doi = {10.4230/LIPIcs.FUN.2024.2},
annote = {Keywords: Positional games, Maker-Breaker games, Game complexity, Poset, Connect 4}
}
@InProceedings{bille_et_al:LIPIcs.FUN.2024.3,
author = {Bille, Philip and Farach-Colton, Mart{\'\i}n and G{\o}rtz, Inge Li and van der Hoog, Ivor},
title = {{Snake in Optimal Space and Time}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.3},
URN = {urn:nbn:de:0030-drops-199118},
doi = {10.4230/LIPIcs.FUN.2024.3},
annote = {Keywords: Data structure, Snake, Nokia, String Algorithms}
}
@InProceedings{bilo_et_al:LIPIcs.FUN.2024.4,
author = {Bil\`{o}, Davide and Di Donato, Luca and Gual\`{a}, Luciano and Leucci, Stefano},
title = {{Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {4:1--4:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.4},
URN = {urn:nbn:de:0030-drops-199121},
doi = {10.4230/LIPIcs.FUN.2024.4},
annote = {Keywords: solo chess, puzzle games, board games, NP-completeness}
}
@InProceedings{bilo_et_al:LIPIcs.FUN.2024.5,
author = {Bil\`{o}, Davide and Fiusco, Maurizio and Gual\`{a}, Luciano and Leucci, Stefano},
title = {{Swapping Mixed-Up Beers to Keep Them Cool}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {5:1--5:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.5},
URN = {urn:nbn:de:0030-drops-199132},
doi = {10.4230/LIPIcs.FUN.2024.5},
annote = {Keywords: Colored Token Swapping, Complete Bipartite Graphs, Labeled Token Swapping, FPT Algorithms, NP-Hardness}
}
@InProceedings{brodal:LIPIcs.FUN.2024.6,
author = {Brodal, Gerth St{\o}lting},
title = {{Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {6:1--6:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.6},
URN = {urn:nbn:de:0030-drops-199143},
doi = {10.4230/LIPIcs.FUN.2024.6},
annote = {Keywords: Binary search tree, insertions, random rebalancing}
}
@InProceedings{bultel:LIPIcs.FUN.2024.7,
author = {Bultel, Xavier},
title = {{Physical Ring Signature}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {7:1--7:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.7},
URN = {urn:nbn:de:0030-drops-199154},
doi = {10.4230/LIPIcs.FUN.2024.7},
annote = {Keywords: Physical Cryptography, Ring Signature, Anonymity}
}
@InProceedings{burke_et_al:LIPIcs.FUN.2024.8,
author = {Burke, Kyle and Ferland, Matthew and Huntemann, Svenja and Teng, Shanghua},
title = {{A Tractability Gap Beyond Nim-Sums: It’s Hard to Tell Whether a Bunch of Superstars Are Losers}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {8:1--8:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.8},
URN = {urn:nbn:de:0030-drops-199168},
doi = {10.4230/LIPIcs.FUN.2024.8},
annote = {Keywords: Combinatorial Game Theory, NP-hardness, Superstars}
}
@InProceedings{couetoux_et_al:LIPIcs.FUN.2024.9,
author = {Cou\"{e}toux, Basile and Gastaldi, Bastien and Naves, Guyslain},
title = {{The Steady-States of Splitter Networks}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.9},
URN = {urn:nbn:de:0030-drops-199174},
doi = {10.4230/LIPIcs.FUN.2024.9},
annote = {Keywords: Factorio, splitter networks, flow, balancer, steady-state}
}
@InProceedings{dailly_et_al:LIPIcs.FUN.2024.10,
author = {Dailly, Antoine and Lafourcade, Pascal and Marcadet, Ga\"{e}l},
title = {{How Did They Design This Game? Swish: Complexity and Unplayable Positions}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {10:1--10:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.10},
URN = {urn:nbn:de:0030-drops-199185},
doi = {10.4230/LIPIcs.FUN.2024.10},
annote = {Keywords: Game, Complexity, Algorithms}
}
@InProceedings{deurloo_et_al:LIPIcs.FUN.2024.11,
author = {Deurloo, Marnix and Donkers, Mitchell and Maarse, Mieke and Rin, Benjamin G. and Schutte, Karen},
title = {{Hamiltonian Paths and Cycles in NP-Complete Puzzles}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {11:1--11:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.11},
URN = {urn:nbn:de:0030-drops-199199},
doi = {10.4230/LIPIcs.FUN.2024.11},
annote = {Keywords: Hamiltonicity, NP-completeness, complexity theory, pen-and-paper puzzles}
}
@InProceedings{eriguchi_et_al:LIPIcs.FUN.2024.12,
author = {Eriguchi, Reo and Shinagawa, Kazumasa and Murakami, Takao},
title = {{Card-Based Cryptography Meets Differential Privacy}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {12:1--12:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.12},
URN = {urn:nbn:de:0030-drops-199206},
doi = {10.4230/LIPIcs.FUN.2024.12},
annote = {Keywords: Card-based cryptography, Differential privacy, Secure computation}
}
@InProceedings{faro_et_al:LIPIcs.FUN.2024.13,
author = {Faro, Simone and Marino, Francesco Pio and Moschetto, Andrea and Pavone, Arianna and Scardace, Antonio},
title = {{The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.13},
URN = {urn:nbn:de:0030-drops-199211},
doi = {10.4230/LIPIcs.FUN.2024.13},
annote = {Keywords: string matching, sampling}
}
@InProceedings{garrison_et_al:LIPIcs.FUN.2024.14,
author = {Garrison, Thomas and Heule, Marijn J. H. and Subercaseaux, Bernardo},
title = {{PackIt!: Gamified Rectangle Packing}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {14:1--14:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.14},
URN = {urn:nbn:de:0030-drops-199226},
doi = {10.4230/LIPIcs.FUN.2024.14},
annote = {Keywords: PackIt!, rectangle packing, SAT, NP-hardness}
}
@InProceedings{gasieniec_et_al:LIPIcs.FUN.2024.15,
author = {G\k{a}sieniec, Leszek and Smith, Benjamin and Wild, Sebastian},
title = {{Polyamorous Scheduling}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {15:1--15:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.15},
URN = {urn:nbn:de:0030-drops-199234},
doi = {10.4230/LIPIcs.FUN.2024.15},
annote = {Keywords: Periodic scheduling, Pinwheel scheduling, Edge-coloring, Chromatic index, Approximation algorithms, Hardness of approximation}
}
@InProceedings{gehnen_et_al:LIPIcs.FUN.2024.16,
author = {Gehnen, Matthias and Venier, Luca},
title = {{Tetris Is Not Competitive}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {16:1--16:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.16},
URN = {urn:nbn:de:0030-drops-199242},
doi = {10.4230/LIPIcs.FUN.2024.16},
annote = {Keywords: Online Algorithms, Tetris}
}
@InProceedings{iburi_et_al:LIPIcs.FUN.2024.17,
author = {Iburi, Yuki and Uehara, Ryuhei},
title = {{Computational Complexity of Matching Match Puzzle}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {17:1--17:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.17},
URN = {urn:nbn:de:0030-drops-199251},
doi = {10.4230/LIPIcs.FUN.2024.17},
annote = {Keywords: Graph coloring, Matching Match puzzle, NP-complete, polynomial-time solvable}
}
@InProceedings{ikenmeyer_et_al:LIPIcs.FUN.2024.18,
author = {Ikenmeyer, Christian and Khangure, Dylan},
title = {{Advanced Spikes `n' Stuff: An NP-Hard Puzzle Game in Which All Tutorials Are Efficiently Solvable}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {18:1--18:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.18},
URN = {urn:nbn:de:0030-drops-199265},
doi = {10.4230/LIPIcs.FUN.2024.18},
annote = {Keywords: computational complexity, P vs NP, motion planning, games}
}
@InProceedings{koo:LIPIcs.FUN.2024.19,
author = {Koo, Jaehyun},
title = {{Anarchy in the APSP: Algorithm and Hardness for Incorrect Implementation of Floyd-Warshall}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {19:1--19:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.19},
URN = {urn:nbn:de:0030-drops-199270},
doi = {10.4230/LIPIcs.FUN.2024.19},
annote = {Keywords: fine-grained complexity, recreational algorithms}
}
@InProceedings{luccio_et_al:LIPIcs.FUN.2024.20,
author = {Luccio, Fabrizio and Pagli, Linda and Santoro, Nicola},
title = {{Variations on the Tournament Problem}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {20:1--20:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.20},
URN = {urn:nbn:de:0030-drops-199280},
doi = {10.4230/LIPIcs.FUN.2024.20},
annote = {Keywords: algorithms, parallel algorithms, tournament, selection, ranking}
}
@InProceedings{mithardnessgroup_et_al:LIPIcs.FUN.2024.21,
author = {MIT Hardness Group and Ani, Hayashi and Demaine, Erik D. and Hall, Holden and Korman, Matias},
title = {{PSPACE-Hard 2D Super Mario Games: Thirteen Doors}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {21:1--21:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.21},
URN = {urn:nbn:de:0030-drops-199295},
doi = {10.4230/LIPIcs.FUN.2024.21},
annote = {Keywords: video games, computational complexity, PSPACE}
}
@InProceedings{mithardnessgroup_et_al:LIPIcs.FUN.2024.22,
author = {MIT Hardness Group and Ani, Hayashi and Demaine, Erik D. and Hall, Holden and Ruiz, Ricardo and Venkat, Naveen},
title = {{You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {22:1--22:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.22},
URN = {urn:nbn:de:0030-drops-199302},
doi = {10.4230/LIPIcs.FUN.2024.22},
annote = {Keywords: video games, computational complexity, undecidability}
}
@InProceedings{mithardnessgroup_et_al:LIPIcs.FUN.2024.23,
author = {MIT Hardness Group and Brunner, Josh and Chung, Lily and Demaine, Erik D. and Hendrickson, Della and Tockman, Andy},
title = {{ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {23:1--23:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.23},
URN = {urn:nbn:de:0030-drops-199314},
doi = {10.4230/LIPIcs.FUN.2024.23},
annote = {Keywords: pencil-and-paper puzzles, computational complexity, parsimony}
}
@InProceedings{mithardnessgroup_et_al:LIPIcs.FUN.2024.24,
author = {MIT Hardness Group and Demaine, Erik D. and Hall, Holden and Li, Jeffery},
title = {{Tetris with Few Piece Types}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {24:1--24:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.24},
URN = {urn:nbn:de:0030-drops-199322},
doi = {10.4230/LIPIcs.FUN.2024.24},
annote = {Keywords: complexity, hardness, video games, counting}
}
@InProceedings{mithardnessgroup_et_al:LIPIcs.FUN.2024.25,
author = {MIT Hardness Group and Hendrickson, Della and Tockman, Andy},
title = {{Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {25:1--25:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.25},
URN = {urn:nbn:de:0030-drops-199335},
doi = {10.4230/LIPIcs.FUN.2024.25},
annote = {Keywords: NP, coNP, hardness, minesweeper, solvability, gadgets, simulation}
}
@InProceedings{panconesi_et_al:LIPIcs.FUN.2024.26,
author = {Panconesi, Alessandro and Posta, Pietro Maria and Giacchini, Mirko},
title = {{Coordinating "7 Billion Humans" Is Hard}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {26:1--26:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.26},
URN = {urn:nbn:de:0030-drops-199342},
doi = {10.4230/LIPIcs.FUN.2024.26},
annote = {Keywords: video games, computational complexity, NP, PSPACE}
}
@InProceedings{rin_et_al:LIPIcs.FUN.2024.27,
author = {Rin, Benjamin G. and Schipper, Atze},
title = {{Arimaa Is PSPACE-Hard}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {27:1--27:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.27},
URN = {urn:nbn:de:0030-drops-199359},
doi = {10.4230/LIPIcs.FUN.2024.27},
annote = {Keywords: Arimaa, complexity theory, PSPACE-hardness, board games, Generalized Geography}
}
@InProceedings{sgall_et_al:LIPIcs.FUN.2024.28,
author = {Sgall, Ji\v{r}{\'\i} and Balogh, J\'{a}nos and B\'{e}k\'{e}si, J\'{o}zsef and D\'{o}sa, Gy\"{o}rgy and Hvattum, Lars Magnus and Tuza, Zsolt},
title = {{No Tiling of the 70 × 70 Square with Consecutive Squares}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {28:1--28:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.28},
URN = {urn:nbn:de:0030-drops-199362},
doi = {10.4230/LIPIcs.FUN.2024.28},
annote = {Keywords: square packing, Gardner’s problem, combinatorial proof}
}
@InProceedings{shah:LIPIcs.FUN.2024.29,
author = {Shah, Rikhav},
title = {{Achieving the Highest Possible Elo Rating}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {29:1--29:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.29},
URN = {urn:nbn:de:0030-drops-199376},
doi = {10.4230/LIPIcs.FUN.2024.29},
annote = {Keywords: Elo, rating system, monotonic invariant, Euler’s method, mass movement}
}
@InProceedings{shinagawa_et_al:LIPIcs.FUN.2024.30,
author = {Shinagawa, Kazumasa and Kanai, Kazuki and Miyamoto, Kengo and Nuida, Koji},
title = {{How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik’s Cube}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {30:1--30:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.30},
URN = {urn:nbn:de:0030-drops-199385},
doi = {10.4230/LIPIcs.FUN.2024.30},
annote = {Keywords: Card-based cryptography, Uniform cyclic group factorization, Secure random instance generation, The 15 Puzzle, Rubik’s Cube}
}
@InProceedings{yin_et_al:LIPIcs.FUN.2024.31,
author = {Yin, Howe Choong and Churchill, Alex},
title = {{A Programming Language Embedded in Magic: The Gathering}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {31:1--31:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.31},
URN = {urn:nbn:de:0030-drops-199391},
doi = {10.4230/LIPIcs.FUN.2024.31},
annote = {Keywords: Programming, computability theory, Magic: the Gathering, two-player games, tabletop games}
}
@InProceedings{huynh_et_al:LIPIcs.FUN.2024.32,
author = {Huynh, Kien and Polishchuk, Valentin},
title = {{Eating Ice-Cream with a Colander}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {32:1--32:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.32},
URN = {urn:nbn:de:0030-drops-199408},
doi = {10.4230/LIPIcs.FUN.2024.32},
annote = {Keywords: computational geometry, alpha-shape, k-hull, robust shape reconstruction}
}
@InProceedings{li:LIPIcs.FUN.2024.33,
author = {Li, Kai},
title = {{Retrospective: Avoiding the Disk Bottleneck in the Data Domain Deduplication File System}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {33:1--33:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.33},
URN = {urn:nbn:de:0030-drops-199417},
doi = {10.4230/LIPIcs.FUN.2024.33},
annote = {Keywords: Deduplication, file systems, compression}
}
@InProceedings{miller:LIPIcs.FUN.2024.34,
author = {Miller, Victor S.},
title = {{Short Programs for Functions on Curves: A STOC Rejection}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {34:1--34:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.34},
URN = {urn:nbn:de:0030-drops-199427},
doi = {10.4230/LIPIcs.FUN.2024.34},
annote = {Keywords: Elliptic Curves, Finite Fields, Weil Pairing, Straight Line Program}
}
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