- Dick Grune:
How to Compare the Incomparable. Inf. Process. Lett. 24(3): 177-181 (1987) - Cyrus Hazari, Hussein Zedan:
A Distributed Algorithm for Distributed Termination. Inf. Process. Lett. 24(5): 293-297 (1987) - Daniel S. Hirschberg, Dennis J. Volper:
Improved Update/Query Algorithms for the Interval Valuation Problem. Inf. Process. Lett. 24(5): 307-310 (1987) - C. A. R. Hoare, Jifeng He:
The Weakest Prespecification. Inf. Process. Lett. 24(2): 127-132 (1987) - Peter H. Hochschild:
Multiple Cuts, Input Repetition, and VLSI Complexity. Inf. Process. Lett. 24(1): 19-24 (1987) - R. Nigel Horspool, Michael R. Levy:
Correctness of an Extended Operator-Precedence Parsing Algorithm. Inf. Process. Lett. 24(4): 265-273 (1987) - Dung T. Huynh:
On Solving Hard Problems by Polynomial-Size Circuits. Inf. Process. Lett. 24(3): 171-176 (1987) - Richard Kennaway, M. Ronan Sleep:
Variable Abstraction in O(n log n) Space. Inf. Process. Lett. 24(5): 343-349 (1987) - Taenam Kim, Kyung-Yong Chwa:
An O(n log n log log n) Parallel Maximum Matching Algorithm for Bipartite Graphs. Inf. Process. Lett. 24(1): 15-17 (1987) - Gregers Koch:
Automating the Semantic Component. Inf. Process. Lett. 24(5): 299-305 (1987) - Bogdan Korel:
The Program Dependence Graph in Static Program Testing. Inf. Process. Lett. 24(2): 103-108 (1987) - Mark W. Krentel:
A Note on the Transaction Backout Problem. Inf. Process. Lett. 24(3): 149-152 (1987) - Marek Kubale:
The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors. Inf. Process. Lett. 24(3): 141-147 (1987) - Stuart A. Kurtz, Michael J. O'Donnell, James S. Royer:
How to Prove Representation-Independent Independence Results. Inf. Process. Lett. 24(1): 5-10 (1987) - D. C. Van Leijenhorst:
A Note on the Formula Size of the "mod k" Functions. Inf. Process. Lett. 24(4): 223-224 (1987) - D. C. Van Leijenhorst, Theo P. van der Weide:
On a Recursion Connected with Tree Balancing Algorithms. Inf. Process. Lett. 24(3): 189-192 (1987) - Klaus Madlener, Friedrich Otto:
Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups. Inf. Process. Lett. 24(5): 281-284 (1987) - Raymond A. Marie, Kishor S. Trivedi:
A Note on the Effect of Preemptive Policies on the Stability of a Priority Queue. Inf. Process. Lett. 24(6): 397-401 (1987) - William F. McColl, Mike Paterson:
The Planar Realization of Boolean Functions. Inf. Process. Lett. 24(3): 165-170 (1987) - Silvio Romero de Lemos Meira:
Strict Combinators. Inf. Process. Lett. 24(4): 255-258 (1987) - Heinrich Müller:
Sorting Numbers Using Limited Systolic Coprocessors. Inf. Process. Lett. 24(6): 351-354 (1987) - Ian Parberry:
An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits. Inf. Process. Lett. 24(6): 363-367 (1987) - Shaunak Pawagi, P. S. Gopalakrishnan, I. V. Ramakrishnan:
Computing Dominators in Parallel. Inf. Process. Lett. 24(4): 217-221 (1987) - Leonard Pitt:
A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs. Inf. Process. Lett. 24(3): 203-206 (1987) - Prakash V. Ramanan:
Obtaining Lower Bounds Using Artificial Components. Inf. Process. Lett. 24(4): 243-246 (1987) - Michel Raynal:
A Distributed Algorithm to Prevent Mutual Drift Between n Logical Clocks. Inf. Process. Lett. 24(3): 199-202 (1987) - Claudio Rey, Rabab K. Ward:
On Determining the On-Line Minimax Linear Fit to a Discrete Point Set in the Plane. Inf. Process. Lett. 24(2): 97-101 (1987) - M. Roussille, Pierre Dufour:
Generation of Convex Polygons with Individual Angular Constraints. Inf. Process. Lett. 24(3): 159-164 (1987) - Jonathan Ruby:
A Liveness Property of a Parallel Algorithm. Inf. Process. Lett. 24(4): 275-277 (1987) - Hanan Samet, Clifford A. Shaffer, Robert E. Webber:
Digitizing the Plane with Cells of Nonuniform Size. Inf. Process. Lett. 24(6): 369-375 (1987)
