Остановите войну!
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 34 matches
- 2018
- Markus Holzer, Jan-Tobias Maurer:
Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms. FUN 2018: 23:1-23:21 - Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy:
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. FUN 2018: 3:1-3:21 - Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Tracks from hell - when finding a proof may be easier than checking it. FUN 2018: 4:1-4:13 - Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi:
How Bad is the Freedom to Flood-It?. FUN 2018: 5:1-5:13 - Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric:
How long does it take for all users in a social network to choose their communities?. FUN 2018: 6:1-6:21 - Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra:
On the Complexity of Two Dots for Narrow Boards and Few Colors. FUN 2018: 7:1-7:15 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. FUN 2018: 8:1-8:15 - Hans L. Bodlaender, Tom C. van der Zanden:
On the Exact Complexity of Polyomino Packing. FUN 2018: 9:1-9:10 - Paolo Boldi, Sebastiano Vigna:
Kings, Name Days, Lazy Servants and Magic. FUN 2018: 10:1-10:13 - Jeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy:
Computational Complexity of Generalized Push Fight. FUN 2018: 11:1-11:21 - Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis:
SUPERSET: A (Super)Natural Variant of the Card Game SET. FUN 2018: 12:1-12:17 - Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
A Cryptographer's Conspiracy Santa. FUN 2018: 13:1-13:13 - Michael J. Coulombe, Jayson Lynch:
Cooperating in Video Games? Impossible! Undecidability of Team Multiplayer Games. FUN 2018: 14:1-14:16 - Guangqi Cui, John P. Dickerson, Naveen Durvasula, William Gasarch, Erik Metz, Jacob Prinz, Naveen Raman, Daniel Smolyak, Sung Hyun Yoo:
A Muffin-Theorem Generator. FUN 2018: 15:1-15:19 - Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
God Save the Queen. FUN 2018: 16:1-16:20 - Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy:
Computational Complexity of Motion Planning of a Robot through Simple Gadgets. FUN 2018: 18:1-18:21 - Erik D. Demaine, Joshua Lockhart, Jayson Lynch:
The Computational Complexity of Portal and Other 3D Video Games. FUN 2018: 19:1-19:22 - David Eppstein:
Faster Evaluation of Subtraction Games. FUN 2018: 20:1-20:12 - David Eppstein:
Making Change in 2048. FUN 2018: 21:1-21:13 - Martin Farach-Colton:
Mind the Gap (Invited Paper). FUN 2018: 1:1-1:1 - Ronald de Haan, Petra Wolf:
Restricted Power - Computational Complexity Results for Strategic Defense Games. FUN 2018: 17:1-17:14 - Heiko Hamann, Christine Markarian, Friedhelm Meyer auf der Heide, Mostafa Wahby:
Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. FUN 2018: 22:1-22:13 - Chuzo Iwamoto, Masato Haruishi, Tatsuaki Ibusuki:
Herugolf and Makaro are NP-complete. FUN 2018: 24:1-24:11 - Kei Kimura, Takuya Kamehashi, Toshihiro Fujito:
The Fewest Clues Problem of Picross 3D. FUN 2018: 25:1-25:13 - Naoki Kitamura, Yuya Kawabata, Taisuke Izumi:
Uniform Distribution On Pachinko. FUN 2018: 26:1-26:14 - Manuel Lafond:
The complexity of speedrunning video games. FUN 2018: 27:1-27:19 - Valentin Polishchuk, Leonid Sedov:
Gender-Aware Facility Location in Multi-Gender World. FUN 2018: 28:1-28:16 - Tatsuya Sasaki, Takaaki Mizuki, Hideaki Sone:
Card-Based Zero-Knowledge Proof for Sudoku. FUN 2018: 29:1-29:10 - Florian D. Schwahn, Clemens Thielen:
The Complexity of Escaping Labyrinths and Enchanted Forests. FUN 2018: 30:1-30:13 - Kazumasa Shinagawa, Takaaki Mizuki:
Card-based Protocols Using Triangle Cards. FUN 2018: 31:1-31:13
skipping 4 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-04-25 07:07 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