Journals in DBLP

Inf. Process. Lett.
1998, volume: 66, number: 2

1. Beate Bollig, Ingo Wegener
   A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:2, pp:53-57 [Journal]
   
2. Flaminia L. Luccio
   Almost Exact Minimum Feedback Vertex Set in Meshes and Butterflies. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:2, pp:59-64 [Journal]
   
3. Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan
   Weighted Irredundance of Interval Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:2, pp:65-70 [Journal]
   
4. Christel Baier, Marta Z. Kwiatkowska
   On the Verification of Qualitative Properties of Probabilistic Processes under Fairness Constraints. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:2, pp:71-79 [Journal]
   
5. Sven Oliver Krumke, Hans-Christoph Wirth
   On the Minimum Label Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:2, pp:81-85 [Journal]
   
6. Chor Ping Low
   A Fast Search Algorithm for the Quorumcast Routing Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:2, pp:87-92 [Journal]
   
7. Ge-Ming Chiu
   A Fault-Tolerant Broadcasting Algorithm for Hypercubes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:2, pp:93-99 [Journal]
   
8. Tadakazu Sato
   Surjective Linear Cellular Automata over Z_m. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:2, pp:100-104 [Journal]
   
9. JaeCheol Ha, Sang-Jae Moon
   A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:2, pp:105-107 [Journal]