Volume 39,
Number 1,
12 July 1991
Volume 39,
Number 2,
31 July 1991
Volume 39,
Number 3,
16 August 1991
Volume 39,
Number 4,
30 August 1991
Volume 39,
Number 5,
13 September 1991
- Achim Schweikard:
Trigonometric Polynomials with Simple Roots.
231-236 BibTeX
- Abhay K. Parekh:
Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs.
237-240 BibTeX
- Maurizio Tucci, Gennaro Costagliola, Shi-Kuo Chang:
A Remark on NP-Completeness of Picture Matching.
241-243 BibTeX
- Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis:
The Complexity of the Reliable Connectivity Problem.
245-252 BibTeX
- Prabhakar Ragde:
Analysis of an Asynchronous PRAM Algorithm.
253-256 BibTeX
- D. Sreenivasa Rao, John D. Provence:
An Integrated Approach to Routing and Via Minimization.
257-263 BibTeX
- Jan L. A. van de Snepscheut:
Inversion of a Recursive Tree Traversal.
265-267 BibTeX
- Coenraad Bron, Wim H. Hesselink:
Smoothsort Revisited.
269-276 BibTeX
- Lih-Hsing Hsu, Rong-Hong Jan, Yu-Che Lee, Chun-Nan Hung, Maw-Sheng Chern:
Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs.
277-281 BibTeX
- Jae Dong Yang, Yoon-Joon Lee:
A Sound and Complete Query Evaluation for Implicit Predicate which is a Semantic Descriptor of Unknown Values.
283-289 BibTeX
Volume 39,
Number 6,
27 September 1991
Copyright © Sun May 17 00:04:01 2009
by Michael Ley (ley@uni-trier.de)