Information Processing Letters, Vol. 5

Volume 5, Number 1, May 1976

• B. K. Gairola, V. Rajaraman:
  A Distributed Index Sequential Access Method. 1-5
  
• Glenn K. Manacher:
  An Application of Pattern Matching to a Problem in Geometrical Complexity. 6-7
  
• Eshrat Arjomandi:
  On Finding All Unilaterally Connected Components of a Digraph. 8-10
  
• Hermann A. Maurer, Thomas Ottmann, Hans-Werner Six:
  Implementing Dictionaries Using Binary Trees of Very Small Height. 11-14
  
• Laurent Hyafil, Ronald L. Rivest:
  Constructing Optimal Binary Decision Trees is NP-Complete. 15-17
  
• Amnon Barak:
  On the Parallel Evaluation of Division-Free Arithmetic Expressions with Fan-In of Three. 18-19
  
• Leslie G. Valiant:
  Relative Complexity of Checking and Evaluating. 20-23
  
• Patrick Shen-Pei Wang, William I. Grosky:
  Recursiveness of Monotonic Array Grammars and a Hierarchy of Array Languages. 24-26
  , Erratum: Inf. Process. Lett. 5(3): 90(1976)

Volume 5, Number 2, June 1976

• George Marsaglia, K. Ananthanarayanan, N. J. Paul:
  Improvements on Fast Methods for Generating Normal Random Variables. 27-30
  
• Masataka Sassa, Eiichi Goto:
  A Hashing Method for Fast Set Operations. 31-34
  
• Carlos José Pereira de Lucena, Donald D. Cowan:
  Toward a System's Environment for Computer Assisted Programming. 35-40
  
• Niel K. Madsen, Garry H. Rodrigue, Jack I. Karush:
  Matrix Multiplication by Diagonals on a Vector/Parallel Processor. 41-45
  
• Robert L. Probert:
  Commutativity, Non-Commutativity, and Bilinearity. 46-49
  
• Pierre Hansen:
  A Cascade Algorithm for the Logical Closure of a Set of Binary Relations. 50-54
  , Erratum: Inf. Process. Lett. 5(4): 124(1976)
• Sukhamay Kundu:
  A Linear Algorithm for the Hamiltonian Completion Number of a Tree. 55-57
  
• Dino Mandrioli:
  n-Reconstructability of Context-Free Grammars. 58-62
  

Volume 5, Number 3, August 1976

• Gideon Yuval:
  Finding Nearest Neighbors. 63-65
  
• Eugene L. Lawler:
  A Note on the Complexity of the Chromatic Number Problem. 66-67
  
• Fabrizio Luccio, Franco P. Preparata:
  Storage for Consecutive Retrieval. 68-71
  
• Nicola Santoro:
  Full Table Search by Polynomial Functions. 72-74
  
• Derek A. Zave:
  A Series Expansion Involving the Harmonic Numbers. 75-77
  
• Eliezer L. Lozinskii:
  On a Problem in Storage Optimization. 78-80
  
• R. K. Shyamasundar:
  A Note on Linear Precedence Functions. 81
  
• Jon Louis Bentley, Andrew Chi-Chih Yao:
  An Almost Optimal Algorithm for Unbounded Searching. 82-87
  
• Kishor S. Trivedi:
  On a Semaphore Anomaly. 88-89
  
• Patrick Shen-Pei Wang, William I. Grosky: Erratum: Recursiveness of Monotonic Array Grammars and a Hierarchy of Array Languages. 90 , ->Inf. Process. Lett. 5(1): 24-26(1976)

Volume 5, Number 4, October 1976

• Donald R. Innes, Shalom Tsur:
  Interval Analysis, Pagination and Program Locality. 91-96
  
• Lambert G. L. T. Meertens:
  A Space-Saving Technique for Assigning Algol 68 Multiple Values. 97-99
  
• Clement T. Yu, D. T. Johnson:
  On the Complexity of Finding the Set of Candidate Keys for a Given Set of Functional Dependencies. 100-101
  
• Grzegorz Rozenberg:
  More on ET0L Systems versus Random Context Grammars. 102-106
  
• Behrokh Samadi:
  B-Trees in a System with Multiple Users. 107-112
  
• Harold N. Gabow:
  Some Improved Bounds on the Number of 1-Factors of n-Connected Graphs. 113-115
  
• Gregor von Bochmann:
  Comments on Monitor Definition and Implementation. 116-117
  
• Maurelio Boari, Antonio Natali:
  Some Properties of Deadlock Detection and Recovery in Readers and Writers Problems. 118-123
  
• Pierre Hansen: Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations. 124 , ->Inf. Process. Lett. 5(2): 50-54(1976)

Volume 5, Number 5, November 1976

• K. Delcour, A. J. W. Duijvestein:
  Enclosures: An Access Control Mechanism with Applications in Parallel Programming and Other Areas of System Programming. 125-135
  
• Michael A. Hennell, Martin R. Woodward, David Hedley:
  On Program Analysis. 136-140
  
• Giovanni Guida, Marco Somalvico:
  Semantics in Problem Representation and Search. 141-145
  
• Jon Doyle, Ronald L. Rivest:
  Linear Expected Time of a Simple Union-Find Algorithm. 146-148
  
• Matti Linna:
  The D0L-ness for Context-Free Languages is Decidable. 149-151
  
• Jürgen Duske, Rainer Parchmann, H. Schumacher:
  A Pattern Representation of Indexed Languages. 152-154
  

Volume 5, Number 6, December 1976

• Daniel P. Friedman, David S. Wise:
  Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures. 155-160
  , Erratum: Information Processing Letter 9(2):101 (1979)
• Daniel P. Friedman, David S. Wise:
  Garbage Collecting a Heap Which Includes a Scatter Table. 161-164
  , Erratum: IPL 6(2): 72 (1977)
• Harold N. Gabow:
  A Note on Degree-Constrained Star Subgraphs of Bipartite Graphs. 165-167
  
• Kurt Mehlhorn:
  Bracket-Languages are Recognizable in Logarithmic Space. 168-170
  
• R. Kaye:
  A Gray Code for Set Partitions. 171-173
  
• Helmuth Partsch, Peter Pepper:
  A Family of Rules for Recursion Removal. 174-177
  

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