default search action
12th FUN 2024: Island of La Maddalena, Sardinia, Italy
- Andrei Z. Broder, Tami Tamir:
12th International Conference on Fun with Algorithms, FUN 2024, June 4-8, 2024, Island of La Maddalena, Sardinia, Italy. LIPIcs 291, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-314-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xvi
- Zachary Abel, Della H. Hendrickson:
Baba Is Universal. 1:1-1:15 - Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Poset Positional Games. 2:1-2:12 - Philip Bille
, Martín Farach-Colton, Inge Li Gørtz
Snake in Optimal Space and Time. 3:1-3:15 - Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci:
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. 4:1-4:19 - Davide Bilò, Maurizio Fiusco, Luciano Gualà, Stefano Leucci:
Swapping Mixed-Up Beers to Keep Them Cool. 5:1-5:18 - Gerth Stølting Brodal
Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin. 6:1-6:15 - Xavier Bultel:
Physical Ring Signature. 7:1-7:18 - Kyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng:
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers. 8:1-8:14 - Basile Couëtoux, Bastien Gastaldi, Guyslain Naves:
The Steady-States of Splitter Networks. 9:1-9:14 - Antoine Dailly, Pascal Lafourcade, Gaël Marcadet:
How Did They Design This Game? Swish: Complexity and Unplayable Positions. 10:1-10:19 - Marnix Deurloo, Mitchell Donkers, Mieke Maarse, Benjamin G. Rin, Karen Schutte:
Hamiltonian Paths and Cycles in NP-Complete Puzzles. 11:1-11:25 - Reo Eriguchi, Kazumasa Shinagawa, Takao Murakami:
Card-Based Cryptography Meets Differential Privacy. 12:1-12:20 - Simone Faro, Francesco Pio Marino, Antonino Andrea Moschetto, Arianna Pavone
The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples. 13:1-13:17 - Thomas Garrison, Marijn J. H. Heule, Bernardo Subercaseaux:
PackIt!: Gamified Rectangle Packing. 14:1-14:19 - Leszek Gasieniec, Benjamin Smith, Sebastian Wild:
Polyamorous Scheduling. 15:1-15:18 - Matthias Gehnen, Luca Venier:
Tetris Is Not Competitive. 16:1-16:16 - Yuki Iburi, Ryuhei Uehara:
Computational Complexity of Matching Match Puzzle. 17:1-17:10 - Christian Ikenmeyer, Dylan Khangure:
Advanced Spikes 'n' Stuff: An NP-Hard Puzzle Game in Which All Tutorials Are Efficiently Solvable. 18:1-18:13 - Jaehyun Koo:
Anarchy in the APSP: Algorithm and Hardness for Incorrect Implementation of Floyd-Warshall. 19:1-19:11 - Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Variations on the Tournament Problem. 20:1-20:11 - MIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Matias Korman:
PSPACE-Hard 2D Super Mario Games: Thirteen Doors. 21:1-21:19 - MIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Ricardo Ruiz, Naveen Venkat:
You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games. 22:1-22:20 - MIT Hardness Group, Josh Brunner, Lily Chung, Erik D. Demaine, Della H. Hendrickson, Andy Tockman:
ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles. 23:1-23:20 - MIT Hardness Group, Erik D. Demaine, Holden Hall, Jeffery Li:
Tetris with Few Piece Types. 24:1-24:18 - MIT Hardness Group, Della H. Hendrickson, Andy Tockman:
Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants. 25:1-25:20 - Alessandro Panconesi, Pietro Maria Posta, Mirko Giacchini:
Coordinating "7 Billion Humans" Is Hard. 26:1-26:16 - Benjamin G. Rin, Atze Schipper:
Arimaa Is PSPACE-Hard. 27:1-27:24 - Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza:
No Tiling of the 70 × 70 Square with Consecutive Squares. 28:1-28:16 - Rikhav Shah:
Achieving the Highest Possible Elo Rating. 29:1-29:21 - Kazumasa Shinagawa, Kazuki Kanai, Kengo Miyamoto, Koji Nuida
How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik's Cube. 30:1-30:15 - Howe Choong Yin, Alex Churchill
A Programming Language Embedded in Magic: The Gathering. 31:1-31:19 - Kien C. Huynh, Valentin Polishchuk:
Eating Ice-Cream with a Colander. 32:1-32:4 - Kai Li:
Retrospective: Avoiding the Disk Bottleneck in the Data Domain Deduplication File System. 33:1-33:4 - Victor S. Miller:
Short Programs for Functions on Curves: A STOC Rejection. 34:1-34:4
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 18:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: