{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:37Z","timestamp":1750307197561,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,11,12]],"date-time":"2011-11-12T00:00:00Z","timestamp":1321056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["S10608 (NFN SISE)"],"award-info":[{"award-number":["S10608 (NFN SISE)"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,11,12]]},"DOI":"10.1145\/2063384.2063483","type":"proceedings-article","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T13:32:09Z","timestamp":1320759129000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A fast solver for modeling the evolution of virus populations"],"prefix":"10.1145","author":[{"given":"Gerhard","family":"Niederbrucker","sequence":"first","affiliation":[{"name":"University of Vienna"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wilfried N.","family":"Gansterer","sequence":"additional","affiliation":[{"name":"University of Vienna"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,11,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"Cormen , T. H. , Stein , C. , Rivest , R. L. , and Leiserson , C. E . Introduction to Algorithms , 2 nd ed. McGraw-Hill Higher Education , 2001 . Cormen, T. H., Stein, C., Rivest, R. L., and Leiserson, C. E. Introduction to Algorithms, 2nd ed. McGraw-Hill Higher Education, 2001.","edition":"2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.90.9.4171"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00047282"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756269.1756288"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00623322"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.212514799"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00450633"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674569"},{"key":"e_1_3_2_1_9_1","first-page":"369","article-title":"A parallel quasi-monte carlo method for computing extremal eigenvalues","volume":"2000","author":"Mascagni M.","year":"2000","unstructured":"Mascagni , M. , and Karaivanova , A . A parallel quasi-monte carlo method for computing extremal eigenvalues . Monte Carlo and Quasi-Monte Carlo Methods 2000 ( 2000 ), 369 -- 380 . Mascagni, M., and Karaivanova, A. A parallel quasi-monte carlo method for computing extremal eigenvalues. Monte Carlo and Quasi-Monte Carlo Methods 2000 (2000), 369--380.","journal-title":"Monte Carlo and Quasi-Monte Carlo Methods"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2011.04.014"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-5193(89)80036-0"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00275509"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1088\/0034-4885\/69\/5\/R04"},{"key":"e_1_3_2_1_14_1","volume-title":"The mathematics of Darwinian systems","author":"Schuster P.","year":"2008","unstructured":"Schuster , P. The mathematics of Darwinian systems . 2008 . Appendix for the book: Manfred Eigen, 'From Strange Simplicity to Complex Familiarity, Vol .I'. Schuster, P. The mathematics of Darwinian systems. 2008. Appendix for the book: Manfred Eigen, 'From Strange Simplicity to Complex Familiarity, Vol.I'."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12064-010-0110-z"},{"key":"e_1_3_2_1_16_1","volume-title":"Non-negative Matrices and Markov Chains","author":"Seneta E.","year":"2006","unstructured":"Seneta , E. Non-negative Matrices and Markov Chains (Springer Series in Statistics). Springer , January 2006 . Seneta, E. Non-negative Matrices and Markov Chains (Springer Series in Statistics). Springer, January 2006."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0301-4622(82)87037-3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00393-9"}],"event":{"name":"SC '11: International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS Computer Society"],"location":"Seattle Washington","acronym":"SC '11"},"container-title":["Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063384.2063483","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2063384.2063483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:08Z","timestamp":1750241168000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063384.2063483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,12]]},"references-count":18,"alternative-id":["10.1145\/2063384.2063483","10.1145\/2063384"],"URL":"https:\/\/doi.org\/10.1145\/2063384.2063483","relation":{},"subject":[],"published":{"date-parts":[[2011,11,12]]},"assertion":[{"value":"2011-11-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}