Остановите войну!
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 52 matches
- 2020
- Nils Jansen, Bettina Könighofer, Sebastian Junges, Alex Serban, Roderick Bloem:
Safe Reinforcement Learning Using Probabilistic Shields (Invited Paper). CONCUR 2020: 3:1-3:16 - Florian Horn, Arnaud Sangnier:
Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks. CONCUR 2020: 46:1-46:16 - Xinxin Liu, Tingting Yu:
Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. CONCUR 2020: 35:1-35:17 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Vrunda Dave, Shankara Narayanan Krishna:
On the Separability Problem of String Constraints. CONCUR 2020: 16:1-16:19 - Luca Aceto, Jos C. M. Baeten, Patricia Bouyer-Decitre, Holger Hermanns, Alexandra Silva:
CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper). CONCUR 2020: 5:1-5:3 - Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen:
On the Axiomatisability of Parallel Composition: A Journey in the Spectrum. CONCUR 2020: 18:1-18:22 - Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. CONCUR 2020: 19:1-19:17 - Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke:
Parametrized Universality Problems for One-Counter Nets. CONCUR 2020: 47:1-47:16 - Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell:
Coverability in 1-VASS with Disequality Tests. CONCUR 2020: 38:1-38:20 - Mário S. Alvim, Natasha Fernandes, Annabelle McIver, Gabriel Henrique Nunes:
On Privacy and Accuracy in Data Releases (Invited Paper). CONCUR 2020: 1:1-1:18 - Clément Aubert, Ioana Cristescu:
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation. CONCUR 2020: 7:1-7:23 - Guy Avni, Thomas A. Henzinger:
A Survey of Bidding Games on Graphs (Invited Paper). CONCUR 2020: 2:1-2:21 - A. R. Balasubramanian, Igor Walukiewicz:
Characterizing Consensus in the Heard-Of Model. CONCUR 2020: 9:1-9:18 - Paolo Baldan, Barbara König, Tommaso Padoan:
Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations. CONCUR 2020: 25:1-25:20 - Paul C. Bell, Pavel Semukhin:
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. CONCUR 2020: 22:1-22:16 - Benedikt Bollig, Alain Finkel, Amrita Suresh:
Bounded Reachability Problems Are Decidable in FIFO Machines. CONCUR 2020: 49:1-49:17 - Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Games Where You Can Play Optimally with Arena-Independent Finite Memory. CONCUR 2020: 24:1-24:22 - Damien Busatto-Gaston, Debraj Chakraborty, Jean-François Raskin:
Monte Carlo Tree Search Guided by Symbolic Advice for MDPs. CONCUR 2020: 40:1-40:24 - Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States. CONCUR 2020: 23:1-23:22 - Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem for Labelled Markov Chains and Weighted Automata. CONCUR 2020: 41:1-41:19 - Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Determinisability of One-Clock Timed Automata. CONCUR 2020: 42:1-42:17 - Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
Reachability in Fixed Dimension Vector Addition Systems with States. CONCUR 2020: 48:1-48:21 - Wojciech Czerwinski, Diego Figueira, Piotr Hofman:
Universality Problem for Unambiguous VASS. CONCUR 2020: 36:1-36:15 - Emanuele D'Osualdo, Felix Stutz:
Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions. CONCUR 2020: 31:1-31:23 - Ankush Das, Frank Pfenning:
Session Types with Arithmetic Refinements. CONCUR 2020: 13:1-13:18 - Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote:
Synthesis of Computable Regular Functions of Infinite Words. CONCUR 2020: 43:1-43:17 - Amina Doumane, Damien Pous:
Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms. CONCUR 2020: 29:1-29:16 - Javier Esparza, Fabian Reiter:
A Classification of Weak Asynchronous Models of Distributed Computing. CONCUR 2020: 10:1-10:16 - Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan, Ashutosh Trivedi:
Weighted Transducers for Robustness Verification. CONCUR 2020: 17:1-17:21 - Rob van Glabbeek:
Reactive Bisimulation Semantics for a Process Algebra with Time-Outs. CONCUR 2020: 6:1-6:23
skipping 22 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 14: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