Journals in DBLP

Inf. Process. Lett.
1991, volume: 37, number: 3

1. Sven Skyum
   A Simple Algorithm for Computing the Smallest Enclosing Circle. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:37, n:3, pp:121-125 [Journal]
   
2. Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc
   Searching with a Forbidden Lie Pattern in Responses. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:37, n:3, pp:127-132 [Journal]
   
3. Udi Manber, Ricardo A. Baeza-Yates
   An Algorithm for String Matching with a Sequence of don't Cares. [Citation Graph (2, 0)][DBLP]
   Inf. Process. Lett., 1991, v:37, n:3, pp:133-136 [Journal]
   
4. Pavol Duris, Imrich Vrto
   Semelectivity is not Sufficient. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:37, n:3, pp:137-141 [Journal]
   
5. Bin Jiang
   Traversing Graphs in a Paging Environment, BFS or DFS? [Citation Graph (2, 0)][DBLP]
   Inf. Process. Lett., 1991, v:37, n:3, pp:143-147 [Journal]
   
6. Frederic Green
   An Oracle Separating \oplus P from PP^PH. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:37, n:3, pp:149-153 [Journal]
   
7. Augustus J. E. M. Janssen
   An Optimization Problem Related to Neural Networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:37, n:3, pp:155-157 [Journal]
   
8. Galen H. Sasaki
   The Effect of the Density of States on the Metropolis Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:37, n:3, pp:159-163 [Journal]
   
9. Dung T. Huynh
   The Effective Entropies of Some Extensions of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:37, n:3, pp:165-169 [Journal]
   
10. Wladyslaw M. Turski
    On Starvation and Some Related Issues. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:3, pp:171-174 [Journal]
    
11. Micha Hofri, Hadas Shachnai
    On the Optimality of the Counter Scheme for Dynamic Linear Lists. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:3, pp:175-179 [Journal]