Journals in DBLP

Inf. Process. Lett.
2001, volume: 79, number: 5

1. Robert Fidytek, Andrzej Wlodzimierz Mostowski, Rafal Somla, Andrzej Szepietowski
   Algorithms counting monotone Boolean functions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:5, pp:203-209 [Journal]
   
2. Ilya Shmulevich, Aleksey D. Korshunov, Jaakko Astola
   Almost all monotone Boolean functions are polynomially learnable using membership queries. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:5, pp:211-213 [Journal]
   
3. Binay K. Bhattacharya, Robert Benkoczi
   On computing the optimal bridge between two convex polygons. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:5, pp:215-221 [Journal]
   
4. Brona Brejová
   Analyzing variants of Shellsort. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:5, pp:223-227 [Journal]
   
5. D. P. Wang
   An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:5, pp:229-236 [Journal]
   
6. Adrian Dumitrescu, William L. Steiger
   Space-time trade-offs for some ranking and searching queries. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:5, pp:237-241 [Journal]
   
7. Rahul Santhanam
   Lower bounds on the complexity of recognizing SAT by Turing machines. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:5, pp:243-247 [Journal]
   
8. Alex de V. Garcia, Edward Hermann Haeusler
   Code migration and program maintainability A categorical perspective. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:5, pp:249-254 [Journal]