About these proceedings
This volume presents the proceedings of the Second Annual
International Symposium on Algorithms held at Academia
Sinica, Taipei, Republic of China, December 16-18, 1991. The
symposium was organized by the Institute of Information
Science, Academia Sinica, and the National Tsing Hua
In response to the program committee's call for papers, 90
papers were submitted, from which the committee selected 36
for presentation at the symposium. In addition to these
contributed papers, the symposium included 5 invited talks.
The subjects of the papers range widely in the area of
discrete algorithms, over such topics as computational
geometry, graph algorithms, complexity theory, parallel
algorithms, distributed computing and computational algebra.
Complexity Theory Computational Geometry Distributed Computing Graph Algorithms Graph-Algorithmen Komplexitätstheorie Matchings Parallel Algorithms Parallele Algorithmen Partition Verteiltes Rechnen algorithms complexity geometry statistics