- Doug Lea:
Digital and Hilbert k-d Trees. Inf. Process. Lett. 27(1): 35-41 (1988) - Jacek Leszczylowski, Staffan Bonnier, Jan Maluszynski:
Logic Programming with External Procedures: Introducing S-Unification. Inf. Process. Lett. 27(3): 159-165 (1988) - Ming Li:
A Separator Theorem for One-Dimensional Graphs Under Linear Mapping. Inf. Process. Lett. 27(1): 9-11 (1988) - Robin Liu, Simeon C. Ntafos:
On Decomposing Polygons into Uniformly Monotone Parts. Inf. Process. Lett. 27(2): 85-89 (1988) - Aldo de Luca, Stefano Varricchio:
On the Factors of the Thue-Morse Word on Three Symbols. Inf. Process. Lett. 27(6): 281-285 (1988) - Gordon Lyon:
A Tagless Marking That is Linear Over Subtrees. Inf. Process. Lett. 27(1): 23-28 (1988) - Jirí Matousek:
Line Arrangements and Range Search. Inf. Process. Lett. 27(6): 275-280 (1988) - Kurt Mehlhorn:
A Faster Approximation Algorithm for the Steiner Problem in Graphs. Inf. Process. Lett. 27(3): 125-128 (1988) - Satoru Miyano:
A Parallelizable Lexicographically First Maximal Edge-Induced Subgraph Problem. Inf. Process. Lett. 27(2): 75-78 (1988) - Ewa Orlowska:
Proof System for Weakest Prespecification. Inf. Process. Lett. 27(6): 309-313 (1988) - Nicholas J. Patterson, Kenneth J. Supowit:
Finding the Vertices Nearest to a Point in a Hypercube. Inf. Process. Lett. 27(2): 99-102 (1988) - G. Ramalingam, C. Pandu Rangan:
Total Domination in Interval Graphs Revisited. Inf. Process. Lett. 27(1): 17-21 (1988) - G. Ramalingam, C. Pandu Rangan:
A Unified Approach to Domination Problems on Interval Graphs. Inf. Process. Lett. 27(5): 271-274 (1988) - K. V. S. Ramarao, Robert Daley, Rami G. Melhem:
Message Complexity of the Set Intersection Problem. Inf. Process. Lett. 27(4): 169-174 (1988) - Hans Rohnert:
Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons. Inf. Process. Lett. 27(4): 175-179 (1988) - Ravi S. Sandhu:
Cryptographic Implementation of a Tree Hierarchy for Access Control. Inf. Process. Lett. 27(2): 95-98 (1988) - Carla D. Savage:
Recognizing Majority on a One-Way Mesh. Inf. Process. Lett. 27(5): 221-225 (1988) - Mukesh Singhal, Yelena Yesha:
A Polynomial Algorithm for Computation of the Probability of Conflicts in a Database Under Arbitrary Data Access Distribution. Inf. Process. Lett. 27(2): 69-74 (1988) - M. A. Sridhar:
On the Connectivity of the De Bruijn Graph. Inf. Process. Lett. 27(6): 315-318 (1988) - Andrzej Szepietowski:
Remarks on Languages Acceptable in log n Space. Inf. Process. Lett. 27(4): 201-203 (1988) - Yung H. Tsin:
On Handling Vertex Deletion in Updating Spanning Trees. Inf. Process. Lett. 27(4): 167-168 (1988) - Osamu Watanabe:
On Hardness of One-Way Functions. Inf. Process. Lett. 27(3): 151-157 (1988) - Bob P. Weems:
A Study of Page Arrangements for Extendible Hashing. Inf. Process. Lett. 27(5): 245-248 (1988) - Jacek Witaszek:
A Practical Method for Finding the Optimum Postponement Transformation for LR(k) Parsers. Inf. Process. Lett. 27(2): 63-67 (1988)