Algorithms

Tetsuo Asano

ISBN 10: 3540529217 / ISBN 13: 9783540529217

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1990, 1990

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -This is the proceedings of the SIGAL International Symposium on Algorithms held at CSK Information Education Center, Tokyo, Japan, August 16-18, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 6-8 research meetings each year. This symposium is the first international symposium organized by SIGAL. In response to the call for papers, 88 papers were submitted from around the world. The program committee selected 34 for presentation at the symposium. The symposium also included 5 invited lectures and 10 invited presentations. The subjects of the papers range widely in the field of discrete algorithms in theoretical computer science. Keywords for these subjects are: computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing, and computational algebra. 492 pp. Englisch.

Seller Inventory # 9783540529217

Bibliographic Details

• Title: Algorithms
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1990
• Publication Date: 1990
• Language: English
• ISBN 10: 3540529217
• ISBN 13: 9783540529217
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 27D millimeters 235 millimeters width by 155 millimeters height by 27 millimeters depth
• Weight: 739 grams

About this title

Synopsis

This is the proceedings of the SIGAL International Symposium on Algorithms held at CSK Information Education Center, Tokyo, Japan, August 16-18, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 6-8 research meetings each year. This symposium is the first international symposium organized by SIGAL. In response to the call for papers, 88 papers were submitted from around the world. The program committee selected 34 for presentation at the symposium. The symposium also included 5 invited lectures and 10 invited presentations. The subjects of the papers range widely in the field of discrete algorithms in theoretical computer science. Keywords for these subjects are: computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing, and computational algebra.