Остановите войну!
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 22 matches
- 1981
- Luigia Carlucci Aiello, Gianfranco Prini:
An Efficient Interpreter for the Lambda-Calculus. J. Comput. Syst. Sci. 23(3): 383-424 (1981) - Ralph-Johan Back:
On Correct Refinement of Programs. J. Comput. Syst. Sci. 23(1): 49-68 (1981) - Hartmut Ehrig, Bernd Mahr:
Complexity of Algebraic Implementations for Abstract Data Types. J. Comput. Syst. Sci. 23(2): 223-253 (1981) - Michael L. Fredman, Dennis J. Volper:
Query Time Versus Redundancy Trade-Offs for Range Queries. J. Comput. Syst. Sci. 23(3): 355-365 (1981) - Jean H. Gallier:
Recursion-Closed Algebraic Theories. J. Comput. Syst. Sci. 23(1): 69-105 (1981) - Gérard P. Huet:
A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. J. Comput. Syst. Sci. 23(1): 11-21 (1981) - Deborah Joseph, Paul Young:
Independence Results in Computer Science? J. Comput. Syst. Sci. 23(2): 205-222 (1981) - Ernst L. Leiss:
The Complexity of Restricted Regular Expressions and the Synthesis Problem for Finite Automata. J. Comput. Syst. Sci. 23(3): 348-354 (1981) - Nancy A. Lynch:
Upper Bounds for Static Resource Allocation in a Distributed System. J. Comput. Syst. Sci. 23(2): 254-278 (1981) - Hermann A. Maurer, Arto Salomaa, Derick Wood:
Completeness of Context-Free Grammar Forms. J. Comput. Syst. Sci. 23(1): 1-10 (1981) - Albert R. Meyer, Rohit Parikh:
Definability in Dynamic Logic. J. Comput. Syst. Sci. 23(2): 279-298 (1981) - Katsuhiko Nakamura:
Synchronous to Asynchronous Transformation of Polyautomata. J. Comput. Syst. Sci. 23(1): 22-37 (1981) - Mark H. Overmars, Jan van Leeuwen:
Maintenance of Configurations in the Plane. J. Comput. Syst. Sci. 23(2): 166-204 (1981) - Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda:
The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine. J. Comput. Syst. Sci. 23(3): 366-382 (1981) - Wolfgang J. Paul, Joel I. Seiferas, Janos Simon:
An Information-Theoretic Approach to Time Bounds for On-Line Computation. J. Comput. Syst. Sci. 23(2): 108-126 (1981) - Nicholas Pippenger:
Pebbling with an Auxiliary Pushdown. J. Comput. Syst. Sci. 23(2): 151-165 (1981) - Alan L. Selman:
Some Observations on NP, Real Numbers and P-Selective Sets. J. Comput. Syst. Sci. 23(3): 326-332 (1981) - Lawrence Snyder:
Theft and Conspiracy in the Take-Grant Protection Model. J. Comput. Syst. Sci. 23(3): 333-347 (1981) - Martin Tompa:
Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. J. Comput. Syst. Sci. 23(1): 106 (1981) - Martin Tompa:
An Optimal Solution to a Wire-Routing Problem. J. Comput. Syst. Sci. 23(2): 127-150 (1981) - Rüdiger Valk, Guy Vidal-Naquet:
Petri Nets and Regular Languages. J. Comput. Syst. Sci. 23(3): 299-325 (1981) - Arthur G. Werschulz:
On Maximal Order for Local and Global Numerical Problems. J. Comput. Syst. Sci. 23(1): 38-48 (1981)
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-27 03:53 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