
Journals in DBLP
 Ysmar V. Silva Filho
Average Case Analysis of Region Search in Balanced kd Trees. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:219223 [Journal]
 Manfred Broy, Martin Wirsing, JeanPierre Finance, Alain Quéré, JeanLuc Remy
Methodical Solution of the Problem of Ascending Subsequences of Maximum Length Within a Given Sequence. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:224229 [Journal]
 Timo Leipälä
On a Generalization of Binary Search. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:230233 [Journal]
 Dario Bini, Milvio Capovani, Francesco Romani, Grazia Lotti
O(n^{2.7799}) Complexity for n*n Approximate Matrix Multiplication. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:234235 [Journal]
 Yossi Shiloach
A Fast EquivalenceChecking Algorithm for Circular Lists. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:236238 [Journal]
 Wolfgang Reisig
A Note on the Representation of Finite Tree Automata. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:239240 [Journal]
 D. van der Knijff, JeanLouis Lassez
A Clarification of the Comparison Between Some Measures of Software Science. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:241243 [Journal]
 Jon Louis Bentley
Decomposable Searching Problems. [Citation Graph (1, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:244251 [Journal]
 George Loizou
Mathematical Solution for a Data Processing System. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:252256 [Journal]
 Keijo Ruohonen
The Decidability of the F0LD0L Equivalence Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:257260 [Journal]
 Charles N. Fischer, K. C. Tai, D. R. Milton
Immediate Error Detection in Strong LL(1) Parsers. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:261266 [Journal]
 Eitan M. Gurari, Oscar H. Ibarra
On the Space Complexity of Recursive Algorithms. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:267271 [Journal]
 Arnold L. Rosenberg
A Note on Paths Embedded in Trees. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:272273 [Journal]
 N. Soundararajan
Axiomatic Proofs of Fotal Correctness of Programs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:8, n:5, pp:274277 [Journal]
