Information Processing Letters, Volume 17

Volume 17, Number 1, 19 July 1983

• M. C. Er:
  Computing Sums of Order-k Fibonacci Numbers in Log Time. 1-5
  
• Michael Willett:
  Trapdoor Knapsacks Without Superincreasing Structure. 7-11
  
• Francesca Cesarini, Giovanni Soda:
  An Algorithm to Construct a Compact B-Tree in Case of Ordered Keys. 13-16
  
• Ronald C. Richards:
  Shape Distribution of Height-Balanced Trees. 17-20
  
• Henry Tirri:
  Simulation, Reduction and Preservation of Correctness Properties of Parallel Systems. 21-27
  
• Manfred Broy:
  Denotational Semantics of Communicating Processes Based on a Language for Applicative Multiprogramming. 29-35
  
• Robert Endre Tarjan:
  An Improved Algorithm for Hierarchical Clustering Using Strong Components. 37-41
  
• S. P. Rana:
  A Distributed Solution of the Distributed Termination Problem. 43-46
  
• M. Howard Williams:
  Is an Exit Statement Sufficient? 47-51
  
• Cornelius Croitoru, Emilian Suditu:
  Perfect Stables in Graphs. 53-56
  

Volume 17, Number 2, 24 August 1983

• Jerzy R. Nawrocki:
  Contiguous Segmentation with Limited Compacting. 57-62
  
• Michael J. Magazine:
  Optimality of Intuitive Checkpointing Policies. 63-66
  
• Man-tak Shing:
  Optimum Ordered Bi-Weighted Binary Trees. 67-70
  
• Jozef Vyskoc:
  A Note on the Power of Integer Division. 71-72
  
• Po Tong, Eugene L. Lawler:
  A Faster Algorithm for Finding Edge-Disjoint Branchings. 73-76
  
• Adi Shamir:
  Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems. 77-79
  
• Dan E. Willard:
  Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). 81-84
  
• Youichi Kobuchi:
  Stability of Desynchronized 0L Systems. 85-90
  
• Paul De Bra, Jan Paredaens:
  An Algorithm for Horizontal Decompositions. 91-95
  
• Alan A. Bertossi:
  Finding Hamiltonian Circuits in Proper Interval Graphs. 97-101
  
• Amir Schorr:
  Physical Parallel Devices are not Much Faster than Sequential Ones. 103-106
  

Volume 17, Number 3, 5 October 1983

• Johannes J. Martin:
  Precise Typing and Filters. 109-112
  
• Luis Fariñas del Cerro:
  Space as Time. 113-115
  
• Vladimir Lifschitz, Leon Pesotchinsky:
  A Note on the Complexity of a Partition Algorithm. 117-120
  
• Andrzej Ehrenfeucht, Grzegorz Rozenberg:
  On the Subword Complexity of m-Free D0L Languages. 121-124
  
• Sven Skyum:
  A Measure in Which Boolean Negation is Exponentially Powerful. 125-128
  
• Mark Weiser:
  Reconstructing Sequential Behavior from Parallel Behavior Projections. 129-135
  
• Takashi Yokomori, Aravind K. Joshi:
  Semi-Linearity, Parikh-Boundedness and Tree-Adjunct Languages. 137-143
  
• Gadiel Seroussi, Fai Ma:
  On the Arithmetic Complexity of Matrix Kronecker Powers. 145-148
  
• Christian Choffrut, Karel Culik II:
  Folding of the Plane and the Design of Systolic Arrays. 149-153
  
• Ali Mili:
  Verifying Programs by Induction on Their Data Structure: General Format and Applications. 155-160
  
• Piotr Wyrostek:
  On the 'Correct Prefix Property' in Precedence Parsers. 161-165, (Erratum: Information Processing Letters 19(2): 111 (1984))
  
• Zhi-Jie Zheng:
  The Duodirun Merging Algorithm: A New Fast Algorithm for Parallel Merging. 167-168
  
• M. Howard Williams:
  The Problem of Absolute Privacy. 169-171
  

Volume 17, Number 4, 8 November 1983

• W. F. Clocksin:
  Real-Time Functional Queue Operations Using the Logical Variable. 173-175
  
• John J. Bartholdi III, Loren K. Platzman:
  A Fast Heuristic Based on Spacefilling Curves for Minimum-Weight Matching in the Plane. 177-180
  
• Erkki Mäkinen:
  Boundedness Testing for Unambiguous Context-Free Grammars. 181-183
  
• Oded Shmueli:
  Dynamic Cycle Detection. 185-188
  
• S. Ramesh, S. L. Mehndiratta:
  The Liveness Property of On-the-Fly Garbage Collector - A Proof. 189-195
  
• Anil R. Gangolli, Steven L. Tanimoto:
  Two Pyramid Machine Algorithms for Sdge Detection in Noisy Binary Images. 197-202
  
• Norbert Blum:
  A Note on the `Parallel Computation Thesis'. 203-205
  
• Mikhail J. Atallah:
  A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons. 207-209
  
• Brian H. Mayoh:
  Models of Programs and Processes. 211-214
  
• Clemens Lautemann:
  BPP and the Polynomial Hierarchy. 215-217
  
• Leonidas J. Guibas, Jorge Stolfi:
  On Computing All North-East Nearest Neighbors in the L¹ Metric. 219-223
  
• Teruo Hikita:
  Listing and Counting Subtrees of Equal Size of a Binary Tree. 225-229
  

Volume 17, Number 5, 15 December 1983

• Jeffrey S. Rohl:
  A Faster Lexicographical N Queens Algorithm. 231-233
  
• Yao-Tin Yu, Mohamed G. Gouda:
  Unboundedness Detection for a Class of Communicating Finite-State Machines. 235-240
  
• Eugene W. Myers:
  An Applicative Random-Access Stack. 241-248
  
• Michael J. Fischer, Mike Paterson:
  Storage Requirements for Fair Scheduling. 249-250
  
• Seiichi Nishihara, Katsuo Ikeda:
  Address Calculation Algorithms for Ordered Sets of Combinations. 251-253
  
• David T. Barnard:
  Recursive Descent Parsing Using Implementation Languages Requiring Definition Before Use. 255-258
  
• Tetsuo Ida:
  Some FP Algebra with Currying Operation. 259-261
  
• Reiner Kolla:
  Where-Oblivious is not Sufficient. 263-268
  
• Yung H. Tsin, Francis Y. L. Chin:
  A General Program Scheme for Finding Bridges. 269-272
  
• Hitohisa Asai:
  A Consideration of a Practical Implementation for a New Convergence Division. 273-281
  

Last update Sat May 18 20:36:34 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page