Остановите войну!
for scientists:
default search action
Search 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 27 matches
- 2016
- Ahmed Abdelkader, Aditya Acharya, Philip Dasler:
2048 Without New Tiles Is Still Hard. FUN 2016: 1:1-1:14 - Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Trainyard is NP-hard. FUN 2016: 2:1-2:14 - Davide Bacciu, Vincenzo Gervasi, Giuseppe Prencipe:
LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?. FUN 2016: 3:1-3:15 - Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno:
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. FUN 2016: 4:1-4:17 - Jérémy Barbay:
Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time. FUN 2016: 5:1-5:20 - Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann, Simon Poschenrieder, Thomas Stüber:
Algorithms and Insights for RaceTrack. FUN 2016: 6:1-6:14 - Michael A. Bender, Samuel McCauley, Bertrand Simon, Shikha Singh, Frédéric Vivien:
Resource Optimization for Program Committee Members: A Subreview Article. FUN 2016: 7:1-7:20 - Marzio De Biasi, Tim Ophelders:
The Complexity of Snake. FUN 2016: 11:1-11:13 - Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen. FUN 2016: 8:1-8:20 - Francesco Cambi, Pierluigi Crescenzi, Linda Pagli:
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering. FUN 2016: 9:1-9:14 - Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stéphane Pérennes:
Spy-Game on Graphs. FUN 2016: 10:1-10:16 - Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson:
The Fewest Clues Problem. FUN 2016: 12:1-12:12 - Erik D. Demaine, Giovanni Viglietta, Aaron Williams:
Super Mario Bros. is Harder/Easier Than We Thought. FUN 2016: 13:1-13:14 - Jessica A. Enright, John D. Faben:
Building a Better Mouse Maze. FUN 2016: 15:1-15:12 - William S. Evans, Mereke van Garderen, Maarten Löffler, Valentin Polishchuk:
Recognizing a DOG is Hard, But Not When It is Thin and Unit. FUN 2016: 16:1-16:12 - Rudolf Fleischer:
Counting Circles Without Computing Them. FUN 2016: 17:1-17:7 - Luciano Gualà, Stefano Leucci, Emanuele Natale, Roberto Tauraso:
Large Peg-Army Maneuvers. FUN 2016: 18:1-18:15 - Felix Herter, Günter Rote:
Loopless Gray Code Enumeration and the Tower of Bucharest. FUN 2016: 19:1-19:19 - Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya:
Convex Configurations on Nana-kin-san Puzzle. FUN 2016: 20:1-20:14 - Hiro Ito, Takahiro Ueda:
How to Solve the Cake-Cutting Problem in Sublinear Time. FUN 2016: 21:1-21:15 - Stefan Langerman, Yushi Uno:
Threes!, Fives, 1024!, and 2048 are Hard. FUN 2016: 22:1-22:14 - Fabrizio Luccio:
An Arithmetic for Rooted Trees. FUN 2016: 23:1-23:14 - Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
A Rupestrian Algorithm. FUN 2016: 14:1-14:20 - Neeldhara Misra:
Two Dots is NP-complete. FUN 2016: 24:1-24:12 - Stefan Neumann, Andreas Wiese:
This House Proves That Debating is Harder Than Soccer. FUN 2016: 25:1-25:14 - Front Matter, Table of Contents, Preface, Conference Organization. FUN 2016: 0:i-0:xvi
- Erik D. Demaine, Fabrizio Grandoni:
8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy. LIPIcs 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-005-7 [contents]
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-04-24 22:34 CEST 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