Journals in DBLP

Inf. Process. Lett.
1992, volume: 41, number: 5

1. Takayoshi Shoudai
   A P-Complete Language Describable with Iterated Shuffle. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:5, pp:233-238 [Journal]
   
2. Tom Whaley
   Alternative Developments of Cyclic-Permutation Algorithms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:5, pp:239-241 [Journal]
   
3. Guorong Wang
   An Improved Parallel Algorithm for Computing the Generalized Inverse A+. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:5, pp:243-251 [Journal]
   
4. Igor Rivin, Ramin Zabih
   A Dynamic Programming Solution to the n-Queens Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:5, pp:253-256 [Journal]
   
5. Chandrasekhar Narayanaswami, Wm. Randolph Franklin
   Edge Intersection on the Hypercube Computer. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:5, pp:257-262 [Journal]
   
6. Chun Wa Ko, Frank Ruskey
   Generating Permutations of a Bag by Interchanges. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:5, pp:263-269 [Journal]
   
7. Jorge Urrutia, Fanica Gavril
   An Algorithm for Fraternal Orientation of Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:5, pp:271-274 [Journal]
   
8. Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski, Maria Grazia Speranza
   Scheduling Multiprocessor Tasks on Three Dedicated Processors. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:5, pp:275-280 [Journal]
   
9. Mads Dam
   R-Generability, and Definability in Branching Time Logics. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:5, pp:281-287 [Journal]
   
10. Jean Frédéric Myoupo
    Corrigenda: Dynamic Programming on Linear Pipelines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:5, pp:289- [Journal]