Volume 61,
Number 1,
14 January 1997
- Yongge Wang:
NP-Hard Sets are Superterse Unless NP is Small.
1-6
Electronic Edition (link) BibTeX
- Martin Farach, S. Muthukrishnan:
Optimal Parallel Randomized Renaming.
7-10
Electronic Edition (link) BibTeX
- Gow-Hsing King, Wen-Guey Tzeng:
On-Line Algorithms for the Dominating Set Problem.
11-14
Electronic Edition (link) BibTeX
- Jacob Kornerup:
Odd-Even Sort in Powerlists.
15-24
Electronic Edition (link) BibTeX
- Toru Hasunuma, Yukio Shibata:
Containment of Butterflies in Networks Constructed by the Line Digraph Operation.
25-30
Electronic Edition (link) BibTeX
- Sidi Mohamed Sedjelmaci, Christian Lavault:
Improvements on the Accelerated Integer GCD Algorithm.
31-36
Electronic Edition (link) BibTeX
- Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, Athanasios K. Tsakalidis:
The Space-Optimal Version of a Known Rectangle Enclosure Reporting Algorithm.
37-41
Electronic Edition (link) BibTeX
- Yaagoub Ashir, Iain A. Stewart, Aqeel Ahmed:
Communication Algorithms in k-Ary n-Cube Interconnection Networks.
43-48
Electronic Edition (link) BibTeX
- Avrim Blum, David R. Karger:
An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs.
49-53
Electronic Edition (link) BibTeX
- Steve Taylor, Nabil I. Hachem, Stanley M. Selkow:
The Average Height of a Node in the BANG Abstract Directory Tree.
55-61
Electronic Edition (link) BibTeX
Volume 61,
Number 2,
28 January 1997
Volume 61,
Number 3,
February 1997
Volume 61,
Number 4,
28 February 1997
Volume 61,
Number 5,
14 March 1997
Volume 61,
Number 6,
28 March 1997
Copyright © Sun May 17 00:04:03 2009
by Michael Ley (ley@uni-trier.de)
