Journals in DBLP

Inf. Process. Lett.
1996, volume: 57, number: 4

1. Yves Métivier, Nasser Saheb
   Medians and Centres of Polyominoes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:57, n:4, pp:175-181 [Journal]
   
2. Premkumar Vadapalli, Pradip K. Srimani
   Shortest Routing in Trivalent Cayley Graph Network. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:57, n:4, pp:183-188 [Journal]
   
3. Javed A. Aslam, Scott E. Decatur
   On the Sample Complexity of Noise-Tolerant Learning. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:57, n:4, pp:189-195 [Journal]
   
4. Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
   A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:57, n:4, pp:197-203 [Journal]
   
5. M. Manzur Murshed, M. Kaykobad
   Seek Distances in Two-Headed Disk Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:57, n:4, pp:205-209 [Journal]
   
6. Kenneth Baclawski, Dan A. Simovici
   A Characterization of the Information Content of a Classification. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:57, n:4, pp:211-214 [Journal]
   
7. Antonios Symvonis
   Routing on Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:57, n:4, pp:215-223 [Journal]
   
8. Margus Veanes, Jonas Barklund
   On the Number of Edges in Cycletrees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1996, v:57, n:4, pp:225-229 [Journal]