Journals in DBLP

Inf. Process. Lett.
1998, volume: 67, number: 3

1. Maxime Crochemore, Filippo Mignosi, Antonio Restivo
   Automata and Forbidden Words. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:3, pp:111-117 [Journal]
   
2. Mila E. Majster-Cederbaum, Markus Roggenbach
   Transistion Systems from Event Structures Revisited. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:3, pp:119-124 [Journal]
   
3. Refael Hassin, Shlomi Rubinstein
   An Approximation Algorithm for the Maximum Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:3, pp:125-130 [Journal]
   
4. Peter Damaschke
   Randomized Group Testing for Mutually Obscuring Defectives. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:3, pp:131-135 [Journal]
   
5. Sanguthevar Rajasekaran
   An Optimal Parallel Algorithm for Sorting Multisets. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:3, pp:141-143 [Journal]
   
6. Dino Pedreschi, Salvatore Ruggieri
   Weakest Preconditions for Pure Prolog Programs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:3, pp:145-150 [Journal]
   
7. Loon-Been Chen, I-Chen Wu
   On the Time Complexity of Minimum and Maximum Global Snapshot Problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:3, pp:151-156 [Journal]
   
8. Nimmagadda Chalamaiah, Badrinath Ramamurthy
   Finding Shortest Paths in Distributed Loop Networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:3, pp:157-161 [Journal]