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