Остановите войну!
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 797 matches
- 2024
- Beniamino Accattoli, Adrienne Lancelot:
Light Genericity. FoSSaCS (2) 2024: 24-46 - Shaull Almagor, Guy Avni, Henry Sinclair-Banks, Asaf Yeshurun:
Dimension-Minimality and Primality of Counter Nets. FoSSaCS (2) 2024: 229-249 - Shaull Almagor, Neta Dafni:
Determinization of Integral Discounted-Sum Automata is Decidable. FoSSaCS (1) 2024: 191-211 - Pete Austin, Sougata Bose, Patrick Totzke:
Parity Games on Temporal Graphs. FoSSaCS (1) 2024: 79-98 - Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale:
On Basic Feasible Functionals and the Interpretation Method. FoSSaCS (2) 2024: 70-91 - Fabian Birkmann, Henning Urbat, Stefan Milius:
Monoidal Extended Stone Duality. FoSSaCS (1) 2024: 144-165 - Valentin Blot, Gilles Dowek, Thomas Traversié, Théo Winterhalter:
From Rewrite Rules to Axioms in the $\lambda \varPi $-Calculus Modulo Theory. FoSSaCS (2) 2024: 3-23 - Balder ten Cate, Jesse Comer:
Craig Interpolation for Decidable First-Order Fragments. FoSSaCS (2) 2024: 137-159 - Philipp Czerner, Javier Esparza, Valentin Krasotin:
A Resolution-Based Interactive Proof System for UNSAT. FoSSaCS (2) 2024: 116-136 - Laurent Doyen, Pranshu Gaba, Shibashis Guha:
Stochastic Window Mean-Payoff Games. FoSSaCS (1) 2024: 34-54 - Andrei Draghici, Christoph Haase, Andrew Ryzhikov:
Reachability in Fixed VASS: Expressiveness and Lower Bounds. FoSSaCS (2) 2024: 185-205 - Luca Geatti, Alessio Mansutti, Angelo Montanari:
Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems. FoSSaCS (2) 2024: 95-115 - Sergey Goncharov, Alessio Santamaria, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Logical Predicates in Higher-Order Mathematical Operational Semantics. FoSSaCS (2) 2024: 47-69 - Lucie Guillou, Corto Mascle, Nicolas Waldburger:
Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability. FoSSaCS (2) 2024: 250-270 - Daniel Hausmann, Mathieu Lehaut, Nir Piterman:
Symbolic Solution of Emerson-Lei Games for Reactive Synthesis. FoSSaCS (1) 2024: 55-78 - Daniel Hausmann, Nir Piterman, Irmak Saglam, Anne-Kathrin Schmuck:
Fair ømega-Regular Games. FoSSaCS (1) 2024: 13-33 - Bart Jacobs:
Drawing from an Urn is Isometric. FoSSaCS (1) 2024: 101-120 - Marek Jankola, Jan Strejcek:
Tighter Construction of Tight Büchi Automata. FoSSaCS (1) 2024: 234-255 - Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl:
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting. FoSSaCS (2) 2024: 206-228 - Orna Kupferman, Ofer Leshkowitz, Naama Shamash Halevy:
Synthesis with Privacy Against an Observer. FoSSaCS (1) 2024: 256-277 - Jérôme Leroux:
Ackermannian Completion of Separators. FoSSaCS (1) 2024: 3-10 - Aditya Prakash:
Checking History-Determinism is NP-hard for Parity Automata. FoSSaCS (1) 2024: 212-233 - Philip Saville:
Clones, closed categories, and combinatory logic. FoSSaCS (2) 2024: 160-181 - Dario Stein, Richard Samuelson:
Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory). FoSSaCS (1) 2024: 166-187 - Alejandro Villoria, Henning Basold, Alfons Laarman:
Enriching Diagrams with Algebraic Operations. FoSSaCS (1) 2024: 121-143 - Naoki Kobayashi, James Worrell:
Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14574, Springer 2024, ISBN 978-3-031-57227-2 [contents] - Naoki Kobayashi, James Worrell:
Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part II. Lecture Notes in Computer Science 14575, Springer 2024, ISBN 978-3-031-57230-2 [contents] - 2023
- Danel Ahman:
When Programs Have to Watch Paint Dry. FoSSaCS 2023: 1-23 - Pedro H. Azevedo de Amorim:
A Higher-Order Language for Markov Kernels and Linear Operators. FoSSaCS 2023: 89-112 - Paul C. Attie, William Cocke:
Model and Program Repair via Group Actions. FoSSaCS 2023: 520-540
skipping 767 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-06-10 10:46 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