Journals in DBLP

Inf. Process. Lett.
2002, volume: 83, number: 5

1. Benny K. Nielsen, Pawel Winter, Martin Zachariasen
   On the location of Steiner points in uniformly-oriented Steiner trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:5, pp:237-241 [Journal]
   
2. Francesco Quaglia
   A restriction of the elastic time algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:5, pp:243-249 [Journal]
   
3. Ph. Schnoebelen
   Verifying lossy channel systems has nonprimitive recursive complexity. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:5, pp:251-261 [Journal]
   
4. Steven D. Galbraith, John Malone-Lee, Nigel P. Smart
   Public key signatures in the multi-user setting. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:5, pp:263-266 [Journal]
   
5. Amnon Ta-Shma
   Storing information with extractors. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:5, pp:267-274 [Journal]
   
6. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
   New bounds on the size of the minimum feedback vertex set in meshes and butterflies. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:5, pp:275-280 [Journal]
   
7. Subhamoy Maitra
   Highly nonlinear balanced Boolean functions with good local and global avalanche characteristics. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:5, pp:281-286 [Journal]
   
8. Funda Ergün, Rakesh K. Sinha, Lisa Zhang
   An improved FPTAS for Restricted Shortest Path. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:5, pp:287-291 [Journal]
   
9. Gerard J. Chang
   Corrigendum to "The path-partition problem in block graphs". [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:5, pp:293- [Journal]