Остановите войну!
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 24 matches
- 2001
- Marco Bernardo, Roberto Gorrieri:
Corrigendum to "A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time" - [TCS 202 (1998) 1-54]. Theor. Comput. Sci. 254(1-2): 691-694 (2001) - Jan Van den Bussche:
Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions. Theor. Comput. Sci. 254(1-2): 363-377 (2001) - Xiao Jun Chen, Rocco De Nicola:
Algebraic characterizations of trace and decorated trace equivalences over tree-like structures. Theor. Comput. Sci. 254(1-2): 337-361 (2001) - Tristan Crolard:
Subtractive logic. Theor. Comput. Sci. 254(1-2): 151-185 (2001) - Marcelo F. Frias, Roger D. Maddux:
Completeness of a relational calculus for program schemes. Theor. Comput. Sci. 254(1-2): 543-556 (2001) - Rachid Guerraoui, André Schiper:
Genuine atomic multicast in asynchronous distributed systems. Theor. Comput. Sci. 254(1-2): 297-316 (2001) - Stefano Guerrini, Andrea Masini:
Parsing MELL proof nets. Theor. Comput. Sci. 254(1-2): 317-335 (2001) - Anna Ingólfsdóttir, Andrea Schalk:
A fully abstract denotational model for observational precongruence. Theor. Comput. Sci. 254(1-2): 35-61 (2001) - Lars Jenner, Walter Vogler:
Fast asynchronous systems in dense time. Theor. Comput. Sci. 254(1-2): 379-422 (2001) - Joost-Pieter Katoen, Christel Baier, Diego Latella:
Metric semantics for true concurrent real time. Theor. Comput. Sci. 254(1-2): 501-542 (2001) - Mark Levene, George Loizou:
Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies. Theor. Comput. Sci. 254(1-2): 683-690 (2001) - François Monin, Marianne Simonot:
An ordinal measure based procedure for termination of functions. Theor. Comput. Sci. 254(1-2): 63-94 (2001) - Dieter Probst, Thomas Studer:
How to normalize the Jay. Theor. Comput. Sci. 254(1-2): 677-681 (2001) - Christophe Raffalli:
Completeness, minimal logic and programs extraction. Theor. Comput. Sci. 254(1-2): 259-271 (2001) - R. Ramesh, I. V. Ramakrishnan, R. C. Sekar:
Automata-driven efficient subterm unification. Theor. Comput. Sci. 254(1-2): 187-223 (2001) - Laura Recalde, Enrique Teruel, Manuel Silva Suárez:
Structure theory of multi-level deterministically synchronized sequential processes. Theor. Comput. Sci. 254(1-2): 1-33 (2001) - Pedro Resende:
Quantales, finite observations and strong bisimulation. Theor. Comput. Sci. 254(1-2): 95-149 (2001) - Panos Rondogiannis:
Stratified negation in temporal logic programming and the cycle-sum test. Theor. Comput. Sci. 254(1-2): 663-676 (2001) - Salvatore Ruggieri:
exists-Universal termination of logic programs. Theor. Comput. Sci. 254(1-2): 273-296 (2001) - Konstantinos Sagonas, Terrance Swift, David Scott Warren:
The limits of fixed-order computation. Theor. Comput. Sci. 254(1-2): 465-499 (2001) - Jan Springintveld, Frits W. Vaandrager, Pedro R. D'Argenio:
Testing timed automata. Theor. Comput. Sci. 254(1-2): 225-257 (2001) - Paul Spruit, Roel J. Wieringa, John-Jules Ch. Meyer:
Regular database update logics. Theor. Comput. Sci. 254(1-2): 591-661 (2001) - Bent Thomsen, Samson Abramsky:
A fully abstract denotational semantics for the calculus of higher-order communicating systems. Theor. Comput. Sci. 254(1-2): 557-589 (2001) - Luc Vandeurzen, Marc Gyssens, Dirk Van Gucht:
On the expressiveness of linear-constraint query languages for spatial databases. Theor. Comput. Sci. 254(1-2): 423-463 (2001)
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-24 11:13 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