Journals in DBLP
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ]