Information Processing Letters, Volume 30

Volume 30, Number 1, January 1989

• M. J. Foster, Ronald I. Greenberg: Lower Bounds on the Area of Finite-State Machines. 1-7 BibTeX
• Jeffrey S. Salowe: L-Infinity Interdistance Selection by Parametric Search. 9-14 BibTeX
• Peter Roth: A Note on Word Chains and Regular Languages. 15-18 BibTeX
• Philippe Darondeau: Bisimulation and Effectiveness. 19-20 BibTeX
• Ravi S. Sandhu: The Reflected Tree Hierarchy for Protection and Sharing. 21-26 BibTeX
• Andrzej Lingas, Marek Karpinski: Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching. 27-32 BibTeX
• P. P. Chakrabarti, Sujoy Ghose, A. Pandey, S. C. De Sarkar: Increasing Search Efficiency Using Multiple Heuristics. 33-36 BibTeX
• György Turán: Lower Bounds for Synchronous Circuits and Planar Circuits. 37-40 BibTeX
• Zvi Galil, Victor Y. Pan: Parallel Evaluation of the Determinant and of the Inverse of a Matrix. 41-45 BibTeX
• Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi: There are no p-Complete Families of Symmetric Boolean Functions. 47-49 BibTeX
• Eric C. R. Hehner: Real-Time Programming. 51-56 BibTeX

Volume 30, Number 2, January 1989

• Rudolf Fleischer: Communication Complexity of Multi-Processor Systems. 57-65 BibTeX
• Wing Shing Wong, Robert J. T. Morris: A New Approach to Choosing Initial Points in Local Search. 67-72 BibTeX
• June H. Kim, Kyu Ho Park, Myunghwan Kim: A Model of Distributed Control: Dependency and Uncertainty. 73-77 BibTeX
• Charles Consel, Olivier Danvy: Partial Evaluation of Pattern Matching in Strings. 79-86 BibTeX
• Ron Shonkwiler: An Image Algorithm for Computing the Hausdorff Distance Efficiently in Linear Time. 87-89 BibTeX
• Milena Mihail: On Coupling and the Approximation of the Permanent. 91-95 BibTeX
• Charles U. Martel, Dan Gusfield: A Fast Parallel Quicksort Algorithm. 97-102 BibTeX
• Peter van Emde Boas: Space Measures for Storage Modification Machines. 103-110 BibTeX

Volume 30, Number 3, February 1989

• Toshiya Itoh, Shigeo Tsujii: An Efficient Algorithm for Deciding Quadratic Residuosity in Finite Fields GF(p_m). 111-114 BibTeX
• Matti O. Jokinen: Customizable Garbage Collectors. 115-118 BibTeX
• J. Scott Provan: Shortest Enclosing Walks and Cycles in Embedded Graphs. 119-125 BibTeX
• Ornan Ori Gerstel, Yishay Mansour, Shmuel Zaks: Bit Complexity of Order Statistics on a Distributed Star Network. 127-132 BibTeX
• José D. P. Rolim, Sheila A. Greibach: A Note on the Best-Case Complexity. 133-138 BibTeX
• Udo Kelter: The Pitfall Paradox and its Solution with Virtual Objects. 139-143 BibTeX
• Jørgen Staunstrup, Jürg Nievergelt: The Behavior of Shared Objects: Concepts, Pitfalls, and a New Model. 145-151 BibTeX
• Karel Culik II: Variations of the Firing Squad Problem and Applications. 153-157 BibTeX
• E. M. Ehlers, Sebastiaan H. von Solms: Using Random Context Structure Grammars to Represent Chemical Structures. 159-166 BibTeX

Volume 30, Number 4, February 1989

• Christian Lavault: Average Number of Messages for Distributed Leader-Finding in Rings of Processors. 167-176 BibTeX
• Houssine Chetto, Maryline Silly-Chetto: Scheduling Periodic and Sporadic Tasks in a Real-Time System. 177-184 BibTeX
• James Wogulis: Self-Adjusting and Split Sequence Hash Tables. 185-188 BibTeX
• Kerry Raymond: A Distributed Algorithm for Multiple Entries to a Critical Section. 189-193 BibTeX
• Friedemann Mattern: Global Quiescence Detection Based on Credit Distribution and Recovery. 195-200 BibTeX
• Ronald E. Barkley, T. Paul Lee: Point Representation and Hashing of an Interval. 201-203 BibTeX
• Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman: A Generalized Model for Understanding Evasiveness. 205-208 BibTeX
• J. M. Robson: Separating Strings with Small Automata. 209-214 BibTeX
• Joseph C. Culberson, Piotr Rudnicki: A Fast Algorithm for Constructing Trees from Distance Matrices. 215-220 BibTeX

Volume 30, Number 5, March 1989

• K. Vidyasankar: An Elegant 1-Writer Multireader Multivalued Atomic Register. 221-223 BibTeX
• Wojciech Rytter, Tomasz Szymacha: Parallel Algorithms for a Class of Graphs Generated Recursively. 225-231 BibTeX
• Ludek Kucera: Graphs with Small Chromatic Numbers are Easy to Color. 233-236 BibTeX
• Hock T. Ch'ng, B. Sprinivasan, Beng Chin Ooi: Study of Self-Organizing Heuristics for Skewed Access Patterns. 237-244 BibTeX
• G. Song, D. Park, D. Lee, K. H. Park, M. Kim: A Distributed Deadlock Detection Algorithm: Distributed Graph Reconstruction Algorithm. 245-252 BibTeX
• Yechezkel Zalcstein, Max H. Garzon: An NC₂ Algorithm for Testing Similarity of Matrices. 253-254 BibTeX
• Dan Gusfield, Robert W. Irving: Parametric Stable Marriage and Minimum Cuts. 255-259 BibTeX
• Moshe Y. Vardi: A Note on the Reduction of Two-Way Automata to One-Way Automata. 261-264 BibTeX
• V. Raja, R. K. Ghosh, P. Gupta: An Efficient Parallel Algorithm for Random Sampling. 265-268 BibTeX
• Edward Omiecinski, Eileen Tien Lin: A Hash-Based Join Algorithm for a Cube-Connected Parallel Computer. 269-275 BibTeX

Volume 30, Number 6, March 1989

• J. L. Nazareth, K. A. Ariyawansa: On Accelerating Newton's Method Based on a Conic Model. 277-281 BibTeX
• Aldo de Luca, Stefano Varricchio: Factorial Languages Whose Growth Function is Quadratically Upper Bounded. 283-288 BibTeX
• G. Lindhorst, Farhad Shahrokhi: On Renaming a Set of Clauses as a Horn Set. 289-293 BibTeX
• Oscar H. Ibarra, Tao Jiang: Optimal Simulation of Tree Arrays by Linear Arrays. 295-302 BibTeX
• Carsten Vogt: A New Approach to Optimal Cache Scheduling. 303-310 BibTeX