02250nam 2200445 450 991037666040332120190619190106.01-61197-308-2(CKB)3460000000103565(OCoLC)1105039503(CaBNVSL)thg00979165(EXLCZ)993460000000103565PR138SIAM20190617d2011 uy 0engur|||||||||||rdacontentisbdmediardacarrierProceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms /Dana Randall, 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),[2011]PDFs (xviii, 1788 pages) illustrationsProceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, january 23-25, 2011.0-89871-993-3 Includes bibliographical references and index.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.1Randall Dana991000Randall DanaAssociation for Computing Machinery-Digital Library.CaBNVSLCaBNVSLCaBNVSLBOOK9910376660403321Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms2267570UNINA