Остановите войну!
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 15 matches
- 2020
- Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove:
Decisiveness of Stochastic Systems and its Application to Hybrid Models. GandALF 2020: 149-165 - Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder:
Synthesis in Presence of Dynamic Links. GandALF 2020: 33-49 - Yong Li, Moshe Y. Vardi, Lijun Zhang:
On the Power of Unambiguity in Büchi Complementation. GandALF 2020: 182-198 - Lucas M. Tabajara, Moshe Y. Vardi:
LTLf Synthesis under Partial Observability: From Theory to Practice. GandALF 2020: 1-17 - Oebele Lijzenga, Tom van Dijk:
Symbolic Parity Game Solvers that Yield Winning Strategies. GandALF 2020: 18-32 - Mara Downing, Abtin Molavi, Lucas Bang:
Symbolic Execution + Model Counting + Entropy Maximization = Automatic Search Synthesis. GandALF 2020: 50-65 - Can Baskent:
A Game Theoretical Semantics for Logics of Nonsense. GandALF 2020: 66-81 - Lauri Hella, Antti Kuusisto, Raine Rönnholm:
Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants. GandALF 2020: 82-96 - Florian Bruse, Jörg Kreiker, Martin Lange, Marco Sälzer:
Local Higher-Order Fixpoint Iteration. GandALF 2020: 97-113 - Jan Kretínský, Emanuel Ramneantu, Alexander Slivinskiy, Maximilian Weininger:
Comparison of Algorithms for Simple Stochastic Games. GandALF 2020: 131-148 - Andrew M. Wells, Morteza Lahijanian, Lydia E. Kavraki, Moshe Y. Vardi:
LTLf Synthesis on Probabilistic Systems. GandALF 2020: 166-181 - Bader Abu Radi, Orna Kupferman:
Canonicity in GFG and Transition-Based Automata. GandALF 2020: 199-215 - Íñigo X. Íncer Romeo, Leonardo Mangeruca, Tiziano Villa, Alberto L. Sangiovanni-Vincentelli:
The Quotient in Preorder Theories. GandALF 2020: 216-233 - Aniello Murano, Sasha Rubin, Martin Zimmermann:
Optimal Strategies in Weighted Limit Games. GandALF 2020: 114-130 - Jean-François Raskin, Davide Bresolin:
Proceedings 11th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2020, Brussels, Belgium, September 21-22, 2020. EPTCS 326, 2020 [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-06-11 18:18 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