02409nam 2200517 450 991037638410332120170925023815.01-61197-310-4(CKB)3810000000000425(SSID)ssj0001341803(PQKBManifestationID)11751793(PQKBTitleCode)TC0001341803(PQKBWorkID)11278358(PQKB)11150869(OCoLC)889405799(CaBNVSL)thg00979167(WaSeSS)IndRDA00027577(EXLCZ)993810000000000425PR143SIAM20190617d2013 uy 0engur|||||||||||txtccrProceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms /Khanna Sanjeev, editorNew York [New York] :Association for Computing Machinery ;Philadelphia, Pennsylvania :Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104),[2013]PDFs (xix, 1915 pages) illustrationsBibliographic Level Mode of Issuance: Monograph1-61197-251-5 Includes bibliographical references.This symposium focuses on research topics related to efficient algorithms and data structures for discrete problems. In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis.Computer algorithmsCongressesDiscrete mathematics and graph theoryComputer algorithms005.1Khanna SanjeevSIAM Activity Group on Discrete MathematicsACM Special Interest Group for Algorithms and Computation TheoryCaBNVSLCaBNVSLCaBNVSLBOOK9910376384103321Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms1984265UNINA