Volume 8,
Number 1,
2 January 1979
Volume 8,
Number 2,
15 February 1979
Volume 8,
Number 3,
15 March 1979
Volume 8,
Number 4,
30 April 1979
- Maurizio A. Bonuccelli, Daniel P. Bovet:
Minimum Node Disjoint Path Covering for Circular-Arc Graphs.
159-161
- Ludwik Czaja:
A Specification of Parallel Problems.
162-167
- Martin Huits, Vipin Kumar:
The Practical Significance of Distributive Partitioning Sort.
168-169
- Wlodzimierz Dobosiewicz:
The Practical Significance of d.p.Sort Revisited.
170-172
- Alain Fournier:
Comments on Convex Hull of a Finite Set of Points in Two Dimensions.
173
- Hirosi Hitotumatu, Kohei Noshita:
A Technique for Implementing Backtrack Algorithms and its Application.
174-175
- J. Henno:
The Depth of Monotone Functions in Multivalued Logic.
176-177
- Ronald L. Rivest, Jean-Paul Van de Wiele:
An Omega(n/lg n)1/2 Lower Bound on the Number of Additions Necessary to Compute 0-1 Polynomials over the Ring of Integer Polynomials.
178-180
- Karel Culik II, Hermann A. Maurer:
Secure Information Storage and Retrieval Using New Results in Cryptography.
181-186
- Esko Ukkonen:
The Nonexistence of Some Covering Context-Free Grammars.
187-192
- C. C. Yang, D. T. Lee:
A Note on the all Nearest-Neighbor Problem for Convex Polygons.
193-194
- David Harel:
Two Results on Process Logic.
195-198 ,
Erratum:
Information Processing Letters 9(3):
160 (1979)
- Ján Plesník:
The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two.
199-201
- P. S. Pankov, S. L. Dolmatov:
Substantiable Evaluations by Electronic Computers and Their Application to one Problem in Combinatorial Geometry.
202-203
- Felix J. Fridman, Glenn H. Holloway, Naftaly H. Minsky, Josef Stein:
Abstract FOR-Loops Over Several Aggregates.
204-206
- Jörg Mühlbacher:
F-Factors of Graphs: A Generalized Matching Problem.
207-214
- Harold Abelson:
A Note on Time-Space Tradeoffs for Computing Continuous Functions.
215-217
Volume 8,
Number 5,
11 June 1979
- Ysmar V. Silva Filho:
Average Case Analysis of Region Search in Balanced k-d Trees.
219-223
- Manfred Broy, Martin Wirsing, Jean-Pierre Finance, Alain Quéré, Jean-Luc Remy:
Methodical Solution of the Problem of Ascending Subsequences of Maximum Length Within a Given Sequence.
224-229
- Timo Leipälä:
On a Generalization of Binary Search.
230-233
- Dario Bini, Milvio Capovani, Francesco Romani, Grazia Lotti:
O(n2.7799) Complexity for n*n Approximate Matrix Multiplication.
234-235
- Yossi Shiloach:
A Fast Equivalence-Checking Algorithm for Circular Lists.
236-238
- Wolfgang Reisig:
A Note on the Representation of Finite Tree Automata.
239-240
- D. van der Knijff, Jean-Louis Lassez:
A Clarification of the Comparison Between Some Measures of Software Science.
241-243
- Jon Louis Bentley:
Decomposable Searching Problems.
244-251
- George Loizou:
Mathematical Solution for a Data Processing System.
252-256
- Keijo Ruohonen:
The Decidability of the F0L-D0L Equivalence Problem.
257-260
- Charles N. Fischer, K. C. Tai, D. R. Milton:
Immediate Error Detection in Strong LL(1) Parsers.
261-266
- Eitan M. Gurari, Oscar H. Ibarra:
On the Space Complexity of Recursive Algorithms.
267-271
- Arnold L. Rosenberg:
A Note on Paths Embedded in Trees.
272-273
- Neelam Soundararajan:
Axiomatic Proofs of Fotal Correctness of Programs.
274-277
Copyright © Mon Nov 30 20:28:13 2009
by Michael Ley (ley@uni-trier.de)
