Journals in DBLP

Inf. Process. Lett.
1991, volume: 38, number: 1

1. Victor J. Dielissen, Anne Kaldewaij
   Rectangular Partition is Polynomial in Two Dimensions but NP-Complete in Three. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:1, pp:1-6 [Journal]
   
2. Pavel Goralcik, A. Goralciková, Václav Koubek
   Alternation with a Pebble. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:1, pp:7-13 [Journal]
   
3. Ivan Stojmenovic
   Bisections and Ham-Sandwich Cuts of Convex Polygons and Polyhedra. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:1, pp:15-21 [Journal]
   
4. Ahmed K. Elmagarmid, Weimin Du
   Integrity Aspects of Quasi Serializability. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:1, pp:23-28 [Journal]
   
5. Shi-Jinn Horng, Wen-Tsuen Chen, Ming-Yi Fang
   Optimal Speed-Up Algorithms for Template Matching on SIMD Hypercube Multiprocessors with Restricted Local Memory. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:1, pp:29-37 [Journal]
   
6. Victor Shoup
   Smoothness and Factoring Polynomials Over Finite Fields. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:1, pp:39-42 [Journal]
   
7. Xu Cheng
   A Graph Transformation Algorithm for Concurrency Control in a Partitioned Database. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:1, pp:43-48 [Journal]
   
8. Calvin Ching-Yuen Chen, Sajal K. Das, Selim G. Akl
   A Unified Approach to Parallel Depth-First Traversals of General Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:1, pp:49-55 [Journal]