Journals in DBLP

Inf. Process. Lett.
2005, volume: 95, number: 4

1. Beate Bollig
   A large lower bound on the query complexity of a simple boolean function. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:95, n:4, pp:423-428 [Journal]
   
2. Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
   Sufficient conditions for lambda^'-optimality of graphs with small conditional diameter. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:95, n:4, pp:429-434 [Journal]
   
3. Jyh-haw Yeh, Marion Scheepers, Wen-Chen Hu
   Modifying YCN key assignment scheme to resist the attack from Hwang. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:95, n:4, pp:435-440 [Journal]
   
4. Behrooz Parhami
   The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:95, n:4, pp:441-445 [Journal]
   
5. Salvador Lucas, Claude Marché, José Meseguer
   Operational termination of conditional term rewriting systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:95, n:4, pp:446-453 [Journal]
   
6. Sophie Pinchinat, Stéphane Riedweg
   A decidable class of problems for control under partial observation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:95, n:4, pp:454-460 [Journal]
   
7. Yaron Ostrovsky-Berman
   The transportation metric and related problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:95, n:4, pp:461-465 [Journal]
   
8. Justin Colannino, Godfried T. Toussaint
   An algorithm for computing the restriction scaffold assignment problem in computational biology. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:95, n:4, pp:466-471 [Journal]