FUN - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 255

2024

Retrospective: Avoiding the Disk Bottleneck in the Data Domain Deduplication File SystemKai Li 0001. fun 2024: [doi]

Front Matter, Table of Contents, Preface, Conference Organizationfun 2024: [doi]

Baba Is UniversalZachary Abel, Della H. Hendrickson. fun 2024: [doi]

Poset Positional GamesGuillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic. fun 2024: [doi]

Snake in Optimal Space and TimePhilip Bille, Martín Farach-Colton, Inge Li Gørtz, Ivor van der Hoog. fun 2024: [doi]

Uniform-Budget Solo Chess with Only Rooks or Only Knights Is HardDavide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci 0001. fun 2024: [doi]

Swapping Mixed-Up Beers to Keep Them CoolDavide Bilò, Maurizio Fiusco, Luciano Gualà, Stefano Leucci 0001. fun 2024: [doi]

Bottom-Up Rebalancing Binary Search Trees by Flipping a CoinGerth Stølting Brodal. fun 2024: [doi]

12th International Conference on Fun with Algorithms, FUN 2024, June 4-8, 2024, Island of La Maddalena, Sardinia, ItalyAndrei Z. Broder, Tami Tamir, editors, Volume 291 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]

Physical Ring SignatureXavier Bultel. fun 2024: [doi]

A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are LosersKyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng. fun 2024: [doi]

The Steady-States of Splitter NetworksBasile Couëtoux, Bastien Gastaldi, Guyslain Naves. fun 2024: [doi]

How Did They Design This Game? Swish: Complexity and Unplayable PositionsAntoine Dailly, Pascal Lafourcade 0001, Gaël Marcadet. fun 2024: [doi]

Hamiltonian Paths and Cycles in NP-Complete PuzzlesMarnix Deurloo, Mitchell Donkers, Mieke Maarse, Benjamin G. Rin, Karen Schutte. fun 2024: [doi]

Card-Based Cryptography Meets Differential PrivacyReo Eriguchi, Kazumasa Shinagawa, Takao Murakami. fun 2024: [doi]

The Great Textual Hoax: Boosting Sampled String Matching with Fake SamplesSimone Faro, Francesco Pio Marino, Antonino Andrea Moschetto, Arianna Pavone, Antonio Scardace. fun 2024: [doi]

PackIt!: Gamified Rectangle PackingThomas Garrison, Marijn J. H. Heule, Bernardo Subercaseaux. fun 2024: [doi]

Polyamorous SchedulingLeszek Gasieniec, Benjamin Smith, Sebastian Wild. fun 2024: [doi]

Tetris Is Not CompetitiveMatthias Gehnen, Luca Venier. fun 2024: [doi]

Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper VariantsMIT Hardness Group, Della H. Hendrickson, Andy Tockman. fun 2024: [doi]

You Can't Solve These Super Mario Bros. Levels: Undecidable Mario GamesMIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Ricardo Ruiz, Naveen Venkat. fun 2024: [doi]

Tetris with Few Piece TypesMIT Hardness Group, Erik D. Demaine, Holden Hall, Jeffery Li. fun 2024: [doi]

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop PuzzlesMIT Hardness Group, Josh Brunner, Lily Chung, Erik D. Demaine, Della H. Hendrickson, Andy Tockman. fun 2024: [doi]

PSPACE-Hard 2D Super Mario Games: Thirteen DoorsMIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Matias Korman. fun 2024: [doi]

Eating Ice-Cream with a ColanderKien C. Huynh, Valentin Polishchuk. fun 2024: [doi]

Computational Complexity of Matching Match PuzzleYuki Iburi, Ryuhei Uehara. fun 2024: [doi]

Advanced Spikes 'n' Stuff: An NP-Hard Puzzle Game in Which All Tutorials Are Efficiently SolvableChristian Ikenmeyer, Dylan Khangure. fun 2024: [doi]

Anarchy in the APSP: Algorithm and Hardness for Incorrect Implementation of Floyd-WarshallJaehyun Koo. fun 2024: [doi]

Variations on the Tournament ProblemFabrizio Luccio, Linda Pagli, Nicola Santoro. fun 2024: [doi]

Short Programs for Functions on Curves: A STOC RejectionVictor S. Miller. fun 2024: [doi]

Coordinating "7 Billion Humans" Is HardAlessandro Panconesi, Pietro Maria Posta, Mirko Giacchini. fun 2024: [doi]

Arimaa Is PSPACE-HardBenjamin G. Rin, Atze Schipper. fun 2024: [doi]

No Tiling of the 70 × 70 Square with Consecutive SquaresJirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza. fun 2024: [doi]

Achieving the Highest Possible Elo RatingRikhav Shah. fun 2024: [doi]

How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik's CubeKazumasa Shinagawa, Kazuki Kanai, Kengo Miyamoto, Koji Nuida. fun 2024: [doi]

A Programming Language Embedded in Magic: The GatheringHowe Choong Yin, Alex Churchill. fun 2024: [doi]

2022

Front Matter, Table of Contents, Preface, Conference Organizationfun 2022: [doi]

Pushing Blocks by Sweeping LinesHugo A. Akitaya, Maarten Löffler, Giovanni Viglietta. fun 2022: [doi]

A Practical Algorithm for Chess UnwinnabilityMiguel Ambrona. fun 2022: [doi]

Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box DudeJoshua Ani, Lily Chung, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch. fun 2022: [doi]

Fun Slot Machines and Transformations of Words Avoiding FactorsMarcella Anselmo, Manuela Flores, Maria Madonia. fun 2022: [doi]

Chess Is Hard Even for a Single PlayerN. R. Aravind, Neeldhara Misra, Harshil Mittal. fun 2022: [doi]

Rolling Polyhedra on TessellationsAkira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams. fun 2022: [doi]

Grabbing Olives on Linear Pizzas and PissaladièresJean-Claude Bermond, Frédéric Havet, Michel Cosnard. fun 2022: [doi]

Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World?Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade 0001, Anissa Lamani. fun 2022: [doi]

Priority Queues with Decreasing KeysGerth Stølting Brodal. fun 2022: [doi]

Zero-Knowledge Proof of Knowledge for Peg SolitaireXavier Bultel. fun 2022: [doi]

Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy TheoremKyle W. Burke, Matthew Ferland, Shang-Hua Teng. fun 2022: [doi]

Quantum-Inspired Combinatorial Games: Algorithms and ComplexityKyle W. Burke, Matthew Ferland, Shang-Hua Teng. fun 2022: [doi]

How Fast Can We Play Tetris Greedily with Rectangular Pieces?Justin Dallant, John Iacono. fun 2022: [doi]

The Synchronization Game on Subclasses of AutomataHenning Fernau, Carolina Haase, Stefan Hoffmann 0001. fun 2022: [doi]

11th International Conference on Fun with Algorithms, FUN 2022, May 30 to June 3, 2022, Island of Favignana, Sicily, ItalyPierre Fraigniaud, Yushi Uno, editors, Volume 226 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Making Life More Confusing for FirefightersSamuel D. Hand, Jessica A. Enright, Kitty Meeks. fun 2022: [doi]

Sorting Balls and Water: Equivalence and Computational ComplexityTakehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka. fun 2022: [doi]

Skiing Is Easy, Gymnastics Is Hard: Complexity of Routine Construction in Olympic SportsJames Koppel, Yun William Yu. fun 2022: [doi]

How Brokers Can Optimally Abuse TradersManuel Lafond. fun 2022: [doi]

Wordle Is NP-HardDaniel Lokshtanov, Bernardo Subercaseaux. fun 2022: [doi]

Mirror Games Against an Open Book PlayerRoey Magen, Moni Naor. fun 2022: [doi]

Fun with FUNFabien Mathieu, Sébastien Tixeuil. fun 2022: [doi]

All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy ExchangesArturo I. Merino, Torsten Mütze, Aaron Williams. fun 2022: [doi]

Playing Guess Who with Your KidsAmi Paz, Liat Peterfreund. fun 2022: [doi]

How to Physically Verify a Rectangle in a Grid: A Physical ZKP for ShikakuSuthee Ruangwises, Toshiya Itoh. fun 2022: [doi]

2021

Foundations for Actively Secure Card-Based CryptographyAlexander Koch 0001, Stefan Walzer. fun 2020: [doi]

Front Matter, Table of Contents, Preface, Conference Organizationfun 2020: [doi]

Tatamibari Is NP-CompleteAviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch. fun 2020: [doi]

Collaborative ProcrastinationAris Anagnostopoulos, Aristides Gionis, Nikos Parotsidis. fun 2020: [doi]

Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door GadgetsJoshua Ani, Jeffrey Bosboom, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch. fun 2020: [doi]

The Computational Complexity of Evil HangmanJérémy Barbay, Bernardo Subercaseaux. fun 2020: [doi]

Cutting Bamboo down to SizeDavide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti, Giacomo Scornavacca. fun 2020: [doi]

Finding Water on Poleless Using Melomaniac Myopic Chameleon RobotsQuentin Bramas, Pascal Lafourcade 0001, Stéphane Devismes. fun 2020: [doi]

Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-HardThomas Brocken, G. Wessel van der Heijden, Irina Kostitsyna, Lloyd E. Lo-Wong, Remco J. A. Surtel. fun 2020: [doi]

An Optimal Algorithm for Online Freeze-TagJosh Brunner, Julian Wellman. fun 2020: [doi]

1 X 1 Rush Hour with Fixed Blocks Is PSPACE-CompleteJosh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff. fun 2020: [doi]

Magic: The Gathering Is Turing CompleteAlex Churchill, Stella Biderman, Austin Herrick. fun 2020: [doi]

Computational Fun with Sturdy and Flimsy NumbersTrevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman. fun 2020: [doi]

Speeding up Networks Mining via Neighborhood DiversityGennaro Cordasco, Luisa Gargano, Adele A. Rescigno. fun 2020: [doi]

Efficient Algorithms for BattleshipLoïc Crombez, Guilherme Dias da Fonseca, Yan Gerard. fun 2020: [doi]

A Phase Transition in MinesweeperRoss Dempsey, Charles Guinn. fun 2020: [doi]

On the Treewidth of Hanoi GraphsDavid Eppstein, Daniel Frishberg, William Maxwell. fun 2020: [doi]

An Open Pouring ProblemFabian Frei, Peter Rossmanith, David Wehner. fun 2020: [doi]

Efficient Algorithm for Multiplication of Numbers in Zeckendorf RepresentationTomasz Idziaszek. fun 2020: [doi]

Hyperbolic Minesweeper Is in PEryk Kopczynski. fun 2020: [doi]

Train Tracks with GapsWilliam Kuszmaul. fun 2020: [doi]

Card-Based ZKP Protocols for Takuzu and JuosanDaiki Miyahara, Léo Robert, Pascal Lafourcade 0001, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, Hideaki Sone. fun 2020: [doi]

Physical Zero-Knowledge Proof for NumberlinkSuthee Ruangwises, Toshiya Itoh. fun 2020: [doi]

Taming the Knight's Tour: Minimizing Turns and CrossingsJuan José Besa Vial, Timothy Johnson, Nil Mamano, Martha C. Osegueda. fun 2020: [doi]

Singletons for Simpletons: Revisiting Windowed Backoff with Chernoff BoundsQian M. Zhou, Aiden Calvert, Maxwell Young. fun 2020: [doi]

2020

10th International Conference on Fun with Algorithms, FUN 2021, May 30 to June 1, 2021, Favignana Island, Sicily, ItalyMartin Farach-Colton, Giuseppe Prencipe, Ryuhei Uehara, editors, Volume 157 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

2018

Front Matter, Table of Contents, Preface, Conference Organizationfun 2018: [doi]

A Cryptographer's Conspiracy SantaXavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade 0001. fun 2018: [doi]

A Muffin-Theorem GeneratorGuangqi Cui, John Dickerson, Naveen Durvasula, William Gasarch, Erik Metz, Jacob Prinz, Naveen Raman, Daniel Smolyak, Sung Hyun Yoo. fun 2018: [doi]

Restricted Power - Computational Complexity Results for Strategic Defense GamesRonald de Haan, Petra Wolf. fun 2018: [doi]

Mind the Gap (Invited Paper)Martin Farach-Colton. fun 2018: [doi]

Herugolf and Makaro are NP-completeChuzo Iwamoto, Masato Haruishi, Tatsuaki Ibusuki. fun 2018: [doi]

The Fewest Clues Problem of Picross 3DKei Kimura, Takuya Kamehashi, Toshihiro Fujito. fun 2018: [doi]

Uniform Distribution On PachinkoNaoki Kitamura, Yuya Kawabata, Taisuke Izumi. fun 2018: [doi]

The complexity of speedrunning video gamesManuel Lafond. fun 2018: [doi]

Gender-Aware Facility Location in Multi-Gender WorldValentin Polishchuk, Leonid Sedov. fun 2018: [doi]

Card-Based Zero-Knowledge Proof for SudokuTatsuya Sasaki, Takaaki Mizuki, Hideaki Sone. fun 2018: [doi]

The Complexity of Escaping Labyrinths and Enchanted ForestsFlorian D. Schwahn, Clemens Thielen. fun 2018: [doi]

Links

Filter by Year
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1

FUN (fun)

Viewing Publication 1 - 100 from 255

2024

2022

2021

2020

2018

Links

Filter by YearOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top terms [+]OR AND NOT 1

FUN (fun)

Viewing Publication 1 - 100 from 255

2024

2022

2021

2020

2018

Filter by Year
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1