![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 26 matches
- 2003
- Samson Abramsky
:
Sequentiality vs. Concurrency In Games And Logic. Math. Struct. Comput. Sci. 13(4): 531-565 (2003) - Luca Aceto, Giuseppe Longo, Björn Victor:
Foreword To Special Issue: The Difference Between Concurrent And Sequential Computation. Math. Struct. Comput. Sci. 13(4): 481-484 (2003) - Jirí Adámek, Stefan Milius, Jirí Velebil:
Free Iterative Theories: A Coalgebraic View. Math. Struct. Comput. Sci. 13(2): 259-320 (2003) - Jirí Adámek, Hans-E. Porst:
On Varieties and Covarieties in a Category. Math. Struct. Comput. Sci. 13(2): 201-232 (2003) - Steven Awodey, Jesse Hughes:
Modal Operators and the Formal Dual of Birkhoff's Completeness Theorem. Math. Struct. Comput. Sci. 13(2): 233-258 (2003) - Jos C. M. Baeten:
Embedding Untimed Into Timed Process Algebra: The Case For Explicit Termination. Math. Struct. Comput. Sci. 13(4): 589-618 (2003) - Anindya Banerjee, Thomas P. Jensen:
Modular Control-Flow Analysis with Rank 2 Intersection Types. Math. Struct. Comput. Sci. 13(1): 87-124 (2003) - Falk Bartels:
Generalised Coinduction. Math. Struct. Comput. Sci. 13(2): 321-348 (2003) - Antonio Bucciarelli, Adolfo Piperno, Ivano Salvo:
Intersection Types and lambda-Definability. Math. Struct. Comput. Sci. 13(1): 15-53 (2003) - Flavio Corradini, Dino Di Cola:
The Expressive Power Of Urgent, Lazy And Busy-Waiting Actions In Timed Processes. Math. Struct. Comput. Sci. 13(4): 619-656 (2003) - Roberto Di Cosmo, Delia Kesner, Emmanuel Polonowski:
Proof Nets And Explicit Substitutions. Math. Struct. Comput. Sci. 13(3): 409-450 (2003) - Ferruccio Damiani
:
A Conjunctive Type System for Useless-Code Elimination. Math. Struct. Comput. Sci. 13(1): 157-197 (2003) - Daniel J. Dougherty, Pierre Lescanne:
Reductions, Intersection Types, and Explicit Substitutions. Math. Struct. Comput. Sci. 13(1): 55-85 (2003) - Dominique Duval:
Diagrammatic Specifications. Math. Struct. Comput. Sci. 13(6): 857-890 (2003) - Lorenzo Tortora de Falco
:
Obsessional Experiments For Linear Logic Proof-Nets. Math. Struct. Comput. Sci. 13(6): 799-855 (2003) - Neil Ghani, Christoph Lüth, Federico De Marchi, John Power
:
Dualising Initial Algebras. Math. Struct. Comput. Sci. 13(2): 349-370 (2003) - Andrew D. Gordon, Luca Cardelli
:
Equational Properties Of Mobile Ambients. Math. Struct. Comput. Sci. 13(3): 371-408 (2003) - Peter Hines:
A Categorical Framework For Finite State Machines. Math. Struct. Comput. Sci. 13(3): 451-480 (2003) - Cosimo Laneve, Björn Victor:
Solos In Concert. Math. Struct. Comput. Sci. 13(5): 657-683 (2003) - Philippe Matherat, Marc-Thierry Jaekel:
Concurrent Computing Machines And Physical Space-Time. Math. Struct. Comput. Sci. 13(5): 771-798 (2003) - Christian Mossin:
Exact Flow Analysis. Math. Struct. Comput. Sci. 13(1): 125-156 (2003) - Catuscia Palamidessi:
Comparing The Expressive Power Of The Synchronous And Asynchronous Pi-Calculi. Math. Struct. Comput. Sci. 13(5): 685-719 (2003) - Vaughan R. Pratt:
Transition And Cancellation In Concurrency And Branching Time. Math. Struct. Comput. Sci. 13(4): 485-529 (2003) - Jirí Srba:
Complexity Of Weak Bisimilarity And Regularity For Bpa And Bpp. Math. Struct. Comput. Sci. 13(4): 567-587 (2003) - Pawel Urzyczyn:
A Simple Proof of the Undecidability of Strong Normalisation. Math. Struct. Comput. Sci. 13(1): 5-13 (2003) - Pascal Zimmer:
On The Expressiveness Of Pure Safe Ambients. Math. Struct. Comput. Sci. 13(5): 721-770 (2003)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-27 10:43 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