
Journals in DBLP
 Oren BenZwi, Oded Lachish, Ilan Newman
Lower bounds for testing Euclidean Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:6, pp:219225 [Journal]
 JunMing Xu, Chao Yang
Fault diameter of product graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:6, pp:226228 [Journal]
 Thierry Lecroq
Fast exact string matching algorithms. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:6, pp:229235 [Journal]
 François Laroussinie, Jeremy Sproston
State explosion in almostsure probabilistic reachability. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:6, pp:236241 [Journal]
 ChangHsiung Tsai
Cycles embedding in hypercubes with node failures. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:6, pp:242246 [Journal]
 Sidi Mohamed Sedjelmaci
JebeleanWeber's algorithm without spurious factors. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:6, pp:247252 [Journal]
 Nenad Obradoviç, Joseph Peters, Goran Ruzic
Efficient domination in circulant graphs with two chord lengths. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:6, pp:253258 [Journal]
 Deshi Ye, Guochuan Zhang
Maximizing the throughput of parallel jobs on hypercubes. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:6, pp:259263 [Journal]
