Остановите войну!
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 19 matches
- 2000
- Noriko H. Arai:
No feasible monotone interpolation for simple combinatorial reasoning. Theor. Comput. Sci. 238(1-2): 477-482 (2000) - Philippe Besnard, Torsten Schaub:
What is a (non-constructive) non-monotone logical system? Theor. Comput. Sci. 238(1-2): 489-494 (2000) - Michele Boreale, Luca Trevisan:
A complexity analysis of bisimilarity for value-passing processes. Theor. Comput. Sci. 238(1-2): 313-345 (2000) - Michael Codish, Vitaly Lagoon:
Type dependencies for logic programs using ACI-unification. Theor. Comput. Sci. 238(1-2): 131-159 (2000) - Ludwik Czaja:
Process languages and nets. Theor. Comput. Sci. 238(1-2): 161-181 (2000) - Wim H. Hesselink, Albert Thijs:
Fixpoint semantics and simulation. Theor. Comput. Sci. 238(1-2): 275-311 (2000) - Joost-Pieter Katoen, Albert Nymeyer:
Pattern-matching algorithms based on term rewrite systems. Theor. Comput. Sci. 238(1-2): 439-464 (2000) - Delia Kesner:
Confluence of extensional and non-extensional lambda-calculi with explicit substitutions. Theor. Comput. Sci. 238(1-2): 183-220 (2000) - Ines Margaria, Maddalena Zacchi:
Generalized filter models. Theor. Comput. Sci. 238(1-2): 363-387 (2000) - Holger Naundorf:
Strictly causal functions have a unique fixed point. Theor. Comput. Sci. 238(1-2): 483-488 (2000) - Rocco De Nicola, Rosario Pugliese:
Linda-based applicative and imperative process algebras. Theor. Comput. Sci. 238(1-2): 389-437 (2000) - Giuliano Pacini, Maria I. Sessa:
Loop checking in SLD-derivations by well-quasi-ordering of goals. Theor. Comput. Sci. 238(1-2): 221-246 (2000) - Prakash Panangaden, Clark Verbrugge:
Generating irregular partitionable data structures. Theor. Comput. Sci. 238(1-2): 31-80 (2000) - Markus Roggenbach, Mila E. Majster-Cederbaum:
Towards a unified view of bisimulation: a comparative study. Theor. Comput. Sci. 238(1-2): 81-130 (2000) - Viktor K. Sabelfeld:
The tree equivalence of linear recursion schemes. Theor. Comput. Sci. 238(1-2): 1-29 (2000) - Petr Savický, Jirí Sgall:
DNF tautologies with a limited number of occurrences of every variable. Theor. Comput. Sci. 238(1-2): 495-498 (2000) - Petr Savický, Stanislav Zák:
A read-once lower bound and a (1, +k)-hierarchy for branching programs. Theor. Comput. Sci. 238(1-2): 347-362 (2000) - Sándor Vágvölgyi:
Congruential complements of ground term rewrite systems. Theor. Comput. Sci. 238(1-2): 247-274 (2000) - Mingsheng Ying:
Weak confluence and tau-inertness. Theor. Comput. Sci. 238(1-2): 465-475 (2000)
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-29 18: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