Остановите войну!
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 127 matches
- 1983
- Gerhard Barth:
Interprocedural data flow systems. Theoretical Computer Science 1983: 49-59 - Bernd Becker:
On the crossing-free, rectangular embedding of weighted graphs in the plane. Theoretical Computer Science 1983: 61-72 - Eike Best, Agathe Merceron:
Discreteness, k-density and d-continuity of occurrence nets. Theoretical Computer Science 1983: 73-83 - Ronald V. Book, Timothy J. Long, Alan L. Selman:
Controlled relativizations of P and NP. Theoretical Computer Science 1983: 85-90 - Franz-Josef Brandenburg:
The computational complexity of certain graph grammars. Theoretical Computer Science 1983: 91-99 - Robert L. Constable:
Partial functions in constructive formal theories. Theoretical Computer Science 1983: 1-18 - Andreas Eick, Elfriede Fehr:
Inconsistencies of pure LISP. Theoretical Computer Science 1983: 101-110 - Alain Finkel, Gérard Memmi:
Fifo nets: a new model of parallel computation. Theoretical Computer Science 1983: 111-121 - Françoise Gire:
Une extension aux mots infinis de la notion de transduction rationelle. Theoretical Computer Science 1983: 123-139 - Martin Gogolla, Klaus Drosten, Udo W. Lipeck, Hans-Dieter Ehrich:
Algebraic and operational semantics of exceptions and errors. Theoretical Computer Science 1983: 141-151 - Friedhelm Meyer auf der Heide:
Efficiency of universal parallel computers. Theoretical Computer Science 1983: 221-241 - R. Kemp:
The expected number of nodes and leaves at level k in ordered trees. Theoretical Computer Science 1983: 153-163 - Christoph Kreitz, Klaus Weihrauch:
Complexity theory on real numbers and functions. Theoretical Computer Science 1983: 165-174 - Manfred Kunde:
A multifit algorithm for uniform multiprocessor scheduling. Theoretical Computer Science 1983: 175-185 - Karl J. Lieberherr, Stephen A. Vavasis:
Analysis of polynomial approximation algorithms for constraint expressions. Theoretical Computer Science 1983: 187-197 - Andrzej Lingas:
Heuristics for minimum edge length rectangular partitions of rectilinear figures. Theoretical Computer Science 1983: 199-210 - Johann A. Makowsky, Bernd Mahr:
An axiomatic approach to semantics of specification languages. Theoretical Computer Science 1983: 211-219 - Anton Nijholt, Jan Pittl:
A general scheme for some deterministically parsable grammars and their strong equivalents. Theoretical Computer Science 1983: 243-255 - Tobias Nipkow, Gerhard Weikum:
A decidability result about sufficient-completeness of axiomatically specified abstract data types. Theoretical Computer Science 1983: 257-268 - Christos H. Papadimitriou:
Theory of concurrency control. Theoretical Computer Science 1983: 35-47 - Christos H. Papadimitriou, Stathis Zachos:
Two remarks on the power of counting. Theoretical Computer Science 1983: 269-276 - Jean-Eric Pin, Jacques Sakarovitch:
Some operations and transductions that preserve rationality. Theoretical Computer Science 1983: 277-288 - Axel Poigné:
On algebras of computation sequences and proofs of equivalence of operational and denotational semantics. Theoretical Computer Science 1983: 289-300 - Claus-Peter Schnorr:
Monte-Carlo factoring algorithm with finite storage. Theoretical Computer Science 1983: 19-33 - Patrice Séébold:
Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits. Theoretical Computer Science 1983: 301-311 - Géraud Sénizergues:
The equivalence problem for N.T.S. languages is decidable. Theoretical Computer Science 1983: 313-323 - Kurt Sieber:
Weakest expressible preconditions: a new tool for proving completeness results about Hoare calculi. Theoretical Computer Science 1983: 325-334 - Wolfgang Thomas:
A hierarchy of sets of infinite trees. Theoretical Computer Science 1983: 335-342 - Athanasios K. Tsakalidis:
Maintaining order in a generalized linked list. Theoretical Computer Science 1983: 343-352 - Harry A. G. Wijshoff, Jan van Leeuwen:
Periodic versus arbitrary tessellations of the plane using polyominos of a single type. Theoretical Computer Science 1983: 353-366
skipping 97 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-06-30 08: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