Остановите войну!
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 33 matches
- 2017
- Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg:
Unifying Guarded and Unguarded Iteration. FoSSaCS 2017: 517-533 - Sergio Abriola, Diego Figueira, Santiago Figueira:
Logics of Repeating Values on Data Trees and Branching Counter Systems. FoSSaCS 2017: 196-212 - Thorsten Altenkirch, Nils Anders Danielsson, Nicolai Kraus:
Partiality, Revisited - The Partiality Monad as a Quotient Inductive-Inductive Type. FoSSaCS 2017: 534-549 - Paolo Baldan, Tommaso Padoan:
Local Model Checking in a Logic for True Concurrency. FoSSaCS 2017: 407-423 - Stefano Berardi, Makoto Tatsuta:
Classical System of Martin-Löf's Inductive Definitions Is Not Equivalent to Cyclic Proof System. FoSSaCS 2017: 301-317 - Gaoang Bian, Alessandro Abate:
On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context. FoSSaCS 2017: 321-337 - Jasmin Christian Blanchette, Uwe Waldmann, Daniel Wand:
A Lambda-Free Higher-Order Recursive Path Order. FoSSaCS 2017: 461-479 - Michele Boreale:
Algebra, Coalgebra, and Minimization in Polynomial Differential Equations. FoSSaCS 2017: 71-87 - Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann:
Bounding Average-Energy Games. FoSSaCS 2017: 179-195 - Patricia Bouyer, Vincent Jugé:
Dynamic Complexity of the Dyck Reachability. FoSSaCS 2017: 265-280 - Flavien Breuvart, Ugo Dal Lago, Agathe Herrou:
On Higher-Order Probabilistic Subrecursion. FoSSaCS 2017: 370-386 - Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the Existence of Weak Subgame Perfect Equilibria. FoSSaCS 2017: 145-161 - Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Optimal Reachability in Divergent Weighted Timed Games. FoSSaCS 2017: 162-178 - Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata. FoSSaCS 2017: 231-247 - Florence Clerc, Vincent Danos, Fredrik Dahlqvist, Ilias Garnier:
Pointless Learning. FoSSaCS 2017: 355-369 - Raphaëlle Crubillé, Thomas Ehrhard, Michele Pagani, Christine Tasson:
The Free Exponential Modality of Probabilistic Coherence Spaces. FoSSaCS 2017: 20-35 - Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi:
The Paths to Choreography Extraction. FoSSaCS 2017: 424-440 - Vincent Danos, Tobias Heindel, Ilias Garnier, Jakob Grue Simonsen:
Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables. FoSSaCS 2017: 338-354 - Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois:
Degree of Sequentiality of Weighted Automata. FoSSaCS 2017: 215-230 - Frédéric Gilbert:
Automated Constructivization of Proofs. FoSSaCS 2017: 480-495 - G. A. Kavvos:
On the Semantics of Intensionality. FoSSaCS 2017: 550-566 - James Laird:
From Qualitative to Quantitative Semantics - By Change of Base. FoSSaCS 2017: 36-52 - Julien Lange, Nobuko Yoshida:
On the Undecidability of Asynchronous Session Subtyping. FoSSaCS 2017: 441-457 - Konstantinos Mamouras:
Equational Theories of Abnormal Termination Based on Kleene Algebra. FoSSaCS 2017: 88-105 - Kei Matsumoto:
Coherence Spaces and Uniform Continuity. FoSSaCS 2017: 3-19 - Damien Pous, Jurriaan Rot:
Companions, Codensity and Causality. FoSSaCS 2017: 106-123 - Ken Sakayori, Takeshi Tsukada:
A Truly Concurrent Game Model of the Asynchronous \pi -Calculus. FoSSaCS 2017: 389-406 - Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. FoSSaCS 2017: 124-142 - Paula Severi:
A Light Modality for Recursion. FoSSaCS 2017: 499-516 - Alex Simpson:
Cyclic Arithmetic Is Equivalent to Peano Arithmetic. FoSSaCS 2017: 283-300
skipping 3 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 06:55 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