![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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
- 1981
- Stuart Oliver Anderson, Roland Carl Backhouse:
Locally Least-Cost Error Recovery in Early's Algorithm. ACM Trans. Program. Lang. Syst. 3(3): 318-347 (1981) - F. André, Jean-Pierre Banâtre, Jean-Paul Routeau:
A Multiprocessing Approach to Compile-Time Symbol Resolution. ACM Trans. Program. Lang. Syst. 3(1): 11-23 (1981) - Gregory R. Andrews:
Synchronizing Resources. ACM Trans. Program. Lang. Syst. 3(4): 405-430 (1981) - Krzysztof R. Apt:
Ten Years of Hoare's Logic: A Survey - Part 1. ACM Trans. Program. Lang. Syst. 3(4): 431-483 (1981) - John A. Barnden:
Nonsequentiality and Concrete Activity Phases in Discrete-Event Simulation Languages. ACM Trans. Program. Lang. Syst. 3(3): 293-317 (1981) - Alan Borning:
The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory. ACM Trans. Program. Lang. Syst. 3(4): 353-387 (1981) - Jan van den Bos, Marinus J. Plasmeijer, Jan Stroet:
Process Communication Based on Input Specifications. ACM Trans. Program. Lang. Syst. 3(3): 224-250 (1981) - Christopher W. Fraser, A. A. Lopez:
Editing Data Structures. ACM Trans. Program. Lang. Syst. 3(2): 115-125 (1981) - John D. Gannon, Paul R. McMullin, Richard G. Hamlet:
Data-Abstraction Implementation, Specification, and Testing. ACM Trans. Program. Lang. Syst. 3(3): 211-223 (1981) - Irene Greif, Albert R. Meyer:
Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer. ACM Trans. Program. Lang. Syst. 3(4): 484-507 (1981) - Ralph E. Griswold, David R. Hanson, John T. Korb
:
Generators in Icon. ACM Trans. Program. Lang. Syst. 3(2): 144-161 (1981) - Dale H. Grit, Rex L. Page:
Deleting Irrelevant Tasks in an Expression-Oriented Multiprocessor System. ACM Trans. Program. Lang. Syst. 3(1): 49-59 (1981) - Wilfred J. Hansen:
A Cost Model for the Internal Organization of B+-Tree Nodes. ACM Trans. Program. Lang. Syst. 3(4): 508-532 (1981) - David R. Hanson:
Algorithm 568: PDS - A Portable Directory System. ACM Trans. Program. Lang. Syst. 3(2): 162-167 (1981) - Mehdi Jazayeri, Diane Pozefsky:
Space-Efficient Storage Management in an Attribute Grammar Evaluator. ACM Trans. Program. Lang. Syst. 3(4): 388-404 (1981) - Otto C. Juelich, Clinton R. Foulk:
Compilation of Acyclic Smooth Programs for Parallel Execution. ACM Trans. Program. Lang. Syst. 3(1): 24-48 (1981) - Bent Bruun Kristensen, Ole Lehrmann Madsen:
Methods for Computing LALR(k) Lookahead. ACM Trans. Program. Lang. Syst. 3(1): 60-82 (1981) - Wilf R. LaLonde:
The Construction of Stack-Controlling LR Parsers for Regular Right Part Grammars. ACM Trans. Program. Lang. Syst. 3(2): 168-206 (1981) - Wilf R. LaLonde, Jim des Rivières:
Handling Operator Precedence in Arithmetic Expressions with Tree Transformations. ACM Trans. Program. Lang. Syst. 3(1): 83-103 (1981) - Gary Lindstrom, Mary Lou Soffa:
Referencing and Retention in Block-Structured Coroutines. ACM Trans. Program. Lang. Syst. 3(3): 263-292 (1981) - Jayadev Misra:
An Exercise in Program Explanation. ACM Trans. Program. Lang. Syst. 3(1): 104-109 (1981) - Martin Rem:
Associons: A Program Notation with Tuples Instead of Variables. ACM Trans. Program. Lang. Syst. 3(3): 251-262 (1981) - Edmond Schonberg, Jacob T. Schwartz, Micha Sharir:
An Automatic Technique for Selection of Data Structures in SETL Programs. ACM Trans. Program. Lang. Syst. 3(2): 126-143 (1981) - Jørgen Steensgaard-Madsen:
A Statement-Oriented Approach to Data Abstraction. ACM Trans. Program. Lang. Syst. 3(1): 1-10 (1981)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-26 17:26 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