Journals in DBLP
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ]