- Chiu-Chuan Lin, Ferng-Ching Lin:
Minimal Fully Adaptive Wormhole Routing on Hypercubes. Inf. Process. Lett. 50(6): 297-301 (1994) - Frédéric Maire:
Polyominos and Perfect Graphs. Inf. Process. Lett. 50(2): 57-61 (1994) - Udi Manber, Sun Wu:
An Algorithm for Approximate Membership checking with Application to Password Security. Inf. Process. Lett. 50(4): 191-197 (1994) - Giovanni Manzini:
Sparse Matrix Vector Multiplication on Distributed Architectures: Lower Bounds and Average Complexity Results. Inf. Process. Lett. 50(5): 231-238 (1994) - Dennis W. G. Moore, William F. Smyth:
An Optimal Algorithm to Compute all the Covers of a String. Inf. Process. Lett. 50(5): 239-246 (1994) - Etsuro Moriya:
On Two-Way Tree Automata. Inf. Process. Lett. 50(3): 117-121 (1994) - Chandrasekhar Narayanaswami, William L. Luken:
Approximating chin Efficiently. Inf. Process. Lett. 50(4): 205-210 (1994) - David A. Naumann:
A Recursion Theorem for Predicate Transformers on Inductive Data Types. Inf. Process. Lett. 50(6): 329-336 (1994) - Mitchell L. Neilsen, Masaaki Mizuno:
Nondominated k-Coteries for Multiple Mutual Exclusion. Inf. Process. Lett. 50(5): 247-252 (1994) - Matti Nykänen, Esko Ukkonen:
Finding Lowest Common Ancestors in Arbitrarily Directed Trees. Inf. Process. Lett. 50(6): 307-310 (1994) - Linda Pagli, Geppino Pucci:
Counting the Number of Fault Patterns in Redundant VLSI Arrays. Inf. Process. Lett. 50(6): 337-342 (1994) - Chris H. Perleberg:
Single Character Searching Methods and the shift-or Pattern-Matching Algorithm. Inf. Process. Lett. 50(5): 269-275 (1994) - Giuseppe Pirillo:
Infinite Words and Biprefix Codes. Inf. Process. Lett. 50(6): 293-295 (1994) - Abraham P. Punnen, Kunhiraman Nair:
A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem. Inf. Process. Lett. 50(5): 283-286 (1994) - Jaikumar Radhakrishnan, K. V. Subrahmanyam:
Directed Monotone Contact Networks for Threshold Functions. Inf. Process. Lett. 50(4): 199-203 (1994) - R. Ravi:
A Primal-Dual Approximation Algorithm for the Steiner Forest Problem. Inf. Process. Lett. 50(4): 185-190 (1994) - Rodolfo F. Resende, Amr El Abbadi:
On the Serializability Theorem for Nested Transactions. Inf. Process. Lett. 50(4): 177-183 (1994) - T. Sony Roy, G. Athithan, M. S. Ganagi, A. Sivasankara Reddy:
A New Method to Solve Non-Linear Equations. Inf. Process. Lett. 50(2): 75-79 (1994) - Jennifer Seberry, Xian-Mo Zhang, Yuliang Zheng:
Improving the Strict Avalanche Characteristics of Cryptographic Functions. Inf. Process. Lett. 50(1): 37-41 (1994) - Rahul Simha, Amitava Majumdar:
On Lookahead in the List Update Problem. Inf. Process. Lett. 50(2): 105-110 (1994) - Rani Siromoney, Lisa Mathew, V. Rajkumar Dare, K. G. Subramanian:
Infinite Lyndon Words. Inf. Process. Lett. 50(2): 101-104 (1994) - Kokichi Sugihara:
Simpler Proof of a Realizability Theorem on Delaunay Triangulations. Inf. Process. Lett. 50(4): 173-176 (1994) - Yi-Min Wang, Andy Lowry, W. Kent Fuchs:
Consistent Global Checkpoints Based on Direct Dependency Tracking. Inf. Process. Lett. 50(4): 223-230 (1994) - Bob P. Weems, Lloyd C. Swayze:
Allocation Techniques for Distributed Reduction Data Elements. Inf. Process. Lett. 50(3): 137-142 (1994) - Li-Yan Yuan:
Logic Program Semantics and Circumscription of Autoepistemic Theories. Inf. Process. Lett. 50(3): 159-164 (1994) - Xubo Zhang, Z. Meral Özsoyoglu:
Some Results on the Containment and Minimization of (in) Equality Queries. Inf. Process. Lett. 50(5): 259-267 (1994)