|
Journals in DBLP
- Yongge Wang
NP-Hard Sets are Superterse Unless NP is Small. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:1-6 [Journal]
- Martin Farach, S. Muthukrishnan
Optimal Parallel Randomized Renaming. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:7-10 [Journal]
- Gow-Hsing King, Wen-Guey Tzeng
On-Line Algorithms for the Dominating Set Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:11-14 [Journal]
- Jacob Kornerup
Odd-Even Sort in Powerlists. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:15-24 [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:25-30 [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:31-36 [Journal]
- Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, Athanasios K. Tsakalidis
The Space-Optimal Version of a Known Rectangle Enclosure Reporting Algorithm. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:37-41 [Journal]
- Yaagoub Ashir, Iain A. Stewart, Aqeel Ahmed
Communication Algorithms in k-Ary n-Cube Interconnection Networks. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:43-48 [Journal]
- Avrim Blum, David R. Karger
An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:1, pp:49-53 [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:55-61 [Journal]
|