- 1986
- Kunio Aizawa, Akira Nakamura:
Direction-Independent Application of Productions on Two-Dimensional Arrays. Inf. Process. Lett. 22(6): 295-301 (1986) - Timo O. Alanko, R. L. Smelianski:
On the Calculation of Control Transition Probabilities in a Program. Inf. Process. Lett. 22(5): 273-276 (1986) - Klaus Ambos-Spies:
Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets. Inf. Process. Lett. 22(3): 113-117 (1986) - Krzysztof R. Apt, Dexter Kozen:
Limits for Automatic Verification of Finite-State Concurrent Systems. Inf. Process. Lett. 22(6): 307-309 (1986) - R. K. Arora, S. P. Rana, M. N. Gupta:
Distributed Termination Detection Algorithm for Distributed Computations. Inf. Process. Lett. 22(6): 311-314 (1986) - Franz Aurenhammer:
The One-Dimensional Weighted Voronoi Diagram. Inf. Process. Lett. 22(3): 119-123 (1986) - Bernd Baumgarten, Peter Ochsenschläger:
On Termination and Phase Changes in the Presence of Unreliable Communication. Inf. Process. Lett. 22(1): 15-20 (1986) - Herbert J. Bernstein:
Determining the Shape of a Convex n-Sided Polygon by Using 2n+k Tactile Probes. Inf. Process. Lett. 22(5): 255-260 (1986) - Jean Berstel:
Every Iterated Morphism Yields a co-CFL. Inf. Process. Lett. 22(1): 7-9 (1986) - Paul Bourret, R. Souza de Oliveira:
Lower and Upper Bounds of the Sizes of Domains: Estimates and Experiments. Inf. Process. Lett. 22(5): 247-253 (1986) - Svante Carlsson:
Splitmerge - A Fast Stable Merging Algorithm. Inf. Process. Lett. 22(4): 189-192 (1986) - Arturo Carpi, Aldo de Luca:
Square-Free Words on Partially Commutative Free Monoids. Inf. Process. Lett. 22(3): 125-131 (1986) - Philippe Chatelin:
On Transformations of Algorithms to Multiply 2*2 Matrices. Inf. Process. Lett. 22(1): 1-5 (1986) - Lin Chen:
O(1) Space Complexity Deletion for AVL Trees. Inf. Process. Lett. 22(3): 147-149 (1986) - Key-Sun Choi, Gil-Chang Kim:
A Controlled Quantification in Parsing of Montague Grammar. Inf. Process. Lett. 22(4): 207-216 (1986) - Marta Cialdea
:
Some Remarks on the Possibility of Extending Resolution Proof Procedures to Intuitionistic Logic. Inf. Process. Lett. 22(2): 87-90 (1986) - Kenneth L. Clarkson:
Linear Programming in O(n * (3_d)_2) Time. Inf. Process. Lett. 22(1): 21-24 (1986) - Ernest J. Cockayne, Denton E. Hewgill:
Exact Computation of Steiner Minimal Trees in the Plane. Inf. Process. Lett. 22(3): 151-156 (1986) - Bruno Codenotti, Grazia Lotti:
A Note on the VLSI Counter. Inf. Process. Lett. 22(4): 193-195 (1986) - Ke-Chang Dai:
EDISON-80, a Language for Modular Programming of Parallel Processes. Inf. Process. Lett. 22(2): 61-72 (1986) - Frank K. H. A. Dehne:
O(n(1/2)) Algorithms for the Maximal Elements and ECDF Searching Problem on a Mesh-Connected Parallel Computer. Inf. Process. Lett. 22(6): 303-306 (1986) - John B. Evans:
Experiments with Trees of the Storage and Retrieval of Future Events. Inf. Process. Lett. 22(5): 237-242 (1986) - H. Gajewska, Robert Endre Tarjan:
Deques with Heap Order. Inf. Process. Lett. 22(4): 197-200 (1986) - Françoise Gire:
Two Decidability Problems for Infinite Words. Inf. Process. Lett. 22(3): 135-140 (1986) - Pavel Goralcik, Václav Koubek:
Verifying Nonrigidity. Inf. Process. Lett. 22(2): 91-95 (1986) - Michael D. Grigoriadis, Bahman Kalantari:
A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms. Inf. Process. Lett. 22(2): 73-76 (1986) - Gopal K. Gupta, Bala Srinivasan:
Approximate Storage Utilization of B-Trees. Inf. Process. Lett. 22(5): 243-246 (1986) - Dan Gusfield, Leonard Pitt:
Equivalent Approximation Algorithms for Node Cover. Inf. Process. Lett. 22(6): 291-294 (1986) - M. C. Hambury:
Two Tagless Variations on the Deutsch-Schorr-Waite Algorithm. Inf. Process. Lett. 22(4): 179-183 (1986) - Yoshito Hanatani, Ronald Fagin:
A Simple Characterization of Database Dependency Implication. Inf. Process. Lett. 22(6): 281-283 (1986)