Journals in DBLP

Inf. Process. Lett.
1993, volume: 45, number: 3

1. Bin Jiang
   I/O-and CPU-Optimal Recognition of Strongly Connected Components. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:3, pp:111-115 [Journal]
   
2. Desh Ranjan, Daniela Rus
   A Tool for the Analysis of Manipulation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:3, pp:117-121 [Journal]
   
3. Khaled Day, Anand R. Tripathi
   Unidirectional Star Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:3, pp:123-129 [Journal]
   
4. Cheng-Chia Chen, I-Peng Lin
   The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:3, pp:131-136 [Journal]
   
5. Michael Merritt, Gadi Taubenfeld
   Speeding Lamport's Fast Mutual Exclusion Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:3, pp:137-142 [Journal]
   
6. Maciej Liskiewicz
   On the Relationship Between Deterministic Time and Deterministic Reversal. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:3, pp:143-146 [Journal]
   
7. Nancy M. Amato
   Improved Processor Bounds for Parallel Algorithms for Weighted Directed Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:3, pp:147-152 [Journal]
   
8. Suchen H. Hsu, Richard T. Snodgrass
   Optimal Block Size for Set-Valued Attributes. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:3, pp:153-158 [Journal]
   
9. Francis Suraweera, Prabir Bhattacharya
   An O(log m) Parallel Algorithm for the Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:3, pp:159-163 [Journal]