Journals in DBLP

Inf. Process. Lett.
1999, volume: 69, number: 6

1. Stasys Jukna
   Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:6, pp:267-269 [Journal]
   
2. Manfred Göbel
   A Rewriting Technique for Universal Polynomial Invariants. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:6, pp:271-273 [Journal]
   
3. Zhaohui Liu, Wenci Yu, T. C. Edwin Cheng
   Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:6, pp:275-281 [Journal]
   
4. Marek Chrobak, Christoph Dürr
   Reconstructing hv-Convex Polyominoes from Orthogonal Projections. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:6, pp:283-289 [Journal]
   
5. Yannick Saouter, Hervé Le Verge
   Computability of Affine Non-Conditional Recurrent Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:6, pp:291-295 [Journal]
   
6. Wen-Guey Tzeng, Chi-Ming Hu
   Inter-Protocol Interleaving Attacks on Some Authentication and Key Distribution Protocols. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:6, pp:297-302 [Journal]
   
7. H. Manos
   Construction of Halvers. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:6, pp:303-307 [Journal]
   
8. Lance Fortnow
   Relativized Worlds with an Infinite Hierarchy. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:69, n:6, pp:309-313 [Journal]