Остановите войну!
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 29 matches
- 1981
- Stål O. Aanderaa, Egon Börger:
The Equivalence of Horn and Network Complexity for Boolean Functions. Acta Informatica 15: 303-307 (1981) - Krzysztof R. Apt:
Recursive Assertions and Parallel Programs. Acta Informatica 15: 219-232 (1981) - Toshiro Araki, Nobuki Tokura:
Flow Languages Equal Recursively Enumerable Languages. Acta Informatica 15: 209-217 (1981) - François Baccelli:
Analysis of a Service Facility with Periodic Checkpointing. Acta Informatica 15: 67-81 (1981) - Ralph-Johan Back:
Proving Total Correctness of Nondeterministic Programs in Infinitary Logic. Acta Informatica 15: 233-249 (1981) - Friedrich L. Bauer, Andrei P. Ershov, Manfred Paul, Alan J. Perlis:
Klaus Samelson. Acta Informatica 15: 1-2 (1981) - Daniel M. Berry:
Remarks on R. D. Tennent's Language Design Methods Based on Semantic Principles: Algol 68, A Language Designed Using Semantic Principles. Acta Informatica 15: 83-98 (1981) - Kellogg S. Booth, Richard J. Lipton:
Computing Extremal and Approximate Distances in Graphs Having Unit Cost Edges. Acta Informatica 15: 319-328 (1981) - Onno J. Boxma, Alan G. Konheim:
Approximate Analysis of Exponential Queueing Systems with Blocking. Acta Informatica 15: 19-66 (1981) - Arie de Bruin:
Goto Statements: Semantics and Deduction Systems. Acta Informatica 15: 385-424 (1981) - Robert Cartwright, Derek C. Oppen:
The Logic of Aliasing. Acta Informatica 15: 365-384 (1981) - Marco A. Casanova, Philip A. Bernstein:
General Purpose Schedulers for Database System. Acta Informatica 15: 471 (1981) - Hans Daduna, Rolf Schassberger:
A Discrete-Time Round-Robin Queue with Bernoulli Input and General Arithmetic Service Time Distributions. Acta Informatica 15: 251-263 (1981) - Donald L. Iglehart, Gerald S. Shedler:
Regenerative Simulation of Response Times in Networks of Queues: Statistical Efficiency. Acta Informatica 15: 347-363 (1981) - Rainer Kemp:
LR (0) Grammars Generated by LR (0) Parsers. Acta Informatica 15: 265-280 (1981) - Lawrence T. Kou, George Markowsky, Leonard Berman:
A Fast Algorithm for Steiner Trees. Acta Informatica 15: 141-145 (1981) - Werner Kuich:
The Characterization of Parallel Ultralinear Grammars by Rational Power Series. Acta Informatica 15: 129-139 (1981) - Gary Levin, David Gries:
A Proof Technique for Communicating Sequential Processes. Acta Informatica 15: 281-302 (1981) - Witold Lipski Jr., Franco P. Preparata:
Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems. Acta Informatica 15: 329-346 (1981) - Ernst W. Mayr:
Persistence of Vector Replacement Systems is Decidable. Acta Informatica 15: 309-318 (1981) - Daniel J. Moore, Bruce Russell:
Axiomatic Data Type Specifications: A First Order Theory of Linear Lists. Acta Informatica 15: 193-207 (1981) - Paul Walton Purdom Jr., Cynthia A. Brown:
Parsing Extended LR(k) Grammars. Acta Informatica 15: 115-127 (1981) - Paul Walton Purdom Jr., Cynthia A. Brown, Edward L. Robertson:
Backtracking with Multi-Level Dynamic Search Rearrangement. Acta Informatica 15: 99-113 (1981) - Stefan Reisch:
Hex ist PSPACE-vollständig. Acta Informatica 15: 167-191 (1981) - F. Rodriguez:
Indépendance Forte de Certaines Opérations. Acta Informatica 15: 153-166 (1981) - Takehiro Tokuda:
Eliminating Unit Reductions from LR(k) Parsers Using Minimum Contexts. Acta Informatica 15: 447-470 (1981) - Ingo Wegener:
An Improved Complexity Hierarchy on the Depth of Boolean Functions. Acta Informatica 15: 147-152 (1981) - William E. Wright:
Binary Search Trees in Secondary Memory. Acta Informatica 15: 3-17 (1981) - Harald Würgers:
A Specification Technique Based on Predicate Transformers. Acta Informatica 15: 425-445 (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-13 13:14 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