Journals in DBLP

Inf. Process. Lett.
1979, volume: 8, number: 5

1. Ysmar V. Silva Filho
   Average Case Analysis of Region Search in Balanced k-d Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1979, v:8, n:5, pp:219-223 [Journal]
   
2. Manfred Broy, Martin Wirsing, Jean-Pierre Finance, Alain Quéré, Jean-Luc 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:224-229 [Journal]
   
3. Timo Leipälä
   On a Generalization of Binary Search. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1979, v:8, n:5, pp:230-233 [Journal]
   
4. 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:234-235 [Journal]
   
5. Yossi Shiloach
   A Fast Equivalence-Checking Algorithm for Circular Lists. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1979, v:8, n:5, pp:236-238 [Journal]
   
6. 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:239-240 [Journal]
   
7. D. van der Knijff, Jean-Louis 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:241-243 [Journal]
   
8. Jon Louis Bentley
   Decomposable Searching Problems. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1979, v:8, n:5, pp:244-251 [Journal]
   
9. George Loizou
   Mathematical Solution for a Data Processing System. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1979, v:8, n:5, pp:252-256 [Journal]
   
10. Keijo Ruohonen
    The Decidability of the F0L-D0L Equivalence Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:5, pp:257-260 [Journal]
    
11. 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:261-266 [Journal]
    
12. 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:267-271 [Journal]
    
13. Arnold L. Rosenberg
    A Note on Paths Embedded in Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:5, pp:272-273 [Journal]
    
14. N. Soundararajan
    Axiomatic Proofs of Fotal Correctness of Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:5, pp:274-277 [Journal]