
Journals in DBLP
 Wlodzimierz Ogryczak, Arie Tamir
Minimizing the sum of the k largest functions in linear time. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:3, pp:117122 [Journal]
 Hélène Touzet
Tree edit distance with gaps. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:3, pp:123129 [Journal]
 Ying Miao
A combinatorial characterization of regular anonymous perfect threshold schemes. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:3, pp:131135 [Journal]
 Zuhua Shao
Proxy signature schemes based on factoring. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:3, pp:137143 [Journal]
 Dhananjay M. Dhamdhere, K. Gururaja, Prajakta G. Ganu
A compact execution history for dynamic slicing. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:3, pp:145152 [Journal]
 Chris Giannella, Edward L. Robertson
A note on approximation measures for multivalued dependencies in relational databases. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:3, pp:153158 [Journal]
 TsungChuan Huang, SloLi Chu
A statement based parallelizing framework for processorinmemory architectures. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:3, pp:159163 [Journal]
 Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo
Kinetic heapordered trees: Tight analysis and improved algorithms. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:3, pp:165169 [Journal]
