default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 39 matches
- 2022
- Yoshiki Nakamura
:
Spatial Existential Positive Logics for Hyperedge Replacement Grammars. CSL 2022: 30:1-30:17 - Guillermo A. Pérez, Ritam Raha:
Revisiting Parameter Synthesis for One-Counter Automata. CSL 2022: 33:1-33:18 - Beniamino Accattoli, Maico Leberle:
Useful Open Call-By-Need. CSL 2022: 4:1-4:21 - Martin Baillon, Assia Mahboubi, Pierre-Marie Pédrot:
Gardening with the Pythia A Model of Continuity in a Dependent Setting. CSL 2022: 5:1-5:18 - Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot:
Weighted Automata and Expressions over Pre-Rational Monoids. CSL 2022: 6:1-6:16 - Udi Boker:
Between Deterministic and Nondeterministic Quantitative Automata (Invited Talk). CSL 2022: 1:1-1:15 - Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Optimal Strategies in Concurrent Reachability Games. CSL 2022: 7:1-7:17 - Patricia Bouyer, Stéphane Le Roux, Nathan Thomasset:
Finite-Memory Strategies in Two-Player Infinite Games. CSL 2022: 8:1-8:16 - Matthew de Brecht:
Constructing the Space of Valuations of a Quasi-Polish Space as a Space of Ideals. CSL 2022: 9:1-9:10 - Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
On the Complexity of SPEs in Parity Games. CSL 2022: 10:1-10:17 - Guillaume Brunerie, Axel Ljungström, Anders Mörtberg:
Synthetic Integral Cohomology in Cubical Agda. CSL 2022: 11:1-11:19 - Antonio Casares:
On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions. CSL 2022: 12:1-12:17 - Davide Castelnovo, Marino Miculan:
Fuzzy Algebraic Theories. CSL 2022: 13:1-13:17 - Liang-Ting Chen, Hsiang-Shang Ko:
Realising Intensional S4 and GL Modalities. CSL 2022: 14:1-14:17 - Carmen M. Constantin, Nuiok Dicaire, Chris Heunen:
Localisable Monads. CSL 2022: 15:1-15:17 - Fredrik Dahlqvist, Renato Neves:
An Internal Language for Categories Enriched over Generalised Metric Spaces. CSL 2022: 16:1-16:18 - Anuj Dawar, Abhisekh Sankaran:
MSO Undecidability for Hereditary Classes of Unbounded Clique Width. CSL 2022: 17:1-17:17 - Andrej Dudenhefner:
Constructive Many-One Reduction from the Halting Problem to Semi-Unification. CSL 2022: 18:1-18:19 - Natasha Fernandes, Annabelle McIver, Carroll Morgan:
How to Develop an Intuition for Risk... and Other Invisible Phenomena (Invited Talk). CSL 2022: 2:1-2:14 - David Fernández-Duque, Yoàv Montacute:
Dynamic Cantor Derivative Logic. CSL 2022: 19:1-19:17 - Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch, Ernst-Rüdiger Olderog:
Global Winning Conditions in Synthesis of Distributed Systems with Causal Memory. CSL 2022: 20:1-20:19 - Dana Fisman, Hadar Frenkel, Sandra Zilles:
Inferring Symbolic Automata. CSL 2022: 21:1-21:19 - Jakub Gajarský, Maximilian Gorsky, Stephan Kreutzer:
Differential Games, Locality, and Model Checking for FO Logic of Graphs. CSL 2022: 22:1-22:18 - Emile Hazard, Denis Kuperberg:
Cyclic Proofs for Transfinite Expressions. CSL 2022: 23:1-23:18 - Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian Words. CSL 2022: 24:1-24:23 - Guilhem Jaber, Davide Sangiorgi:
Games, Mobile Processes, and Functions. CSL 2022: 25:1-25:18 - Delia Kesner, Andrés Viso:
Encoding Tight Typing in a Unified Framework. CSL 2022: 27:1-27:20 - András Kovács:
Generalized Universe Hierarchies and First-Class Universe Levels. CSL 2022: 28:1-28:17 - Clemens Kupke, Johannes Marti, Yde Venema:
Succinct Graph Representations of μ-Calculus Formulas. CSL 2022: 29:1-29:18 - Antonio Abu Nassar, Shaull Almagor:
Simulation by Rounds of Letter-To-Letter Transducers. CSL 2022: 3:1-3:17
skipping 9 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-11-08 01:49 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
