- Alfonso Miola:
Algebraic Approach to p-adic Conversion of Rational Numbers. Inf. Process. Lett. 18(3): 167-171 (1984) - Satoru Miyano:
Remarks on Two-Way Automata with Weak-Counters. Inf. Process. Lett. 18(2): 105-107 (1984) - Alistair Moffat, Tadao Takaoka:
A Priority Queue for the All Pairs Shortest Path Problem. Inf. Process. Lett. 18(4): 189-193 (1984) - Peter Møller-Nielsen, Jørgen Staunstrup:
Experiments With a Fast String Searching Algorithm. Inf. Process. Lett. 18(3): 129-135 (1984) - Burkhard Monien:
Deterministic Two-Way One-Head Pushdown Automata are Very Powerful. Inf. Process. Lett. 18(5): 239-242 (1984) - Takao Ohya, Masao Iri, Kazuo Murota:
A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing. Inf. Process. Lett. 18(4): 227-231 (1984) - John H. Remmers:
A Technique for Developing Loop Invariants. Inf. Process. Lett. 18(3): 137-139 (1984) - Neil C. Rowe:
Diophantine Inference on a Statistical Database. Inf. Process. Lett. 18(1): 25-31 (1984) - Ahmed Saoudi:
Infinitary Tree Languages Recognized by omega-Automata. Inf. Process. Lett. 18(1): 15-19 (1984) - F. Scarioni, H. G. Speranza:
A Probabilistic Analysis of an Error-Correcting Algorithm for the Towers of Hanoi Puzzle. Inf. Process. Lett. 18(2): 99-103 (1984) - Jan Schlörer:
Insecurity of Set Controls for Statistical Databases. Inf. Process. Lett. 18(2): 67-71 (1984) - Shinsei Tazawa:
On the Consecutive Retrieval Property for Generalized Binary Queries. Inf. Process. Lett. 18(5): 291-293 (1984) - Jürgen Tiekenheinrich:
A 4n-Lower Bound on the Monotone Network Complexity of a One-Output Boolean Function. Inf. Process. Lett. 18(4): 201-202 (1984) - Rodney W. Topor:
Termination Detection for Distributed Computations. Inf. Process. Lett. 18(1): 33-36 (1984) - Mark B. Trakhtenbrot:
Some Equivalent Transformations of Recursive Programs Based on Their Schematic Properties. Inf. Process. Lett. 18(5): 275-283 (1984) - György Turán:
The Critical Complexity of Graph Properties. Inf. Process. Lett. 18(3): 151-153 (1984) - Russell Turpin, Brian A. Coan:
Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement. Inf. Process. Lett. 18(2): 73-76 (1984) - Moshe Y. Vardi:
A Note on Lossless Database Decompositions. Inf. Process. Lett. 18(5): 257-260 (1984) - Herbert S. Wilf:
Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem. Inf. Process. Lett. 18(3): 119-121 (1984) - Susumu Yamasaki
, Mikio Yoshida, Shuji Doshita, Mikito Hirata:
A New Combination of Input and Unit Deductions for Horn Sentences. Inf. Process. Lett. 18(4): 209-213 (1984) - Eiji Yodogawa:
A Note on Array Grammars. Inf. Process. Lett. 18(1): 51-54 (1984) - Eitan Zemel:
An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems. Inf. Process. Lett. 18(3): 123-128 (1984)
