ISA '91 Algorithms : 2nd International Symposium on Algorithms, Taipei, Republic of China, December 16-18, 1991. Proceedings. 1st ed. 1991

種類:

電子ブック

責任表示:

edited by Wen-Lian Hsu, R.C.T. Lee

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1991

著者名:

• Hsu, Wen-Lian.
• Lee, R.C.T.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 557

ISBN:

9783540466000 [3540466002]    

注記:

Decision-making with incomplete information -- Maximum independet set of a permutation graph in k tracks -- Algorithms for square roots of graphs -- Distributed k-mutual exclusion problem and k-coteries -- Is the shuffle-exchange better than the butterfly? -- Weighted random assignments with application to hashing -- Scheduling file transfers under port and channel constraints -- Substitution decomposition on chordal graphs and applications -- Mixed-searching and proper-path-width -- Short wire routing in convex grids -- A new approach to knock-knee channel routing -- Circuit partitioning algorithms: Graph model versus geometry model -- Identifying 2-monotonic positive boolean functions in polynomial time -- An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm -- An on-line algorithm for navigating in unknown terrain -- On maintaining the width and diameter of a planar point-set online -- Optimal triangulations by retriangulating -- Approximating polygons and subdivisions
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 University. 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.

ローカル注記:

学内専用E-BOOKS (local access only)