Journals in DBLP

Inf. Process. Lett.
2003, volume: 86, number: 5

1. Rafiqul Islam, Nasim Adnan, Nur Islam, Shohorab Hossen
   A new external sorting algorithm with no additional disk space. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:5, pp:229-233 [Journal]
   
2. Henning Fernau, Alexander Meduna
   A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:5, pp:235-240 [Journal]
   
3. Sabrina Mantaci, Antonio Restivo, Marinella Sciortino
   Burrows-Wheeler transform and Sturmian words. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:5, pp:241-246 [Journal]
   
4. Alexander Okhotin
   The hardest linear conjunctive language. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:5, pp:247-253 [Journal]
   
5. Marc Chemillier, Charlotte Truchet
   Computation of words satisfying the "rhythmic oddity property" (after Simha Arom's works). [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:5, pp:255-261 [Journal]
   
6. Shin-Shin Kao, Lih-Hsing Hsu
   Brother trees: A family of optimal 1_p-hamiltonian and 1-edge hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:5, pp:263-269 [Journal]
   
7. Chun-Nan Hung, Hong-Chun Hsu, Kao-Yung Liang, Lih-Hsing Hsu
   Ring embedding in faulty pancake graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:5, pp:271-275 [Journal]
   
8. Leonid Libkin
   A collapse result for constraint queries over structures of small degree. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:5, pp:277-281 [Journal]
   
9. Manuel Abellanas, Ferran Hurtado, Vera Sacristan, Christian Icking, Lihong Ma, Rolf Klein, Elmar Langetepe, Belén Palop
   Voronoi Diagram for services neighboring a highway. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:5, pp:283-288 [Journal]