
Journals in DBLP
 ChienYuan Chen, ChinChen 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:34, pp:7781 [Journal]
 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:34, pp:8390 [Journal]
 Michel Raynal, Frederic Tronel
Restricted failure detectors: Definition and reduction protocols. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:72, n:34, pp:9197 [Journal]
 Graham M. Megson, Xiaofan Yang, Xiaoping Liu
Honeycomb tori are Hamiltonian. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:72, n:34, pp:99103 [Journal]
 Samir Khuller
An O(V2) algorithm for single connectedness. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:72, n:34, pp:105107 [Journal]
 ChangHsiung Tsai, ChunNan Hung, LihHsing Hsu, ChungHaw Chang
The correct diameter of trivalent Cayley graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:72, n:34, pp:109111 [Journal]
 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:34, pp:113118 [Journal]
 Yann Verhoeven
Random 2SAT and unsatisfiability. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:72, n:34, pp:119123 [Journal]
 Christian Lavault, Sidi Mohamed Sedjelmaci
Worstcase analysis of Weber's GCD algorithm. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:72, n:34, pp:125130 [Journal]
 ShienChing Hwang, GenHuey Chen
A note on cycliccubes. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:72, n:34, pp:131135 [Journal]
 Tiziana Calamoneri, Annalisa Massini
An optimal layout of multigrid networks. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:72, n:34, pp:137141 [Journal]
 K. Sridharan
Computing two penetration measures for curved 2D objects. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:72, n:34, pp:143148 [Journal]
