Journals in DBLP

Networks
1999, volume: 33, number: 4

1. Nicholas Pippenger
   Upper and lower bounds for the average-case complexity of path-search. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:4, pp:249-259 [Journal]
   
2. Gerard J. Chang, Frank K. Hwang, Li-Da Tong
   Characterizing bit permutation networks. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:4, pp:261-267 [Journal]
   
3. G. W. Richards, Frank K. Hwang
   Extended generalized shuffle networks: Ssufficient conditions for strictly nonblocking operation. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:4, pp:269-291 [Journal]
   
4. Yi Du, Gerald M. Masson
   Strictly nonblocking conference networks using high-dimensional meshes. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:4, pp:293-308 [Journal]