Journals in DBLP

Inf. Process. Lett.
1992, volume: 41, number: 3

1. Luca Gemignani
   Fast Inversion of Hankel and Toeplitz Matrices. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:3, pp:119-123 [Journal]
   
2. Walter W. Kirchherr
   Kolmogorov Complexity and Random Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:3, pp:125-130 [Journal]
   
3. Jayadev Misra, David Gries
   A Constructive Proof of Vizing's Theorem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:3, pp:131-133 [Journal]
   
4. Thomas C. Shermer
   A Linear Algorithm for Bisecting a Polygon. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:3, pp:135-140 [Journal]
   
5. Klaas Esseling
   The Order of Appel's Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:3, pp:141-147 [Journal]
   
6. Alok Aggarwal
   Parallel Complexity of Computing a Maximal Set of Disjoint Paths. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:3, pp:149-151 [Journal]
   
7. Peter Rajcáni
   Optimal Parallel 3-Coloring Algorithm for Rooted Trees and its Applications. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:3, pp:153-156 [Journal]
   
8. Rakesh M. Verma
   Strings, Trees, and Patterns. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:3, pp:157-161 [Journal]
   
9. Kim S. Larsen, Michael I. Schwartzbach, Erik Meineche Schmidt
   A New Formalism for Relational Algebra. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:41, n:3, pp:163-168 [Journal]
   
10. Koichi Wada, Yupin Luo, Kimio Kawaguchi
    Optimal Fault-Tolerant Routings for Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:3, pp:169-174 [Journal]