Information Processing Letters, Volume 30
Volume 30, Number 1, January 1989
- Jeffrey S. Salowe: L-Infinity Interdistance Selection by Parametric Search. 9-14
- Peter Roth: A Note on Word Chains and Regular Languages. 15-18
- Philippe Darondeau: Bisimulation and Effectiveness. 19-20
- Ravi S. Sandhu: The Reflected Tree Hierarchy for Protection and Sharing. 21-26
- Andrzej Lingas, Marek Karpinski: Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching. 27-32
- P. P. Chakrabarti, Sujoy Ghose, A. Pandey, S. C. De Sarkar: Increasing Search Efficiency Using Multiple Heuristics. 33-36
- György Turán: Lower Bounds for Synchronous Circuits and Planar Circuits. 37-40
- Zvi Galil, Victor Y. Pan: Parallel Evaluation of the Determinant and of the Inverse of a Matrix. 41-45
- Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi: There are no p-Complete Families of Symmetric Boolean Functions. 47-49
- Eric C. R. Hehner: Real-Time Programming. 51-56
Volume 30, Number 2, January 1989
- Rudolf Fleischer: Communication Complexity of Multi-Processor Systems. 57-65
- Wing Shing Wong, Robert J. T. Morris: A New Approach to Choosing Initial Points in Local Search. 67-72
- June H. Kim, Kyu Ho Park, Myunghwan Kim: A Model of Distributed Control: Dependency and Uncertainty. 73-77
- Ron Shonkwiler: An Image Algorithm for Computing the Hausdorff Distance Efficiently in Linear Time. 87-89
- Milena Mihail: On Coupling and the Approximation of the Permanent. 91-95
- Peter van Emde Boas: Space Measures for Storage Modification Machines. 103-110
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
- Matti O. Jokinen: Customizable Garbage Collectors. 115-118
- J. Scott Provan: Shortest Enclosing Walks and Cycles in Embedded Graphs. 119-125
- Ornan Ori Gerstel, Yishay Mansour, Shmuel Zaks: Bit Complexity of Order Statistics on a Distributed Star Network. 127-132
- Udo Kelter: The Pitfall Paradox and its Solution with Virtual Objects. 139-143
- Jørgen Staunstrup, Jürg Nievergelt: The Behavior of Shared Objects: Concepts, Pitfalls, and a New Model. 145-151
- Karel Culik II: Variations of the Firing Squad Problem and Applications. 153-157
- E. M. Ehlers, Sebastiaan H. von Solms: Using Random Context Structure Grammars to Represent Chemical Structures. 159-166
Volume 30, Number 4, February 1989
- Christian Lavault: Average Number of Messages for Distributed Leader-Finding in Rings of Processors. 167-176
- Houssine Chetto, Maryline Silly-Chetto: Scheduling Periodic and Sporadic Tasks in a Real-Time System. 177-184
- James Wogulis: Self-Adjusting and Split Sequence Hash Tables. 185-188
- Kerry Raymond: A Distributed Algorithm for Multiple Entries to a Critical Section. 189-193
- Friedemann Mattern: Global Quiescence Detection Based on Credit Distribution and Recovery. 195-200
- Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman: A Generalized Model for Understanding Evasiveness. 205-208
- J. M. Robson: Separating Strings with Small Automata. 209-214
- Joseph C. Culberson, Piotr Rudnicki: A Fast Algorithm for Constructing Trees from Distance Matrices. 215-220
Volume 30, Number 5, March 1989
- K. Vidyasankar: An Elegant 1-Writer Multireader Multivalued Atomic Register. 221-223
- Wojciech Rytter, Tomasz Szymacha: Parallel Algorithms for a Class of Graphs Generated Recursively. 225-231
- Ludek Kucera: Graphs with Small Chromatic Numbers are Easy to Color. 233-236
- Hock T. Ch'ng, B. Sprinivasan, Beng Chin Ooi: Study of Self-Organizing Heuristics for Skewed Access Patterns. 237-244
- G. Song, D. Park, D. Lee, K. H. Park, M. Kim: A Distributed Deadlock Detection Algorithm: Distributed Graph Reconstruction Algorithm. 245-252
- Moshe Y. Vardi: A Note on the Reduction of Two-Way Automata to One-Way Automata. 261-264
- Edward Omiecinski, Eileen Tien Lin: A Hash-Based Join Algorithm for a Cube-Connected Parallel Computer. 269-275
Volume 30, Number 6, March 1989
- Aldo de Luca, Stefano Varricchio: Factorial Languages Whose Growth Function is Quadratically Upper Bounded. 283-288
- Carsten Vogt: A New Approach to Optimal Cache Scheduling. 303-310
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team