Остановите войну!
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 13 matches
- 2002
- Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko:
The Probability Nesting Game. EXPRESS 2002: 4-14 - Marco Carbone, Sergio Maffeis:
On the Expressive Power of Polyadic Synchronisation in pi-calculus. EXPRESS 2002: 15-32 - Rance Cleaveland, Gerald Lüttgen:
A Logical Process Calculus. EXPRESS 2002: 33-50 - Maribel Fernández, Lionel Khalil:
Interaction Nets with McCarthy's amb. EXPRESS 2002: 51-68 - Ulrik Frendrup, Hans Hüttel, Jesper Nyholm Jensen:
Modal Logics for Cryptographic Processes. EXPRESS 2002: 124-141 - Martin Lange:
Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition. EXPRESS 2002: 70-86 - Nicolas Markey:
Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past. EXPRESS 2002: 87-104 - Uwe Nestmann, Prakash Panangaden:
Preface. EXPRESS 2002: 1-2 - Joël Ouaknine, James Worrell:
Timed CSP = Closed Timed Safety Automata. EXPRESS 2002: 142-159 - Catuscia Palamidessi:
On the Expressive Power of Temporal Concurrent Constraint Programming Languages (invited talk). EXPRESS 2002: 3 - Vladimiro Sassone, Pawel Sobocinski:
Deriving Bisimulation Congruences: A 2-categorical Approach. EXPRESS 2002: 105-123 - Igor Walukiewicz:
Describing properties of concurrent systems (Logic for Traces) (invited talk). EXPRESS 2002: 69 - Uwe Nestmann, Prakash Panangaden:
9th International Workshop on Expressiveness in Concurrency, EXPRESS 2002, Satellite Workshop from CONCUR 2002, Brno, Czech Republic, August 19, 2002. Electronic Notes in Theoretical Computer Science 68(2), Elsevier 2002 [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-05-26 11:41 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