Journals in DBLP
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ]