- Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci:
Analysis of Parallel Uniform Hashing. Inf. Process. Lett. 37(2): 67-69 (1991) - Sabri A. Mahmoud:
Motion Estimation Based on Modified Fourier Spectrum. Inf. Process. Lett. 37(6): 311-313 (1991) - Udi Manber, Ricardo A. Baeza-Yates:
An Algorithm for String Matching with a Sequence of don't Cares. Inf. Process. Lett. 37(3): 133-136 (1991) - Yannis Manolopoulos, Athena Vakali:
Seek Distances in Disks with Two Independent Heads Per Surface. Inf. Process. Lett. 37(1): 37-42 (1991) - James K. Mullin:
A Caution on Universal Classes of Hash Functions. Inf. Process. Lett. 37(5): 247-256 (1991) - Stephan Olariu:
An Optimal Greedy Heuristic to Color Interval Graphs. Inf. Process. Lett. 37(1): 21-25 (1991) - Nageswara S. V. Rao, Weixiong Zhang:
Building Heaps in Parallel. Inf. Process. Lett. 37(6): 355-358 (1991) - Yasubumi Sakakibara:
On Learning from Queries and Counterexamples in the Presence of Noise. Inf. Process. Lett. 37(5): 279-284 (1991) - U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Multiple Stack Branch and Bound. Inf. Process. Lett. 37(1): 43-48 (1991) - Galen H. Sasaki:
The Effect of the Density of States on the Metropolis Algorithm. Inf. Process. Lett. 37(3): 159-163 (1991) - Maria J. Serna:
Approximating Linear Programming is Log-Space Complete for P. Inf. Process. Lett. 37(4): 233-236 (1991) - Sven Skyum:
A Simple Algorithm for Computing the Smallest Enclosing Circle. Inf. Process. Lett. 37(3): 121-125 (1991) - Timothy Law Snyder:
Lower Bounds for Rectilinear Steiner Trees in Bounded Space. Inf. Process. Lett. 37(2): 71-74 (1991) - R. Srikant, Kamala Krithivasan:
Fastest Path Across Constrained Moving Rectilinear Obstacles. Inf. Process. Lett. 37(6): 349-353 (1991) - Roberto Tamassia:
An Incremental Reconstruction Method for Dynamic Planar Point Location. Inf. Process. Lett. 37(2): 79-83 (1991) - Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
The Intersection Searching Problem for c-Oriented Polygons. Inf. Process. Lett. 37(4): 201-204 (1991) - Yoshihiro Tanaka:
A Dual Algorithm for the Satisfiability Problem. Inf. Process. Lett. 37(2): 85-89 (1991) - Gadi Taubenfeld:
On the Nonexistence of Resilient Consensus Protocols. Inf. Process. Lett. 37(5): 285-289 (1991) - Dirk Taubner:
A Note on the Notation of Recursion in Process Algebras. Inf. Process. Lett. 37(6): 299-303 (1991) - Kim-Heng Teo, Tai-Ching Tuan:
An Improved Upper Bound on the Number of Intersections Between Two Rectangular Paths. Inf. Process. Lett. 37(6): 305-309 (1991) - Wladyslaw M. Turski:
On Starvation and Some Related Issues. Inf. Process. Lett. 37(3): 171-174 (1991) - K. Vidyasankar:
A Very Simple Construction of 1-Writer Multireader Multivalued Atomic Variable. Inf. Process. Lett. 37(6): 323-326 (1991) - Quingzhou Wang, Kam-Hoi Cheng:
List Scheduling of Parallel Tasks. Inf. Process. Lett. 37(5): 291-297 (1991) - Biing-Feng Wang, Chuen-Liang Chen, Gen-Huey Chen:
A Simple Approach to Implementing Multiplication with Small Tables. Inf. Process. Lett. 37(6): 327-329 (1991) - Zhaofang Wen:
Parallel Multiple Search. Inf. Process. Lett. 37(4): 181-186 (1991) - Joakim von Wright:
Program Inversion in the Refinement Calculus. Inf. Process. Lett. 37(2): 95-100 (1991) - Bin Yu, Xinggang Lin, Youshou Wu:
The Tree Representation of the Graph Used in Binary Image Processing. Inf. Process. Lett. 37(1): 55-59 (1991) - Shyan-Ming Yuan:
Topological Properties of Supercube. Inf. Process. Lett. 37(5): 241-245 (1991) - Xubo Zhang:
Overlap Closures do not Suffice for Termination of General Term Rewriting Systems. Inf. Process. Lett. 37(1): 9-11 (1991) - Uri Zwick:
An Extension of Khrapchenko's Theorem. Inf. Process. Lett. 37(4): 215-217 (1991)