The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2003, volume: 87, number: 2

  1. Robert A. Hochberg, Matthias F. M. Stallmann
    Optimal one-page tree embeddings in linear time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:59-66 [Journal]
  2. Salvatore Ruggieri
    On computing the semi-sum of two integers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:67-71 [Journal]
  3. Richard Nock, Tapio Elomaa, Matti Kääriäinen
    Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:73-78 [Journal]
  4. Harry Buhrman, Ronald de Wolf
    Quantum zero-error algorithms cannot be composed. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:79-84 [Journal]
  5. Michael L. Fredman
    The number of tests required to search an unordered table. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:85-88 [Journal]
  6. Chin-Chia Wu, Wen-Chiung Lee
    Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:89-93 [Journal]
  7. Khaled A. S. Abdel-Ghaffar
    Maximum number of edges joining vertices on a cube. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:95-99 [Journal]
  8. Minghui Jiang, Jianbo Qian, Zhongping Qin, Binhai Zhu, Robert J. Cimikowski
    A simple factor-3 approximation for labeling points with circles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:101-105 [Journal]
  9. Tseng-Kuei Li, Chang-Hsiung Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu
    Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:107-110 [Journal]
  10. Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura
    Inclusion-exclusion for k-CNF formulas. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:111-117 [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