Journals in DBLP

Inf. Process. Lett.
1988, volume: 29, number: 6

1. Mila E. Majster-Cederbaum
   On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:29, n:6, pp:277-281 [Journal]
   
2. Bernard M. Waxman, Makoto Imase
   Worst-Case Performance of Rayward-Smith's Steiner Tree Heuristic. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:29, n:6, pp:283-287 [Journal]
   
3. Stephan Olariu
   On the Unimodality of Convex Polygons. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:29, n:6, pp:289-292 [Journal]
   
4. Carroll Morgan
   Auxiliary Variables in Data Refinement. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:29, n:6, pp:293-296 [Journal]
   
5. Irène Guessarian, Lutz Priese
   On the Minimal Number of * Operators to Model Regularity in Fair SCCS. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:29, n:6, pp:297-300 [Journal]
   
6. David Alex Lamb
   Benign Side Effects. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:29, n:6, pp:301-305 [Journal]
   
7. Natarajan Shankar, V. Ramachandran
   Efficient Parallel Circuits and Algorithms for Division. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:29, n:6, pp:307-313 [Journal]
   
8. Tetsuo Moriya
   Closure Property of Principal Cones Under Substitution. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:29, n:6, pp:315-317 [Journal]
   
9. Boris S. Veroy
   Average Complexity of Divide-and-Conquer Algorithms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1988, v:29, n:6, pp:319-326 [Journal]
   
10. Torben Hagerup
    On Saving Space in Parallel Computation (Note). [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:6, pp:327-329 [Journal]