Information Processing Letters, Volume 53

Volume 53, Number 1, 13 January 1995

• Sanjay Jain:
  On a Question About Learning Nearly Minimal Programs. 1-4
  
• Martin Fränzle, Bernhard von Stengel, Arne Wittmüss:
  A Generalized Notion of Semantic Independence. 5-9
  
• Angelo Monti, Alessandro Roncato:
  Completeness Results Concerning Systolic Tree Automata and EOL Languages. 11-16
  
• Ran Canetti, Guy Even, Oded Goldreich:
  Lower Bounds for Sampling Algorithms for Estimating the Average. 17-25
  
• Andrea E. F. Clementi, Russell Impagliazzo:
  The Reachability Problem for Finite Cellular Automata. 27-31
  
• Priyalal Kulasinghe, Saïd Bettayeb:
  Multiply-Twisted Hypercube with Five or More Dimensions is not Vertex-Transitive. 33-36
  
• Charu C. Aggarwal, N. Jain, P. Gupta:
  An Efficient Selection Algorithm on the Pyramid. 37-47
  
• Yuliang Zheng:
  On Key Agreement Protocols Based on Tamper-Proof Hardware. 49-54
  
• Yung-Cheng Chang, Lih-Hsing Hsu:
  Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives. 55-59
  

Volume 53, Number 2, 27 January 1995

• Alexander Russell, Ravi Sundaram:
  The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE. 61-68
  
• S. T. Fischer:
  A Note on the Complexity of Local Search Problems. 69-75
  
• Kaoru Kurosawa, Koji Okada, Shigeo Tsujii:
  Low Exponent Attack Against Elliptic Curve RSA. 77-83
  
• Chuan-Heng Ang, Kok-Phuang Tan:
  The Interval B-Tree. 85-89
  
• Chae Hoon Lim, Pil Joong Lee:
  Several Practical Protocols for Authentication and Key Exchange. 91-96
• Tzonelih Hwang, Yung-Hsiang Chen:
  On the Security of SPLICE/AS - The Authentication System in WIDE Internet. 91-101
  
• Tzonelih Hwang, Narn-Yih Lee, Chuan-Ming Li, Ming-Yung Ko, Yung-Hsiang Chen:
  Two Attacks on Neuman-Stubblebine Authentication Protocols. 103-107
  
• Refael Hassin, Arie Tamir:
  On the Minimum Diameter Spanning Tree Problem. 109-111
  
• Ouri Wolfson, Sushil Jajodia:
  An Algorithm for Dynamic Data Allocation in Distributed Systems. 113-119
  

Volume 53, Number 3, 10 February 1995

• Burghard von Karger, C. A. R. Hoare:
  Sequential Calculus. 123-130
  
• Chritiene Aarts, Roland Carl Backhouse, Eerke A. Boiten, Henk Doornbos, Netty van Gasteren, Rik van Geldrop, Paul F. Hoogendijk, Ed Voermans, Jaap van der Woude:
  Fixed-Point Calculus. 131-136
  
• The Eindhoven Tuesday Afternoon Club:
  Constructing the Galois Adjoint. 137-139
  
• Edsger W. Dijkstra:
  Heuristics for a Calculational Proof. 141-143
  
• David Gries, Fred B. Schneider:
  Equational Propositional Logic. 145-152
  
• Jacob Kornerup:
  Mapping a Functional Notation for Parallel Programs Onto Hypercubes. 153-158
  
• K. Rustan M. Leino:
  Constructing a Program with Exceptions. 159-163
  
• Ralph-Johan Back, Joakim von Wright:
  Games and Winning Strategies. 165-172
  

Volume 53, Number 4, 24 February 1995

• Ashok Subramanian:
  A Polynomial Bound on the Number of Light Cycles in an Undirected Graph. 173-176
  
• Ralph P. Boland, Jorge Urrutia:
  Separating Collections of Points in Euclidean Spaces. 177-183
  , Corrigendum: Inf. Process. Lett. 54(6): 359(1995)
• Hsieh-Chang Tu, Carl H. Smith:
  Training Digraphs. 185-192
  
• Rajiv Gupta:
  Generalized Dominators. 193-200
  
• Roberto De Prisco, Giuseppe Persiano:
  Characteristic Inequalities for Binary Trees. 201-207
  
• Gregory Kucherov, Michaël Rusinowitch:
  Undecidability of Ground Reducibility for Word Rewriting Systems with Variables. 209-215
  
• Jirí Matousek:
  On Enclosing k Points by a Circle. 217-221
  
• Enno Ohlebusch:
  Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems. 223-228
  
• Aristidis Likas, Andreas Stafylopatis:
  A Parallel Algorithm for the Minimum Weighted Vertex Cover Problem. 229-234
  
• Mikael Rittri:
  Corrigendum: Semi-Unification of Two Terms in Abelian Groups. 235
  , ->Inf. Process. Lett. 52(2): 61-68(1994)

Volume 53, Number 5, 10 March 1995

• Friedrich Otto:
  Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General. 237-242
  
• Chi-Sung Laih, Fu-Kuan Tu, Wen-Chung Tai:
  On the Security of the Lucas Function. 243-247
  
• Robert I. Davis, Alan Burns:
  Optimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-Emptive Systems. 249-254
  
• Marie-Claude Heydemann, Dominique Sotteau:
  A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs. 255-259
  
• Valmir C. Barbosa, Stella C. S. Porto:
  An Algorithm for FIFO Message Delivery Among Migrating Tasks. 261-267
  
• Takehiro Tokuda, Yoshimichi Watanabe:
  An Efficient Semantic Evaluator for Warped LC(1) Attributed Grammars. 269-276
  
• Mounir Hamdi:
  Topological Properties of the Directional Hypercube. 277-286
  
• Paulo A. S. Veloso, T. S. E. Maibaum:
  On the Modularization Theorem for Logical Specifications. 287-293
  
• William L. Steiger, Ileana Streinu:
  A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. 295-299
  

Volume 53, Number 6, 24 March 1995

• Myra Spiliopoulou, Yannis Cotronis, Michael Hatzopoulos:
  Query Processing for Multimedia Applications on Optical Media. 301-306
  
• John H. R. May, A. D. Lunn:
  New Statistics for Demand-Based Software Testing. 307-314
  
• Ioan I. Macarie:
  Decreasing the Bandwidth of a Transition Matrix. 315-320
  
• Mikael Goldmann:
  A Note on the Power of Majority Gates and Modular Gates. 321-327
  
• Rutger M. Dijkstra:
  An Experiment With the Use of Predicate Transformers in UNITY. 329-332
  
• Madan Natu, Shu-Cherng Fang:
  On the Point-to-Point Connection Problem. 333-336
  
• Martin Otto:
  An Note on the Number of Monadic Quantifiers in Monadic Sigma^1_1. 337-339
  
• Antti Valmari:
  The Weakest Deadlock-Preserving Congruence. 341-346
  
• Luke O'Connor:
  A New Lower Bound on the Expected Size of Irredundant Forms for Boolean Functions. 347-353
  
• Ran El-Yaniv, Jon M. Kleinberg:
  Geometric Two-Server Algorithms. 355-358
  
• Sung-Ho Kim, Jung-Heum Park, Seung-Hak Choi, Sung Yong Shin, Kyung-Yong Chwa:
  An Optimal Algorithm for Finding the Edge Visibility Polygon under Limited Visibility. 359-365