Остановите войну!
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 20 matches
- 2012
- Yang Cai, Ting Zhang:
Can Nondeterminism Help Complementation? GandALF 2012: 57-70 - Marta Capiluppi, Roberto Segala:
Modelling Implicit Communication in Multi-Agent Systems with Hybrid Input/Output Automata. GandALF 2012: 1-14 - Chung-Hao Huang, Doron A. Peled, Sven Schewe, Farn Wang:
Rapid Recovery for Systems with Scarce Faults. GandALF 2012: 15-28 - Pavol Cerný, Martin Chmelik, Thomas A. Henzinger, Arjun Radhakrishna:
Interface Simulation Distances. GandALF 2012: 29-42 - Martin Lange, Étienne Lozes, Manuel Vargas Guzmán:
Model-Checking Process Equivalences. GandALF 2012: 43-56 - Stephan Barth, Martin Hofmann:
Learn with SAT to Minimize Büchi Automata. GandALF 2012: 71-84 - Alessandro Solimando, Giorgio Delzanno, Giovanna Guerrini:
Automata-based Static Analysis of XML Document Adaptation. GandALF 2012: 85-98 - Aleksandar S. Dimovski:
Symbolic Representation of Algorithmic Game Semantics. GandALF 2012: 99-112 - Julian Gutierrez, Felix Klaedtke, Martin Lange:
The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity. GandALF 2012: 113-126 - Ricardo Almeida, Sabine Broda, Nelma Moreira:
Deciding KAT and Hoare Logic with Derivatives. GandALF 2012: 127-140 - Daniel Neider, Roman Rabinovich, Martin Zimmermann:
Down the Borel Hierarchy: Solving Muller Games via Safety Games. GandALF 2012: 169-182 - Wladimir Fridman, Martin Zimmermann:
Playing Pushdown Parity Games in a Hurry. GandALF 2012: 183-196 - Felix Canavoi, Erich Grädel, Roman Rabinovich:
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs. GandALF 2012: 197-209 - Pawel Parys:
Higher-Order Pushdown Systems with Data. GandALF 2012: 210-223 - Domenico Cantone, Cristiano Longo:
A decidable quantified fragment of set theory with ordered pairs and some undecidable extensions. GandALF 2012: 224-237 - Alex Kruckman, Sasha Rubin, John Sheridan, Ben Zax:
A Myhill-Nerode theorem for automata with advice. GandALF 2012: 238-246 - Szczepan Hummel:
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones. GandALF 2012: 247-260 - Davide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala, Guido Sciavicco:
Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture. GandALF 2012: 155-168 - Jakub Michaliszyn, Jan Otop, Piotr Witkowski:
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics. GandALF 2012: 141-154 - Marco Faella, Aniello Murano:
Proceedings Third International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2012, Napoli, Italy, September 6-8, 2012. EPTCS 96, 2012 [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-05-25 16:30 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