Journals in DBLP

Inf. Process. Lett.
1990, volume: 34, number: 4

1. Udi Manber
   Recognizing Breadth-First Search Trees in Linear Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:4, pp:167-171 [Journal]
   
2. Laxmikant V. Kalé
   An Almost Perfect Heuristic for the N Nonattacking Queens Problem. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:4, pp:173-178 [Journal]
   
3. Earlin Lutz
   Some Proofs of Data Refinement. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:4, pp:179-185 [Journal]
   
4. Biing-Feng Wang, Gen-Huey Chen, Ferng-Chiang Lin
   Constant Time Sorting on a Processor Array with a Reconfigurable Bus System. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:4, pp:187-192 [Journal]
   
5. James H. Bradford
   Sequence Matching with Binary Codes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:4, pp:193-196 [Journal]
   
6. Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel
   Parallel Algorithms for Gossiping by Mail. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:4, pp:197-202 [Journal]
   
7. Samir Khuller
   Coloring Algorithms for K_5-Minor Free Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:4, pp:203-208 [Journal]
   
8. James W. Cooper, Leslie J. Kitchen
   Casop: A Fast Algorithm for Computing the n-Ary Composition of a Binary Associative Operator. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:4, pp:209-213 [Journal]
   
9. G. Ramalingam, C. Pandu Rangan
   New Sequential and Parallel Algorithms for Interval Graph Recognition. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:4, pp:215-219 [Journal]