Остановите войну!
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 40 matches
- 2023
- Liron Cohen, Vincent Rahli:
Realizing Continuity Using Stateful Computations. CSL 2023: 15:1-15:18 - Bart Jacobs, Dario Stein:
Counting and Matching. CSL 2023: 28:1-28:15 - Dale Miller, Jui-Hsuan Wu:
A Positive Perspective on Term Representation (Invited Talk). CSL 2023: 3:1-3:21 - Ahmet Kara, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Evaluation Trade-Offs for Acyclic Conjunctive Queries. CSL 2023: 29:1-29:20 - Paul W. Wilson, Dan R. Ghica, Fabio Zanasi:
String Diagrams for Non-Strict Monoidal Categories. CSL 2023: 37:1-37:19 - Yannick Forster, Felix Jahn:
Constructive and Synthetic Reducibility Degrees: Post's Problem for Many-One and Truth-Table Reducibility in Coq. CSL 2023: 21:1-21:21 - Bahareh Afshari, Graham E. Leigh, Guillermo Menéndez Turata:
A Cyclic Proof System for Full Computation Tree Logic. CSL 2023: 5:1-5:19 - Mario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi:
Functorial String Diagrams for Reverse-Mode Automatic Differentiation. CSL 2023: 6:1-6:20 - Paolo Baldan, Richard Eggert, Barbara König, Tommaso Padoan:
A Lattice-Theoretical View of Strategy Iteration. CSL 2023: 7:1-7:19 - Pablo Barenbaum, Eduardo Bonelli:
Reductions in Higher-Order Rewriting and Their Equivalence. CSL 2023: 8:1-8:18 - Pablo Barenbaum, Teodoro Freund:
Proofs and Refutations for Intuitionistic and Second-Order Logic. CSL 2023: 9:1-9:18 - Chris Barrett, Willem Heijltjes, Guy McCusker:
The Functional Machine Calculus II: Semantics. CSL 2023: 10:1-10:18 - Nikolay Bazhenov, Dariusz Kalocinski:
Degree Spectra, and Relative Acceptability of Notations. CSL 2023: 11:1-11:20 - Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing:
Hennessy-Milner Theorems via Galois Connections. CSL 2023: 12:1-12:18 - Kostia Chardonnet, Alexis Saurin, Benoît Valiron:
A Curry-Howard Correspondence for Linear, Reversible Computation. CSL 2023: 13:1-13:18 - Corina Cîrstea, Clemens Kupke:
Measure-Theoretic Semantics for Quantitative Parity Automata. CSL 2023: 14:1-14:20 - Gianluca Curzi, Anupam Das:
Non-Uniform Complexity via Non-Wellfounded Proofs. CSL 2023: 16:1-16:18 - Claudia Faggian:
Asymptotic Rewriting (Invited Talk). CSL 2023: 1:1-1:2 - Thiago Felicissimo, Frédéric Blanqui, Ashish Kumar Barnawal:
Translating Proofs from an Impredicative Type System to a Predicative One. CSL 2023: 19:1-19:19 - Dana Fisman, Joshua Grogin, Gera Weiss:
A Normalized Edit Distance on Infinite Words. CSL 2023: 20:1-20:20 - Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Quantitative Hennessy-Milner Theorems via Notions of Density. CSL 2023: 22:1-22:20 - Nina Gierasimczuk:
Inductive Inference and Epistemic Modal Logic (Invited Talk). CSL 2023: 2:1-2:16 - Julien Grange:
Order-Invariance in the Two-Variable Fragment of First-Order Logic. CSL 2023: 23:1-23:19 - Emile Hazard, Denis Kuperberg:
Explorable Automata. CSL 2023: 24:1-24:18 - Lauri Hella:
The Expressive Power of CSP-Quantifiers. CSL 2023: 25:1-25:19 - Reijo Jaakkola:
Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability. CSL 2023: 26:1-26:18 - Reijo Jaakkola, Antti Kuusisto:
Complexity Classifications via Algebraic Logic. CSL 2023: 27:1-27:18 - Dominik Kirst, Benjamin Peters:
Gödel's Theorem Without Tears - Essential Incompleteness in Synthetic Computability. CSL 2023: 30:1-30:18 - Cédric de Lacroix, Luigi Santocanale:
Frobenius Structures in Star-Autonomous Categories. CSL 2023: 18:1-18:20 - Ugo Dal Lago, Francesco Gavazzo, Alexis Ghyselen:
Open Higher-Order Logic. CSL 2023: 17:1-17:17
skipping 10 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-09-06 17:25 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