Journals in DBLP

Inf. Process. Lett.
2003, volume: 85, number: 3

1. 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:117-122 [Journal]
   
2. Hélène Touzet
   Tree edit distance with gaps. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:85, n:3, pp:123-129 [Journal]
   
3. 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:131-135 [Journal]
   
4. Zuhua Shao
   Proxy signature schemes based on factoring. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:85, n:3, pp:137-143 [Journal]
   
5. 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:145-152 [Journal]
   
6. Chris Giannella, Edward L. Robertson
   A note on approximation measures for multi-valued dependencies in relational databases. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:85, n:3, pp:153-158 [Journal]
   
7. Tsung-Chuan Huang, Slo-Li Chu
   A statement based parallelizing framework for processor-in-memory architectures. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:85, n:3, pp:159-163 [Journal]
   
8. Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo
   Kinetic heap-ordered trees: Tight analysis and improved algorithms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:85, n:3, pp:165-169 [Journal]