Journals in DBLP

Inf. Process. Lett.
2004, volume: 92, number: 4

1. San Skulrattanakulchai
   Acyclic colorings of subcubic graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:4, pp:161-167 [Journal]
   
2. Jens Lechtenbörger
   Computing unique canonical covers for simple FDs via transitive reduction. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:4, pp:169-174 [Journal]
   
3. Irit Katriel
   On the algebraic complexity of set equality and inclusion. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:4, pp:175-178 [Journal]
   
4. Abul Kashem, M. Ziaur Rahman
   An optimal parallel algorithm for c-vertex-ranking of trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:4, pp:179-184 [Journal]
   
5. Aaron Windsor
   A simple proof that finding a maximal independent set in a graph is in NC. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:4, pp:185-187 [Journal]
   
6. Soumen Maity, Amiya Nayak, Bimal K. Roy
   Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:4, pp:189-197 [Journal]
   
7. Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci
   Cryptographic key assignment schemes for any access control policy. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:4, pp:199-205 [Journal]
   
8. Lars Engebretsen
   Simplified tight analysis of Johnson's algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:4, pp:207-210 [Journal]