Journals in DBLP

Inf. Process. Lett.
2004, volume: 90, number: 5

1. Jean-Loup Guillaume, Matthieu Latapy
   Bipartite structure of all complex networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:5, pp:215-221 [Journal]
   
2. Mads Sig Ager, Olivier Danvy, Jan Midtgaard
   A functional correspondence between call-by-need evaluators and lazy abstract machines. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:5, pp:223-232 [Journal]
   
3. David P. Bunde
   SPT is optimally competitive for uniprocessor flow. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:5, pp:233-238 [Journal]
   
4. Petra Sparl, Janez Zerovnik
   2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:5, pp:239-246 [Journal]
   
5. Richard Parker, Andrew Plater
   Addition chains with a bounded number of registers. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:5, pp:247-252 [Journal]
   
6. Sang-Wook Kim, Dae-Hyun Park, Heon-Gil Lee
   Efficient processing of subsequence matching with the Euclidean metric in time-series databases. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:5, pp:253-260 [Journal]
   
7. Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna
   The complexity of deciding stability under FFS in the Adversarial Queueing model. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:5, pp:261-266 [Journal]
   
8. Mark Weston
   A fixed-parameter tractable algorithm for matrix domination. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:5, pp:267-272 [Journal]