Volume 13, 1980
- Edsger W. Dijkstra:
Some Beautiful Arguments Using Mathematical Induction.
1-8
- Christoph M. Hoffmann:
Semantic Properties of Lucid's Compute Clause and its Compilation.
9-20
- Philip Heidelberger:
Variance Reduction Techniques for the Simulation of Markov Process.
21-37
- Gaston H. Gonnet, Lawrence D. Rogers, J. Alan George:
An Algorithmic and Complexity Analysis of Interpolation Search.
39-52
- Zvi Galil:
Applications of Efficient Mergeable Heaps for Optimization Problems on Trees.
53-58
- Stefan Reisch:
Gobang ist PSPACE-vollständig.
59-66
- Jörg H. Siekmann, Graham Wrightson:
Paramodulated Connection Graphs.
67-86
- Hermann A. Maurer, Arto Salomaa, Derick Wood:
On Generators and Generative Capacity of EOL Forms.
87-107
- Ingo Wegener:
A new Lower Bound on the Monotone Network Complexity of Boolean Sums.
109-114
- Johannes Röhrich:
Methods for the Automatic Construction of Error Correcting Parsers.
115-139
- Charles N. Fischer, D. R. Milton, S. B. Quiring:
Efficient LL(1) Error Correction and Recovery Using Only Insertions.
141-154
- Jon Louis Bentley, Hermann A. Maurer:
Efficient Worst-Case Data Structures for Range Searching.
155-168
- Edmund M. Clarke:
Proving Correctness of Coroutines Without History Variables.
169-188
- Christophe Reutenauer:
An Ogden-Like Iteration Lemma for Rational Power Series.
189-197
- Chandra M. R. Kintala, Detlef Wotschke:
Amounts of Nondeterminism in Finite Automata.
199-204
- Frank Wm. Tompa:
A Practical Example of the Specification of Abstract Data Types.
205-224
- David R. Barstow:
Remarks on "A Synthesis of Several Sorting Algorithms" by John Darlington.
225-227
- Uwe Kastens:
Ordered Attributed Grammars.
229-256
- Grzegorz Rozenberg, Derick Wood:
Context-Free Grammars With Selective Rewriting.
257-268
- Hans Kleine Büning, Lutz Priese:
Universal Asynchronous Iterative Arrays of Mealy Automata.
269-285
- Hans-Anton Rollik:
Automaten in planaren Graphen.
287-298
- William R. Franta, Mark Benedict Bilodeau:
Analysis of a Prioritized CSMA Protocol Based on Staggered Delays.
299-324
- Alfs T. Berztiss:
Depth-First K-Trees and Critical Path Analysis.
325-346
- Michel Latteux:
Sur les générateurs algébriques et linéaires.
347-363
- Hermann A. Maurer, Maurice Nivat:
Rational Bijection of Rational Sets.
365-378
- Susumu Morito, Harvey M. Salkin:
Using the Blankinship Algorithm to Find the General Solution of a Linear Diophantine Equation.
379-382
- Bernhard Mescheder:
On the Number of Active-Operations Needed to Compute the Discrete Fourier Transform.
383-408
Last update Thu May 23 18:12:42 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
