Journals in DBLP

Inf. Process. Lett.
1993, volume: 45, number: 5

1. Michael Buro
   On the Maximum Length of Huffman Codes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:5, pp:219-223 [Journal]
   
2. Steven Cheung, Francis C. M. Lau
   A Lower Bound for Permutation Routing on Two-Dimensional Bused Meshes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:5, pp:225-228 [Journal]
   
3. Jeremy Spinrad
   Doubly Lexical Ordering of Dense 0 - 1 Matrices. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:5, pp:229-235 [Journal]
   
4. Philipp Hanschke, Jörg Würtz
   Satisfiability of the Smallest Binary Program. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:5, pp:237-241 [Journal]
   
5. A. Bijlsma
   Quasi-Boolean Equivalence. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:5, pp:243-247 [Journal]
   
6. Roberto De Prisco, Alfredo De Santis
   On Binary Search Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:5, pp:249-253 [Journal]
   
7. Jian Lu
   Parallelizing Mallat Algorithm for 2-D Wavelet Transforms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:5, pp:255-259 [Journal]
   
8. D. T. Lee, Evanthia Papadopoulou
   The All-Pairs Quickest Path Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:5, pp:261-267 [Journal]
   
9. Matthew Dickerson, Jason Shugart
   A Simple Algorithm for Enumerating Longest Distances in the Plane. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:5, pp:269-274 [Journal]