LEADER 02007nam  2200421   450 
001 9910375770503321
005 20230824151315.0
010   $a1-61197-548-4
035   $a(CKB)4100000007389441
035   $a(OCoLC)1105039710
035   $a(CaBNVSL)thg00979173
035   $a(EXLCZ)994100000007389441
071 51$aPRDA19$bSIAM
100   $a20190617d2019      uy             0
101 0 $aeng
135   $aur|||||||||||
181   $2rdacontent
182   $2isbdmedia
183   $2rdacarrier
200 10$aProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms /$f[editor] Timothy M. Chan
210  1$aPhiladelphia, Pennsylvania :$cSociety for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104),$d[2019]
215   $aPDFs (ix, 2972 pages) $cillustrations
320   $aIncludes bibliographical references.
330 3 $aThis 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.
606   $aComputer algorithms$vCongresses
610   $aDiscrete mathematics and graph theory
615  0$aComputer algorithms
676   $a005.1
700   $aChan$b Timothy M$0908884
702   $aChan$b Timothy M.
712 02$aAssociation for Computing Machinery-Digital Library.
801  0$bCaBNVSL
801  1$bCaBNVSL
801  2$bCaBNVSL
906   $aBOOK
912   $a9910375770503321
996   $aProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms$92032817
997   $aUNINA