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 29 matches
- 2021
- Thorsten Altenkirch
, Simon Boulier, Ambrus Kaposi, Christian Sattler, Filippo Sestini:
Constructing a universe for the setoid model. FoSSaCS 2021: 1-21 - Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho, Deivid Vale:
Nominal Equational Problems. FoSSaCS 2021: 22-41 - A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin:
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. FoSSaCS 2021: 42-61 - Paolo Baldan, Richard Eggert, Barbara König, Tommaso Padoan:
Fixpoint Theory - Upside Down. FoSSaCS 2021: 62-81 - Bartosz Bednarczyk, Jakub Michaliszyn:
"Most of" leads to undecidability: Failure of adding frequencies to LTL. FoSSaCS 2021: 82-101 - Filippo Bonchi, Alessio Santamaria:
Combining Semilattices and Semimodules. FoSSaCS 2021: 102-123 - Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Gabriele Puppis:
One-way Resynchronizability of Word Transducers. FoSSaCS 2021: 124-143 - Mario Bravetti, Julien Lange, Gianluigi Zavattaro:
Fair Refinement for Asynchronous Session Types. FoSSaCS 2021: 144-163 - Philipp Czerner, Stefan Jaax:
Running Time Analysis of Broadcast Consensus Protocols. FoSSaCS 2021: 164-183 - Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz:
Leafy automata for higher-order concurrency. FoSSaCS 2021: 184-204 - Claudia Faggian, Giulio Guerrieri:
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic. FoSSaCS 2021: 205-225 - Yoji Fukihara, Shin-ya Katsumata:
Generalized Bounded Linear Logic and its Categorical Semantics. FoSSaCS 2021: 226-246 - Alexander Gheorghiu, Sonia Marin:
Focused Proof-search in the Logic of Bunched Implications. FoSSaCS 2021: 247-267 - Silvio Ghilardi, Alessandro Gianola, Deepak Kapur:
Interpolation and Amalgamation for Arrays with MaxDiff. FoSSaCS 2021: 268-288 - Christian Uldal Graulund, Dmitrij Szamozvancev, Neel Krishnaswami:
Adjoint Reactive GUI Programming. FoSSaCS 2021: 289-309 - Christoph Haase, Jakub Rózycki:
On the Expressiveness of Büchi Arithmetic. FoSSaCS 2021: 310-323 - Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Alexandra Silva:
Learning Pomset Automata. FoSSaCS 2021: 510-530 - Patricia Johann, Enrico Ghiorzi, Daniel Jeffries:
Parametricity for Primitive Nested Types. FoSSaCS 2021: 324-343 - Delia Kesner, Loïc Peyrot, Daniel Ventura:
The Spirit of Node Replication. FoSSaCS 2021: 344-364 - Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. FoSSaCS 2021: 365-384 - Orna Kupferman, Salomon Sickert:
Certifying Inexpressibility. FoSSaCS 2021: 385-405 - Satoshi Kura:
A General Semantic Construction of Dependent Refinement Type Systems, Categorically. FoSSaCS 2021: 406-426 - Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak:
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. FoSSaCS 2021: 427-447 - Robert S. R. Myers, Stefan Milius, Henning Urbat:
Nondeterministic Syntactic Complexity. FoSSaCS 2021: 448-468 - Robin Piedeleu, Fabio Zanasi:
A String Diagrammatic Axiomatisation of Finite-State Automata. FoSSaCS 2021: 469-489 - Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume:
Work-sensitive Dynamic Complexity of Formal Languages. FoSSaCS 2021: 490-509 - Renaud Vilmart:
The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford. FoSSaCS 2021: 531-550 - Paul Wild, Lutz Schröder:
A Quantified Coalgebraic van Benthem Theorem. FoSSaCS 2021: 551-571 - Stefan Kiefer, Christine Tasson:
Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings. Lecture Notes in Computer Science 12650, Springer 2021, ISBN 978-3-030-71994-4 [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-11-25 03:42 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:
