
Journals in DBLP
 JeanLoup Guillaume, Matthieu Latapy
Bipartite structure of all complex networks. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:5, pp:215221 [Journal]
 Mads Sig Ager, Olivier Danvy, Jan Midtgaard
A functional correspondence between callbyneed evaluators and lazy abstract machines. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:5, pp:223232 [Journal]
 David P. Bunde
SPT is optimally competitive for uniprocessor flow. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:5, pp:233238 [Journal]
 Petra Sparl, Janez Zerovnik
2local 5/4competitive algorithm for multicoloring trianglefree hexagonal graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:5, pp:239246 [Journal]
 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:247252 [Journal]
 SangWook Kim, DaeHyun Park, HeonGil Lee
Efficient processing of subsequence matching with the Euclidean metric in timeseries databases. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:5, pp:253260 [Journal]
 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:261266 [Journal]
 Mark Weston
A fixedparameter tractable algorithm for matrix domination. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:5, pp:267272 [Journal]
