Journals in DBLP

Inf. Process. Lett.
1997, volume: 63, number: 5

1. S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
   Orienting Graphs to Optimize Reachability. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:5, pp:229-235 [Journal]
   
2. Clark F. Olson
   An Approximation Algorithm for Least Median of Squares Regression. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:5, pp:237-241 [Journal]
   
3. Doron Peled, Thomas Wilke
   Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:5, pp:243-246 [Journal]
   
4. Wei-Bin Lee, Chin-Chen Chang
   Authenticated Encryption Schemes with Linkage Between Message Blocks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:5, pp:247-250 [Journal]
   
5. Helmut Veith
   Languages Represented by Boolean Formulas. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:5, pp:251-256 [Journal]
   
6. Ravi B. Boppana
   The Average Sensitivity of Bounded-Depth Circuits. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:5, pp:257-261 [Journal]
   
7. Bang Ye Wu, Chuan Yi Tang
   An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:5, pp:263-269 [Journal]
   
8. Li-Chiun Wei, Ruay Shiung Chang
   Broadcast Scheduling in Packet Radio Networks by Hopfield Neural networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:5, pp:271-276 [Journal]
   
9. Ruay Shiung Chang, Shing-Jiuan Leu
   The Minimum Labeling Spanning Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:63, n:5, pp:277-282 [Journal]
   
10. Vincent D. Blondel, John N. Tsitsiklis
    When is a Pair of Matrices Mortal? [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:5, pp:283-286 [Journal]