The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Oren Ben-Zwi, 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:219-225 [Journal]
  2. Jun-Ming Xu, Chao Yang
    Fault diameter of product graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:6, pp:226-228 [Journal]
  3. Thierry Lecroq
    Fast exact string matching algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:6, pp:229-235 [Journal]
  4. François Laroussinie, Jeremy Sproston
    State explosion in almost-sure probabilistic reachability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:6, pp:236-241 [Journal]
  5. Chang-Hsiung Tsai
    Cycles embedding in hypercubes with node failures. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:6, pp:242-246 [Journal]
  6. Sidi Mohamed Sedjelmaci
    Jebelean-Weber's algorithm without spurious factors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:6, pp:247-252 [Journal]
  7. 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:253-258 [Journal]
  8. 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:259-263 [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