Journals in DBLP

Inf. Process. Lett.
1990, volume: 36, number: 3

1. De-Lei Lee
   Efficient Address Generation in a Parallel Processor. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:36, n:3, pp:111-116 [Journal]
   
2. Jingde Cheng
   An Algebraic Semantics of Notional Entailment Logic Cn. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:36, n:3, pp:117-121 [Journal]
   
3. Aphrodite Tsalgatidou
   Modelling and Animating Information Systems Dynamics. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:36, n:3, pp:123-127 [Journal]
   
4. Shuo-Yen Robert Li
   On Full Utilization of Multi-Channel Capacity with Priority Protocol. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:36, n:3, pp:129-133 [Journal]
   
5. Laura A. Sanchis
   On the Complexity of Test Case Generation for NP-Hard Problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:36, n:3, pp:135-140 [Journal]
   
6. John G. Kollias, Yannis Manolopoulos, Christos H. Papadimitriou
   The Optimum Execution Order of Queries in Linear Storage. [Citation Graph (3, 0)][DBLP]
   Inf. Process. Lett., 1990, v:36, n:3, pp:141-145 [Journal]
   
7. Lawrence L. Larmore
   An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:36, n:3, pp:147-151 [Journal]
   
8. Rong Lin, Stephan Olariu
   A Fast Parallel, Algorithm to Recognize, Partitionable Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:36, n:3, pp:153-157 [Journal]
   
9. A. Paulik
   Worst-Case Analysis of a Generalized Heapsort Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:36, n:3, pp:159-165 [Journal]
   
10. Kim-Heng Teo, Tai-Ching Tuan
    Performance Analysis of Greedy Heuristic to Find a Minimum Total-Jogs Layout for River Routing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:3, pp:167-170 [Journal]