Journals in DBLP

Inf. Process. Lett.
2004, volume: 89, number: 1

1. Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini
   Epsilon-transitions in Concurrent Timed Automata. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:1, pp:1-7 [Journal]
   
2. Iiro S. Honkala, Tero Laihonen
   On identifying codes in the hexagonal mesh. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:1, pp:9-14 [Journal]
   
3. Doratha E. Drake, Stefan Hougardy
   On approximation algorithms for the terminal Steiner tree problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:1, pp:15-18 [Journal]
   
4. Timothy M. Chan
   A note on maximum independent sets in rectangle intersection graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:1, pp:19-23 [Journal]
   
5. Millist W. Vincent, Jixue Liu
   Irrelevant updates and self-maintainability in transitive closure database views. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:1, pp:25-29 [Journal]
   
6. Floris Geerts, Bart Kuijpers
   Topological formulation of termination properties of iterates of functions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:1, pp:31-35 [Journal]
   
7. Gunter Grieser, Steffen Lange
   Incremental learning of approximations from positive data. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:1, pp:37-42 [Journal]
   
8. N. V. Vinodchandran
   AM_exp[nsube](NP[cap]coNP)/poly. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:1, pp:43-47 [Journal]
   
9. Bruce K. Durgan
   Compact searchable static binary trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:1, pp:49-52 [Journal]