Journals in DBLP

Inf. Process. Lett.
2005, volume: 93, number: 6

1. Frank Nielsen, Richard Nock
   A fast deterministic smallest enclosing disk approximation algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:6, pp:263-268 [Journal]
   
2. Ryoichi Kato, Osamu Watanabe
   Substring search and repeat search using factor oracles. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:6, pp:269-274 [Journal]
   
3. Sung Kwon Kim
   Finding a longest nonnegative path in a constant degree tree. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:6, pp:275-279 [Journal]
   
4. K. Rustan M. Leino
   Efficient weakest preconditions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:6, pp:281-288 [Journal]
   
5. Sibylle B. Fröschle
   The decidability border of hereditary history preserving bisimilarity. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:6, pp:289-293 [Journal]
   
6. Ruy Fabila Monroy, Jorge Urrutia
   Graham triangulations and triangulations with a center are hamiltonean. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:6, pp:295-299 [Journal]
   
7. Mikio Kano, Criel Merino, Jorge Urrutia
   On plane spanning trees and cycles of multicolored point sets with few intersections. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:6, pp:301-306 [Journal]
   
8. Thierry Garcia, David Semé
   A Coarse-Grained Multicomputer algorithm for the detection of repetitions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:93, n:6, pp:307-313 [Journal]