The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2007, volume: 103, number: 6

  1. Igor Shparlinski, Arne Winterhof
    Quantum period reconstruction of approximate sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:6, pp:211-215 [Journal]
  2. Shin-ichi Nakayama, Shigeru Masuyama
    A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:6, pp:216-221 [Journal]
  3. Jun-Ming Xu, Qiang Zhu, Min Xu
    Fault-tolerant analysis of a class of networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:6, pp:222-226 [Journal]
  4. Petri Kontkanen, Petri Myllymäki
    A linear-time algorithm for computing the multinomial stochastic complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:6, pp:227-233 [Journal]
  5. Lutz Volkmann
    Restricted arc-connectivity of digraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:6, pp:234-239 [Journal]
  6. 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:240-246 [Journal]
  7. Areej Zuhily, Alan Burns
    Optimal (D-J)-monotonic priority assignment. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:6, pp:247-250 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002