Journals in DBLP

Inf. Process. Lett.
1993, volume: 46, number: 1

1. Jer-Shyan Wu, Rong-Jaye Chen
   The Towers of Hanoi Problem with Cyclic Parallel Moves. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:46, n:1, pp:1-6 [Journal]
   
2. Ming-Shing Yu, Lin Yu Tseng, Shoe-Jane Chang
   Sequential and Parallel Algorithms for the Maximum-Weight Independent Set Problem on Permutation Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:46, n:1, pp:7-11 [Journal]
   
3. Graham M. Megson
   Systolic Partitioning Algorithms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:46, n:1, pp:13-18 [Journal]
   
4. Rafael Dueire Lins
   Generational Cyclic Reference Counting. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:46, n:1, pp:19-20 [Journal]
   
5. Ten-Hwang Lai, Shu-Shang Wei
   The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:46, n:1, pp:21-26 [Journal]
   
6. Yi Xian Yang
   New Binary Sequences with Perfect Staircase Profile of Linear Complexity. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:46, n:1, pp:27-29 [Journal]
   
7. Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney
   Running ASCEND, DESCEND and PIPELINE Algorithms in Parallel Using Small Processors. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:46, n:1, pp:31-36 [Journal]
   
8. Kojiro Kobayashi
   Sigma^0_n-Complete Properties of Programs and Martin-Löf Randomness. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:46, n:1, pp:37-42 [Journal]
   
9. Shin Cha, In Sang Chung, Yong Rae Kwon
   Complexity Measures for Concurrent Programs Based on Information-Theoretic Metrics. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:46, n:1, pp:43-50 [Journal]
   
10. Sang Bong Oh
    An Analytical Evidence for Kalé's Heuristic for the N Queens Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:1, pp:51-54 [Journal]