Journals in DBLP

Inf. Process. Lett.
1988, volume: 26, number: 5

1. Claudio Arbib
   A Polynomial Characterization of Some Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:5, pp:223-230 [Journal]
   
2. Karel Culik II, Juhani Karhumäki
   On Totalistic Systolic Networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:5, pp:231-236 [Journal]
   
3. Andrzej Sieminski
   Fast Decoding of the Huffman Codes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:5, pp:237-241 [Journal]
   
4. Carroll Morgan
   Data Refinement by Miracles. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:5, pp:243-246 [Journal]
   
5. Patrick W. Dymond
   Input-Driven Languages are in log n Depth. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:5, pp:247-250 [Journal]
   
6. Eljas Soisalon-Soininen, Jorma Tarhio
   Looping LR Parsers. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:5, pp:251-253 [Journal]
   
7. Klaus Hinrichs, Jürg Nievergelt, Peter Schorn
   Plane-Sweep Solves the Closest Pair Problem Elegantly. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:5, pp:255-261 [Journal]
   
8. Olivier Y. de Vel, E. V. Krishnamurthy
   An Iterative Pipelined Array Architecture for the Generalized Matrix Inversion. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:5, pp:263-267 [Journal]
   
9. Stephen A. Cook
   Short Propositional Formulas Represent Nondeterministic Computations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:26, n:5, pp:269-270 [Journal]
   
10. Erkki Mäkinen
    On the Rotation Distance of Binary Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:26, n:5, pp:271-272 [Journal]
    
11. Joel I. Seiferas
    A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:26, n:5, pp:273-276 [Journal]