Information Processing Letters, Volume 64

Volume 64, Number 1, 14 October 1997

• Elisa Bertino, Barbara Catania, Boris Shidlovsky:
  Towards Optimal Two-Dimensional Indexing for Constraint Databases. 1-8
  
• Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi:
  Billiard Quorums on the Grid. 9-16
  
• E. Belogay, Carlos Cabrelli, Ursula Molter, Ron Shonkwiler:
  Calculating the Hausdorff Distance Between Curves. 17-22
  
• Hung-Yi Chang, Rong-Jaye Chen:
  Embedding Cycles in IEH Graphs. 23-27
  
• Sandeep S. Kulkarni, Anish Arora:
  Multitolerant Barrier Synchronization. 29-36
  
• Jovan Dj. Golic, Mahmoud Salmasizadeh, Leone Simpson, Ed Dawson:
  Fast Correlation Attacks on Nonlinear Filter Generators. 37-42
  
• Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton, Ion Stoica, Hussein M. Abdel-Wahab, Kevin Jeffay:
  Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource. 43-51
  

Volume 64, Number 2, 28 October 1997

• André Arnold, M. Kanta, Daniel Krob:
  Recognizable Subsets of the Two Letter Plactic Monoid. 53-59
  
• Edward G. Coffman Jr., Leopold Flatto, Edgar N. Gilbert, Albert G. Greenberg:
  An Approximate Model of Processor Communication Rings Under Heavy Load. 61-67
  
• Mikhail Y. Kovalyov, Yakov M. Shafransky:
  Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case. 69-74
  
• Gyung-Ok Lee, Do-Hyung Kim:
  Characterization of Extended LR(k) Grammars. 75-82
  
• Laurent Coupry:
  A Simple Linear Algorithm for the Edge-Disjoint (s, t)-Paths Problem in Undirected Planar Graphs. 83-86
  
• Injong Rhee, Jennifer L. Welch:
  Time Bounds on Synchronization in a Periodic Distributed System. 87-93
  
• Ye-In Chang, Bi-Yen Yang:
  Efficient Access Methods for Image Databases. 95-105
  

Volume 64, Number 3, 14 November 1997

• Frank K. H. A. Dehne, Katia S. Guimarães:
  Exact and Approximate Computational Geometry Solutions of an Unrestricted Point Set Stereo Matching Problem. 107-114
  
• Eric Aaron, David Gries:
  Formal Justification of Underspecification for S5. 115-121
  
• Marianne Flouret, Éric Laugerotte:
  Noncommutative Minimization Algorithms. 123-126
  
• Luca Aceto, Anna Ingólfsdóttir:
  A Characterization of Finitary Bisimulation. 127-134
  
• Wai Yin Mok, David W. Embley:
  On Improving Dependency Implication Algorithms. 135-141
  
• Min-Sheng Lin, Deng-Jyi Chen:
  The Computational Complexity of the Reliability Problem on Distributed Systems. 143-147
  
• Enrico Nardelli, Vincenzo Mastrobuoni, Alesiano Santomo:
  Computing a Poset from its Realizer. 149-154
  
• Susanne Albers, Michael Mitzenmacher:
  Revisiting the Counter Algorithms for List Update. 155-160
  

Volume 64, Number 4, 28 November 1997

• Stephen Alstrup, Jens P. Secher, Maz Spork:
  Optimal On-Line Decremental Connectivity in Trees. 161-164
  
• Marco Cesati, Luca Trevisan:
  On the Efficiency of Polynomial Time Approximation Schemes. 165-171
  
• Santosh N. Kabadi, Yash P. Aneja:
  An Efficient, Strongly Polynomial, epsilon-Approximation Schemes. 173-177
  
• Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe:
  Partial Occam's Razor and its Applications. 179-185
  
• Jerzy Tyszkiewicz:
  A Note on the Kolmogorov Data Complexity and Nonuniform Logical Definitions. 187-195
  
• Abbas Edalat, David W. N. Sharp, R. Lyndon While:
  Bounding the Attractor of an IFS. 197-202
  
• Anindo Bagchi:
  Route Selection with Multiple Metrics. 203-205
  
• Silvano Di Zenzo, Paolo Bottoni, Piero Mussio:
  A Notion of Information Related to Computation. 207-215
  

Volume 64, Number 5, 15 December 1997

• Edward M. Reingold, Kenneth J. Urban, David Gries:
  K-M-P String Matching Revisited. 217-223
  
• Kouchi Hirata:
  Constructing Simply Recursive Programs from a Finite Set of Good Examples. 225-230
  
• Paulo A. S. Veloso, Sheila R. M. Veloso:
  On Methods for Safe Introduction of Operations. 231-238
  
• Muhammad Rabi, Alan T. Sherman:
  An Observation on Associative One-Way Functions in Complexity Theory. 239-244
  
• Izabela Wierzbowska:
  Checker for Data Structures which Sort Elements. 245-249
  
• Petr Slavík:
  Improved Performance of the Greedy Algorithm for Partial Cover. 251-254
  
• Yang Dai, Kazuo Iwano, Naoki Katoh:
  A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems. 255-261
  
• Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
  A Technique for Adding Range Restrictions to Generalized Searching Problems. 263-269
  

Volume 64, Number 6, 29 December 1997

• Vikram Iyengar, Krishnendu Chakrabarty:
  An Efficient Finite-State Machine Implementation of Huffman Decoders. 271-275
  
• Victor Mitrana:
  Primitive Morphisms. 277-281
  
• Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann:
  A Remark on Matrix Rigidity. 283-285
  
• Thomas Graf, V. Kamakoti:
  Sparse Dominance Queries for Many Points in Optimal Time and Space. 287-291
  
• Gerhard J. Woeginger:
  There is no Asymptotic PTAS for Two-Dimensional Vector Packing. 293-297
  
• Paolo Boldi, Sebastiano Vigna:
  Minimal Sense of Direction and Decision Problems for Cayley Graphs. 299-303
  
• Laurent Alonso, Jean-Luc Remy, René Schott:
  Uniform Generation of a Schröder Tree. 305-308
  
• Alon Efrat, Otfried Schwarzkopf:
  Separating and Shattering Long Line Segments. 309-314
  
• Christian Queinnec:
  Fast and Compact Dispatching for Dynamic Object-Oriented Languages. 315-321