Journals in DBLP

Inf. Process. Lett.
2004, volume: 92, number: 5

1. Tatjana Petkovic, Miroslav Ciric, Stojan Bogdanovic
   Minimal forbidden subwords. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:5, pp:211-218 [Journal]
   
2. Donglei Du
   Optimal preemptive semi-online scheduling on two uniform processors. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:5, pp:219-223 [Journal]
   
3. Eberhard Bertsch, Mark-Jan Nederhof
   Fast parallel recognition of LR language suffixes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:5, pp:225-229 [Journal]
   
4. Ku-Young Chang, Howon Kim, Ju-Sung Kang, Hyun-Sook Cho
   An extension of TYT algorithm for GF((2n)m) using precomputation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:5, pp:231-234 [Journal]
   
5. Jack H. Lutz
   Computability versus exact computability of martingales. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:5, pp:235-237 [Journal]
   
6. K. S. Cheung
   New characterization for live and reversible augmented marked graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:5, pp:239-243 [Journal]
   
7. Amit Weisman, L. Paul Chew, Klara Kedem
   Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:5, pp:245-251 [Journal]
   
8. Owen Kaser
   Compressing arrays by ordering attribute values. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:5, pp:253-256 [Journal]
   
9. Eyas El-Qawasmeh
   Word prediction using a clustered optimal binary search tree. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:92, n:5, pp:257-265 [Journal]