Kuan-Yu Chen, Kun-Mao Chao Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:96, n:6, pp:197-201 [Journal]
Stasys Jukna On the P versus NP intersected with co-NP question in communication complexity. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:96, n:6, pp:202-206 [Journal]
Eduardo Moreno De Bruijn sequences and De Bruijn graphs for a general language. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:96, n:6, pp:214-219 [Journal]