Journals in DBLP

Inf. Process. Lett.
1998, volume: 68, number: 6

1. Josep Rifà
   A New Algebraic Algorithm to Decode the Ternary Golay Code. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:68, n:6, pp:271-274 [Journal]
   
2. Rakesh K. Sinha
   Simulation of PRAMs with Scan Primitives by Unbounded Fan-In Circuits. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:68, n:6, pp:275-282 [Journal]
   
3. Jorge Calera-Rubio, Rafael C. Carrasco
   Computing the Relative Entropy Between Regular Tree Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:68, n:6, pp:283-289 [Journal]
   
4. Janelle J. Harms
   A Simple Optimal Algorithm for Scheduling Variable-Sized Requests. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:68, n:6, pp:291-293 [Journal]
   
5. Wen-Ming Yan, Wendy J. Myrvold, Kuo-Liang Chung
   A Formula for the Number of Spanning Trees of a Multi-Star Related Graph. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:68, n:6, pp:295-298 [Journal]
   
6. Andrzej Szepietowski
   Weak and Strong One-Way Space Complexity Classes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:68, n:6, pp:299-302 [Journal]
   
7. Pierre Fraigniaud
   Hierarchical Broadcast Networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:68, n:6, pp:303-305 [Journal]
   
8. Ulrich Kühn
   Local Calculation of Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:68, n:6, pp:307-312 [Journal]
   
9. Ton Kloks, Dieter Kratsch, Haiko Müller
   Bandwidth of Chain Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:68, n:6, pp:313-315 [Journal]
   
10. Michael J. Collins, Bernard M. E. Moret
    Improved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:6, pp:317-319 [Journal]