Algorithms

Tetsuo Asano

ISBN 10: 3540529217 / ISBN 13: 9783540529217

Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1990, 1990

Beschreibung

This item is printed on demand - Print on Demand Titel. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 492 pp. Englisch.

Bestandsnummer des Verkäufers 9783540529217

Bibliografische Details

• Titel: Algorithms
• Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1990
• Erscheinungsjahr: 1990
• Sprache: Englisch
• ISBN-10: 3540529217
• ISBN-13: 9783540529217
• Einband: Taschenbuch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

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.