Information Processing Letters, Volume 7

Volume 7, Number 1, January 1978

Wlodzimierz Dobosiewicz:
Sorting by Distributive Partitioning. 1-6
Danny Dolev, Eliahu Shamir:
Commutation Relations of Slices Characterize Some Synchronization Primitives. 7-9
Paolo M. Camerini:
The Min-Max Spanning Tree Problem and Some Extensions. 10-14
Andreas Karayiannis, George Loizou:
Cycle Detection in Critical Path Networks. 15-19
Shalom Tsur:
Analysis of Queuing Networks in Which Processes Exhibit Locality-Transition Behaviour. 20-23
Stefano Crespi-Reghizzi, Dino Mandrioli:
A Class of Grammar Generating Non-Counting Languages. 24-26
Motoaki Terashima, Eiichi Goto:
Genetic Order and Compactifying Garbage Collectors. 27-32
Karel Culik II:
The Decidability of v-Local Catenativity and of Other Properties of D0L Systems. 33-35
William E. Howden:
Lindenmayer Grammars and Symbolic Testing. 36-39
Daniel S. Hirschberg:
An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem. 40-41
Jan A. Bergstra:
What is an Abstract Datatype? 42-43
F. James Rohlf:
A Probabilistic Minimum Spanning Tree Algorithm. 44-48
Katsushi Inoue, Itsuo Takanami, Akira Nakamura:
A Note on Two-Dimensional Finite Automata. 49-52
Kenneth R. Anderson:
A Reevaluation of an Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set. 53-55
Jack Koplowitz, D. Jouppi:
A More Efficient Convex Hull Algorithm. 56-57
Dennis de Champeaux:
Substad: For Fast Substitution in LISP, with an Application on Unification. 58-62

Volume 7, Number 2, 1978

William F. McColl:
The Maximum Depth of Monotone Formulae. 65
Yahiko Kambayashi, Takaki Hayashi, Y. Tanaka, Shuzo Yajima:
A Linear Storage Space Algorithm for a Reference Structure Index. 66-71
A. S. Sethi, V. Rajaraman, P. S. Kenjale:
An Error-Correcting Coding Scheme for Alphanumeric Data. 72-77
Alexandre Brandwajn, Philippe Kruchten, Jean-Alain Hernandez:
ARCADE - A System for Research and Education in Computer Architecture. 78-85
Selim G. Akl:
Comments on: G. Manacher, An Application of Pattern Matching to a Problem in Geometrical Complexity. 86
Jon Louis Bentley, Michael Ian Shamos:
Divide and Conquer for Linear Expected Time. 87-91
Eero Peltola, Hannu Erkiö:
Insertion Merge Sorting. 92-99
Gheorghe Paun:
On the Generative Capacity of Simple Matrix Grammars of Finite Index. 100-102
Hanan Samet:
A Canonical Form Algorithm for Proving Equivalence of Conditional Forms. 103-106
Jan Paredaens:
On the Expressive Power of the Relational Algebra. 107-111
Maurelio Boari, Antonio Natali:
Multiple Access to a Tree in the Context of Readers and Writers Problem. 112-121
, Erratum: Information Processing Letters 7(4): 207 (1978)
B. F. Caviness, H. I. Epstein:
A Note on the Complexity of Algebraic Differentiation. 122-124
Grant A. Cheston:
A Correction to a Unilaterally Connected Components Algorithm. 125-

Volume 7, Number 3, April 1978

Selim G. Akl, Godfried T. Toussaint:
An Improved Algorithm to Check for Polygon Similarity. 127-128
, Addendum: Information Processing Letters 8(3): 157-158 (1979)
Sorin Istrail:
Tag Systems Generating Thue Irreducible Sequences. 129-131
Radha Krishan Arora, R. K. Subramanian:
An Optimal Demand Prepaging Algorithm. 132-136
Wilfred J. Hansen:
A Predecessor Algorithm for Ordered Lists. 137-138
Lloyd Allison:
Phrase Structures, Non-Determinism and Backtracking. 139-143
Gérard P. Huet:
An Algorithm to Generate the Basis of Solutions to Homogeneous Linear Diophantine Equations. 144-147
Franco P. Preparata, Dilip V. Sarwate:
An Improved Parallel Processor Bound in Fast Matrix Inversion. 148-150
Stefan Sokolowski:
A Method for Proving Programming Languages non Context-Free. 151-153
Norbert Illies:
A Counterexample to the Generalized Aanderaa-Rosenberg Conjecture. 154-155
Raymond R. Devillers, Peter E. Lauer:
A General Mechanism for Avoiding Starvation with Distributed Control. 156-158
Angelika Reiser:
A Linear Selection Algorithm for Sets of Elements with Weights. 159-162

Volume 7, Number 4, June 1978

Gaston H. Gonnet:
Notes on the Derivation of Asymptotic Expressions from Summations. 165-169
, Erratum: Information Processing Letters 8(1): 54 (1979)
Joost Engelfriet:
On Tree Transducers for Partial Functions. 170-172
Stanley M. Selkow:
New Bounds for the Clique Number of a Graph. 173-174
M. R. Garey, David S. Johnson, Franco P. Preparata, Robert Endre Tarjan:
Triangulating a Simple Polygon. 175-179
G. Schachtel:
A Noncommutative Algorithm for Multiplying 5*5 Matrices Using 103 Multiplications. 180-182
Gian Carlo Bongiovanni, Fabrizio Luccio:
On Cahit's Result on Graceful Permutations. 183-184
Richard J. Lipton, Raymond E. Miller:
A Batching Method for Coloring Planar Graphs. 185-188
D. T. Lee, Franco P. Preparata:
The All Nearest-Neighbor Problem for Convex Polygons. 189-192
Richard A. DeMillo, Richard J. Lipton:
A Probabilistic Remark on Algebraic Program Testing. 193-195
Jeffrey M. Jaffe:
Counting Productions in Context-Free Derivations. 196-200
Charles E. Hughes:
The Equivalence of Vector Addition Systems to a Subclass of Post Canonical Systems. 201-204
F. Warren Burton:
Comments on: Sorting by Distributive Partitioning. 205
Wlodzimierz Dobosiewicz:
Author's Reply to Warren Burton's Comments on Distributive Partitioning Sorting. 206

Volume 7, Number 5, August 1978

Keijo Ruohonen:
A Note on Language Equations Involving Morphisms. 209-212
Ivan Hal Sudborough:
A Note on Weak Operator Precedence Grammars. 213-218
Selim G. Akl, Godfried T. Toussaint:
A Fast Convex Hull Algorithm. 219-222
Ivan Bratko:
Proving Correctness of Strategies in the AL1 Assertional Language. 223-230
Mark R. Brown:
A Storage Scheme for Height-Balanced Trees. 231-232
, Addendum: Information Processing Letters 8(3): 154-156 (1979)
Radha Krishan Arora, R. K. Subramanian:
Exploiting the Optimal Paging Algorithms. 233-236
Kohei Noshita, Etsuo Masuda, Hajime Machida:
On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs. 237-243
Ludwik Czaja:
Implementation Approach to Parallel Systems. 244-249

Volume 7, Number 6, October 1978

T. H. Merrett:
QT Logic: Simpler and More Expressive Than Predicate Calculus. 251-255
V. M. Glushkov, G. E. Tseytlin, E. L. Yushchenko:
Certain Problems of the Theory of Structured Program Schemes. 256-260
K. S. Natarajan, Lee J. White:
Optimum Domination in Weighted Trees. 261-265
János Demetrovics:
On the Number of Candidate Keys. 266-269
Miklós Ajtai, János Komlós, Endre Szemerédi:
There is no Fast Single Hashing Algorithm. 270-273
M. R. Garey, Robert Endre Tarjan:
A Linear-Time Algorithm for Finding All Feedback Vertices. 274-276
Vishv M. Malhotra, M. Pramodh Kumar, S. N. Maheshwari:
An O(|V|³) Algorithm for Finding Maximum Flows in Networks. 277-278
Robert Giegerich, Reinhard Wilhelm:
Counter-One-Pass Features in One-Pass Compilation: A Formalization Using Attribute Grammars. 279-284
Gideon Yuval:
A Simple Proof of Strassen's Result. 285-286
, Corrigendum: Information Processing Letters 8(5): 278 (1979)
Emily P. Friedman, Sheila A. Greibach:
On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages. 287-290
Ludwik Czaja:
Parallel Implementation of Path Expressions. 291-295
A. Bykat:
Convex Hull of a Finite Set of Points in Two Dimensions. 296-298
Joseph Shortt:
An Iterative Program to Calculate Fibonacci Numbers in O(log n) Arithmetic Operations. 299-303
Matti Jakobsson:
Huffman Coding in Bit-Vector Compression. 304-307
Jukka Teuhola:
A Compression Method for Clustered Bit-Vectors. 308-311
Douglas W. Clark, C. Cordell Green:
A Note on Shared List Structure in LISP. 312-314

Last update Tue Feb 14 04:19:33 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page