Journals in DBLP

Inf. Process. Lett.
1988, volume: 27, number: 2

1. Bogdan S. Chlebus
   A Parallel Bucket Sort. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:2, pp:57-61 [Journal]
   
2. Jacek Witaszek
   A Practical Method for Finding the Optimum Postponement Transformation for LR(k) Parsers. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:2, pp:63-67 [Journal]
   
3. Mukesh Singhal, Yelena Yesha
   A Polynomial Algorithm for Computation of the Probability of Conflicts in a Database Under Arbitrary Data Access Distribution. [Citation Graph (2, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:2, pp:69-74 [Journal]
   
4. Satoru Miyano
   A Parallelizable Lexicographically First Maximal Edge-Induced Subgraph Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:2, pp:75-78 [Journal]
   
5. C. C. Chang, C. H. Chang
   An Ordered Minimal Perfect Hashing Scheme with Single Parameter. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:2, pp:79-83 [Journal]
   
6. Robin Liu, Simeon C. Ntafos
   On Decomposing Polygons into Uniformly Monotone Parts. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:2, pp:85-89 [Journal]
   
7. Franz Baader
   A Note on Unification Type Zero. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:2, pp:91-93 [Journal]
   
8. Ravi S. Sandhu
   Cryptographic Implementation of a Tree Hierarchy for Access Control. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:2, pp:95-98 [Journal]
   
9. Nicholas J. Patterson, Kenneth J. Supowit
   Finding the Vertices Nearest to a Point in a Hypercube. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:27, n:2, pp:99-102 [Journal]
   
10. Alan M. Frieze
    On the Random Construction of Heaps. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:2, pp:103-109 [Journal]