Journals in DBLP

Inf. Process. Lett.
1999, volume: 72, number: 3-4

1. Chien-Yuan Chen, Chin-Chen Chang
   A fast modular multiplication algorithm for calculating the product AB modulo N. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:72, n:3-4, pp:77-81 [Journal]
   
2. Martín Matamala, Klaus Meer
   On the computational structure of the connected components of a hard problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:72, n:3-4, pp:83-90 [Journal]
   
3. Michel Raynal, Frederic Tronel
   Restricted failure detectors: Definition and reduction protocols. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:72, n:3-4, pp:91-97 [Journal]
   
4. Graham M. Megson, Xiaofan Yang, Xiaoping Liu
   Honeycomb tori are Hamiltonian. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:72, n:3-4, pp:99-103 [Journal]
   
5. Samir Khuller
   An O(|V|2) algorithm for single connectedness. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:72, n:3-4, pp:105-107 [Journal]
   
6. Chang-Hsiung Tsai, Chun-Nan Hung, Lih-Hsing Hsu, Chung-Haw Chang
   The correct diameter of trivalent Cayley graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:72, n:3-4, pp:109-111 [Journal]
   
7. Ioan I. Macarie, Joel I. Seiferas
   Amplification of slight probabilistic advantage at absolutely no cost in space. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:72, n:3-4, pp:113-118 [Journal]
   
8. Yann Verhoeven
   Random 2-SAT and unsatisfiability. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:72, n:3-4, pp:119-123 [Journal]
   
9. Christian Lavault, Sidi Mohamed Sedjelmaci
   Worst-case analysis of Weber's GCD algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:72, n:3-4, pp:125-130 [Journal]
   
10. Shien-Ching Hwang, Gen-Huey Chen
    A note on cyclic-cubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:3-4, pp:131-135 [Journal]
    
11. Tiziana Calamoneri, Annalisa Massini
    An optimal layout of multigrid networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:3-4, pp:137-141 [Journal]
    
12. K. Sridharan
    Computing two penetration measures for curved 2D objects. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:3-4, pp:143-148 [Journal]