Остановите войну!
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 34 matches
- 2001
- Uri Abraham, Shlomi Dolev, Ted Herman, Irit Koll:
Self-stabilizing l-exclusion. Theor. Comput. Sci. 266(1-2): 653-692 (2001) - Gabriel Aguilera, Inman P. de Guzmán, Manuel Ojeda-Aciego, Agustín Valverde:
Reductions for non-clausal theorem proving. Theor. Comput. Sci. 266(1-2): 81-112 (2001) - David Aspinall, Adriana B. Compagnoni:
Subtyping dependent types. Theor. Comput. Sci. 266(1-2): 273-309 (2001) - Vincenzo Auletta, Ioannis Caragiannis, Luisa Gargano, Christos Kaklamanis, Pino Persiano:
Sparse and limited wavelength conversion in all-optical tree networks. Theor. Comput. Sci. 266(1-2): 887-934 (2001) - Gilles Barthe, John Hatcliff, Morten Heine Sørensen:
An induction principle for pure type systems. Theor. Comput. Sci. 266(1-2): 773-818 (2001) - Michel Bauderon, Hélène Jacquet:
Node rewriting in graphs and hypergraphs: a categorical framework. Theor. Comput. Sci. 266(1-2): 463-487 (2001) - Michele Boreale, Rocco De Nicola, Rosario Pugliese:
Divergence in testing and readiness semantics. Theor. Comput. Sci. 266(1-2): 237-248 (2001) - René David:
On the asymptotic behaviour of primitive recursive algorithms. Theor. Comput. Sci. 266(1-2): 159-193 (2001) - Cédric Fournet, Cosimo Laneve:
Bisimulations in the join-calculus. Theor. Comput. Sci. 266(1-2): 569-603 (2001) - Robert Goldblatt:
What is the coalgebraic analogue of Birkhoff's variety theorem? Theor. Comput. Sci. 266(1-2): 853-886 (2001) - Jan Friso Groote, Jos van Wamel:
The parallel composition of uniform processes with data. Theor. Comput. Sci. 266(1-2): 631-652 (2001) - Masatomo Hashimoto, Atsushi Ohori:
A typed context calculus. Theor. Comput. Sci. 266(1-2): 249-272 (2001) - Thierry Joly:
Constant time parallel computations in lambda-calculus. Theor. Comput. Sci. 266(1-2): 975-985 (2001) - Zurab Khasidashvili:
On the longest perpetual reductions in orthogonal expression reduction systems. Theor. Comput. Sci. 266(1-2): 737-772 (2001) - Manolis Koubarakis:
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning. Theor. Comput. Sci. 266(1-2): 311-339 (2001) - Thomas Krantz, Virgile Mogbil:
Encoding Hamiltonian circuits into multiplicative linear logic. Theor. Comput. Sci. 266(1-2): 987-996 (2001) - Karl Lermer, Paul A. Strooper:
Refinement and state machine abstraction. Theor. Comput. Sci. 266(1-2): 195-235 (2001) - Ralph Loader:
Finitary PCF is not decidable. Theor. Comput. Sci. 266(1-2): 341-364 (2001) - Mila E. Majster-Cederbaum:
Underspecification for a simple process algebra of recursive processes. Theor. Comput. Sci. 266(1-2): 935-950 (2001) - Tatsuru Matsushita, Colin Runciman:
The accepting power of unary string logic programs. Theor. Comput. Sci. 266(1-2): 59-79 (2001) - Annabelle McIver, Carroll Morgan:
Partial correctness for probabilistic demonic programs. Theor. Comput. Sci. 266(1-2): 513-541 (2001) - César A. Muñoz:
Proof-term synthesis on dependent-type systems via explicit substitutions. Theor. Comput. Sci. 266(1-2): 407-440 (2001) - Riccardo Pucella, Prakash Panangaden:
On the expressive power of first-order boolean functions in PCF. Theor. Comput. Sci. 266(1-2): 543-567 (2001) - James Riely, Matthew Hennessy:
Distributed processes and location failures. Theor. Comput. Sci. 266(1-2): 693-735 (2001) - Karl Schlechta, Jürgen Dix:
Explaining updates by minimal sums. Theor. Comput. Sci. 266(1-2): 819-838 (2001) - Klaus U. Schulz, Stephan Kepser:
Combination of constraint systems II: Rational amalgamation. Theor. Comput. Sci. 266(1-2): 113-157 (2001) - Carsten Schürmann, Joëlle Despeyroux, Frank Pfenning:
Primitive recursion for higher-order abstract syntax. Theor. Comput. Sci. 266(1-2): 1-57 (2001) - Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You:
Loop checks for logic programs with functions. Theor. Comput. Sci. 266(1-2): 441-461 (2001) - Dieter Spreen:
Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi". Theor. Comput. Sci. 266(1-2): 997-998 (2001) - Jirí Srba:
Basic process algebra with deadlocking states. Theor. Comput. Sci. 266(1-2): 605-630 (2001)
skipping 4 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:39 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