
Journals in DBLP
 Yongge Wang
NPHard Sets are Superterse Unless NP is Small. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:16 [Journal]
 Martin Farach, S. Muthukrishnan
Optimal Parallel Randomized Renaming. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:710 [Journal]
 GowHsing King, WenGuey Tzeng
OnLine Algorithms for the Dominating Set Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:1114 [Journal]
 Jacob Kornerup
OddEven Sort in Powerlists. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:1524 [Journal]
 Toru Hasunuma, Yukio Shibata
Containment of Butterflies in Networks Constructed by the Line Digraph Operation. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:2530 [Journal]
 Sidi Mohamed Sedjelmaci, Christian Lavault
Improvements on the Accelerated Integer GCD Algorithm. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:3136 [Journal]
 Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, Athanasios K. Tsakalidis
The SpaceOptimal Version of a Known Rectangle Enclosure Reporting Algorithm. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:3741 [Journal]
 Yaagoub Ashir, Iain A. Stewart, Aqeel Ahmed
Communication Algorithms in kAry nCube Interconnection Networks. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:4348 [Journal]
 Avrim Blum, David R. Karger
An Õ(n^{3/14})Coloring Algorithm for 3Colorable Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:4953 [Journal]
 Steve Taylor, Nabil I. Hachem, Stanley M. Selkow
The Average Height of a Node in the BANG Abstract Directory Tree. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:5561 [Journal]
