Journals in DBLP
Wojciech Rytter The Space Complexity of the Unique Decipherability Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1986, v:23, n:1, pp:1-3 [Journal ] Ferng-Ching Lin , Wei Kuan Shih Long Edges in the Layouts of Shuffle-Exchange and Cube-Connected Cycles Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1986, v:23, n:1, pp:5-9 [Journal ] Gottfried Tinhofer , H. Schreck The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n). [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1986, v:23, n:1, pp:11-17 [Journal ] Hartmut Schmeck On the Maximum Edge Length in VLSI Layouts of Complete Binary Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1986, v:23, n:1, pp:19-23 [Journal ] José L. Balcázar On (Greek D)D_P²-Immunity. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1986, v:23, n:1, pp:25-28 [Journal ] K. Kakuta , Hirofumi Nakamura , S. Iida A Parallel Reference Counting Algorithm. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1986, v:23, n:1, pp:33-37 [Journal ] Bernd-Jürgen Falkowski , Lothar Schmitz A Note on the Queens' Problem. [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1986, v:23, n:1, pp:39-46 [Journal ] O. M. Vikas , S. K. Basandra Data Algebra and Its Application in Database Design. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1986, v:23, n:1, pp:47-54 [Journal ]