Journals in DBLP

Inf. Process. Lett.
1987, volume: 25, number: 6

1. Kadri Krause, Lawrence L. Larmore, Dennis J. Volper
   Packing Items from a Triangular Distribution. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:25, n:6, pp:351-362 [Journal]
   
2. Joanna Jedrzejowicz
   Nesting of Shuffle Closure is Important. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:25, n:6, pp:363-368 [Journal]
   
3. Jean Marcel Pallo
   On the Rotation Distance in the Lattice of Binary Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:25, n:6, pp:369-374 [Journal]
   
4. Ricardo A. Baeza-Yates
   Some Average Measures in m-ary Search Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:25, n:6, pp:375-382 [Journal]
   
5. Shlomo Moran
   Generalized Lower Bounds Derived from Hastad's Main Lemma. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:25, n:6, pp:383-388 [Journal]
   
6. Manfred Kunde, Horst Steppat
   On the Worst-Case Ratio of a Compound Multiprocessor Scheduling Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:25, n:6, pp:389-396 [Journal]
   
7. Imrich Vrto
   The Area-Time Complexity of the VLSI Counter. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:25, n:6, pp:397-400 [Journal]
   
8. F. Peper
   Determining Connected Components in Linear Time by a linear Number of Processors. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:25, n:6, pp:401-406 [Journal]
   
9. Udo Kelter
   The Complexity of Strict Serializability Revisited. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1987, v:25, n:6, pp:407-412 [Journal]
   
10. Youichi Kobuchi
    A Note on Symmetrical Cellular Spaces. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:6, pp:413-416 [Journal]