Journals in DBLP

Inf. Process. Lett.
1983, volume: 17, number: 5

1. Jeffrey S. Rohl
   A Faster Lexicographical N Queens Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:5, pp:231-233 [Journal]
   
2. Yao-Tin Yu, Mohamed G. Gouda
   Unboundedness Detection for a Class of Communicating Finite-State Machines. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:5, pp:235-240 [Journal]
   
3. Eugene W. Myers
   An Applicative Random-Access Stack. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:5, pp:241-248 [Journal]
   
4. Michael J. Fischer, Mike Paterson
   Storage Requirements for Fair Scheduling. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:5, pp:249-250 [Journal]
   
5. Seiichi Nishihara, Katsuo Ikeda
   Address Calculation Algorithms for Ordered Sets of Combinations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:5, pp:251-253 [Journal]
   
6. David T. Barnard
   Recursive Descent Parsing Using Implementation Languages Requiring Definition Before Use. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:5, pp:255-258 [Journal]
   
7. Tetsuo Ida
   Some FP Algebra with Currying Operation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:5, pp:259-261 [Journal]
   
8. Reiner Kolla
   Where-Oblivious is not Sufficient. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:5, pp:263-268 [Journal]
   
9. Yung H. Tsin, Francis Y. L. Chin
   A General Program Scheme for Finding Bridges. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1983, v:17, n:5, pp:269-272 [Journal]
   
10. Hitohisa Asai
    A Consideration of a Practical Implementation for a New Convergence Division. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:5, pp:273-281 [Journal]