default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 36 matches
- 2024
- Kai Li:
Retrospective: Avoiding the Disk Bottleneck in the Data Domain Deduplication File System. FUN 2024: 33:1-33:4 - Zachary Abel, Della H. Hendrickson:
Baba Is Universal. FUN 2024: 1:1-1:15 - Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Poset Positional Games. FUN 2024: 2:1-2:12 - Philip Bille
, Martín Farach-Colton, Inge Li Gørtz, Ivor van der Hoog:
Snake in Optimal Space and Time. FUN 2024: 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. FUN 2024: 4:1-4:19 - Davide Bilò, Maurizio Fiusco, Luciano Gualà, Stefano Leucci:
Swapping Mixed-Up Beers to Keep Them Cool. FUN 2024: 5:1-5:18 - Gerth Stølting Brodal:
Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin. FUN 2024: 6:1-6:15 - Xavier Bultel:
Physical Ring Signature. FUN 2024: 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. FUN 2024: 8:1-8:14 - Basile Couëtoux, Bastien Gastaldi, Guyslain Naves:
The Steady-States of Splitter Networks. FUN 2024: 9:1-9:14 - Antoine Dailly, Pascal Lafourcade, Gaël Marcadet:
How Did They Design This Game? Swish: Complexity and Unplayable Positions. FUN 2024: 10:1-10:19 - Marnix Deurloo, Mitchell Donkers, Mieke Maarse, Benjamin G. Rin, Karen Schutte:
Hamiltonian Paths and Cycles in NP-Complete Puzzles. FUN 2024: 11:1-11:25 - Reo Eriguchi, Kazumasa Shinagawa, Takao Murakami:
Card-Based Cryptography Meets Differential Privacy. FUN 2024: 12:1-12:20 - Simone Faro, Francesco Pio Marino, Antonino Andrea Moschetto, Arianna Pavone, Antonio Scardace:
The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples. FUN 2024: 13:1-13:17 - Thomas Garrison, Marijn J. H. Heule, Bernardo Subercaseaux:
PackIt!: Gamified Rectangle Packing. FUN 2024: 14:1-14:19 - Leszek Gasieniec, Benjamin Smith, Sebastian Wild:
Polyamorous Scheduling. FUN 2024: 15:1-15:18 - Matthias Gehnen, Luca Venier:
Tetris Is Not Competitive. FUN 2024: 16:1-16:16 - MIT Hardness Group, Hayashi Ani, Erik D. Demaine, Holden Hall, Matias Korman:
PSPACE-Hard 2D Super Mario Games: Thirteen Doors. FUN 2024: 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. FUN 2024: 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. FUN 2024: 23:1-23:20 - MIT Hardness Group, Erik D. Demaine, Holden Hall, Jeffery Li:
Tetris with Few Piece Types. FUN 2024: 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. FUN 2024: 25:1-25:20 - Kien C. Huynh, Valentin Polishchuk:
Eating Ice-Cream with a Colander. FUN 2024: 32:1-32:4 - Yuki Iburi, Ryuhei Uehara:
Computational Complexity of Matching Match Puzzle. FUN 2024: 17:1-17:10 - Christian Ikenmeyer, Dylan Khangure:
Advanced Spikes 'n' Stuff: An NP-Hard Puzzle Game in Which All Tutorials Are Efficiently Solvable. FUN 2024: 18:1-18:13 - Jaehyun Koo:
Anarchy in the APSP: Algorithm and Hardness for Incorrect Implementation of Floyd-Warshall. FUN 2024: 19:1-19:11 - Fabrizio Luccio, Linda Pagli, Nicola Santoro:
Variations on the Tournament Problem. FUN 2024: 20:1-20:11 - Victor S. Miller:
Short Programs for Functions on Curves: A STOC Rejection. FUN 2024: 34:1-34:4 - Alessandro Panconesi, Pietro Maria Posta, Mirko Giacchini:
Coordinating "7 Billion Humans" Is Hard. FUN 2024: 26:1-26:16 - Benjamin G. Rin, Atze Schipper:
Arimaa Is PSPACE-Hard. FUN 2024: 27:1-27:24
skipping 6 more matches
loading more results 
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-14 06:52 CET from data curated 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:
