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