Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Author(s)
Bibliographic Information
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Association for Computing Machinery , Society for Industrial and Applied Mathematics, c2002
Available at 11 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
The University of Electro-Communications Library研
549.98/A15/20022001108355,2002100470,2002102942
Note
"Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, January 6-8, 2002" -- T.p. verso
"This symposium was sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics." -- T.p. verso
Includes bibliographical references and index
Description and Table of Contents
Description
The Symposium was jointly sponsored by the SIAM Activity Group on Discrete Mathematics and by SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. Contains approximately 130 papers that were selected from a field of over 325 submissions based on their originality, technical contribution, and relevance. Papers cover such topics as discrete mathematics and graph theory, including combinatorics, combinatorial optimisation, and networks. Although the papers were not formally refereed, every attempt was made to verify the main claims. Abbreviated versions of these papers may appear later in more elaborate form in various scientific journals. This symposium concerns research on the use, design, and analysis of efficient algorithms and data structures, and on the mathematical problems related to the development and analysis of discrete algorithms.
Application areas include, but are not limited to, discrete mathematics and combinatorics; combinatorial structures; communication networks; computational biology; computational physics; computational finance; computational geometry; computational topology; computer graphics and computer vision; computer systems; cryptography and security; databases and information retrieval; discrete optimisation; discrete probability; distributed algorithms; experimental algorithmics; graph drawing; graphs and networks; machine learning; mathematical programming; molecular computing; number theory and algebra; on-line problems; pattern matching and data compression; quantum computing; random structures; robotics; statistical inference; and symbolic computation. The proceeding's content reflects the themes of the meeting.
by "Nielsen BookData"