
Journals in DBLP
 Igor Shparlinski, Arne Winterhof
Quantum period reconstruction of approximate sequences. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:103, n:6, pp:211215 [Journal]
 Shinichi Nakayama, Shigeru Masuyama
A polynomial time algorithm for obtaining minimum edge ranking on twoconnected outerplanar graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:103, n:6, pp:216221 [Journal]
 JunMing Xu, Qiang Zhu, Min Xu
Faulttolerant analysis of a class of networks. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:103, n:6, pp:222226 [Journal]
 Petri Kontkanen, Petri Myllymäki
A lineartime algorithm for computing the multinomial stochastic complexity. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:103, n:6, pp:227233 [Journal]
 Lutz Volkmann
Restricted arcconnectivity of digraphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:103, n:6, pp:234239 [Journal]
 Yun Sheng Chung, Chin Lung Lu, Chuan Yi Tang
Efficient algorithms for regular expression constrained sequence alignment. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:103, n:6, pp:240246 [Journal]
 Areej Zuhily, Alan Burns
Optimal (DJ)monotonic priority assignment. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:103, n:6, pp:247250 [Journal]
