Journals in DBLP

Inf. Process. Lett.
1994, volume: 52, number: 2

1. Helmut Seidl
   Haskell Overloading is DEXPTIME-Complete. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:52, n:2, pp:57-60 [Journal]
   
2. Mikael Rittri
   Semi-Unification of Two Terms in Abelian Groups. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:52, n:2, pp:61-68 [Journal]
   
3. Bern-Cherng Liaw, Richard C. T. Lee
   An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:52, n:2, pp:69-75 [Journal]
   
4. Chen-Hsing Peng, Jia-Shung Wang, Richard C. T. Lee
   Recognizing Shortest-Path Trees in Linear Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:52, n:2, pp:77-85 [Journal]
   
5. Refael Hassin, Shlomo Lahav
   Maximizing the Number of Unused Colors in the Vertex Coloring Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:52, n:2, pp:87-90 [Journal]
   
6. Takehiro Tokuda, Yoshimichi Watanabe
   An Attribute Evaluation of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:52, n:2, pp:91-98 [Journal]
   
7. Mohamed G. Gouda
   Stabilizing Observers. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:52, n:2, pp:99-103 [Journal]
   
8. Jean Mayo, Phil Kearns
   Distributed Termination Detection with Roughly Synchronized Clocks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:52, n:2, pp:105-108 [Journal]
   
9. Thomas Roos, Peter Widmayer
   k-Violation Linear Programming. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:52, n:2, pp:109-114 [Journal]