{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,27]],"date-time":"2025-12-27T07:28:49Z","timestamp":1766820529804,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T00:00:00Z","timestamp":1484179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1,12]]},"DOI":"10.1145\/3040718.3040721","type":"proceedings-article","created":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T12:47:40Z","timestamp":1491396460000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax"],"prefix":"10.1145","author":[{"given":"Moritz","family":"M\u00fchlenthaler","sequence":"first","affiliation":[{"name":"TU Dortmund, Dortmund, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Ra\u00df","sequence":"additional","affiliation":[{"name":"University of Erlangen-Nuremberg, Erlangen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Schmitt","sequence":"additional","affiliation":[{"name":"University of Erlangen-Nuremberg, Erlangen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Siegling","sequence":"additional","affiliation":[{"name":"University of Erlangen-Nuremberg, Erlangen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Wanka","sequence":"additional","affiliation":[{"name":"University of Erlangen-Nuremberg, Erlangen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,1,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39930-8_8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1276964"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860734-7\/50098-6"},{"key":"e_1_3_2_1_4_1","unstructured":"S. Droste T. Jansen and I. Wegener. On the analysis of the (1  S. Droste T. Jansen and I. Wegener. On the analysis of the (1"},{"volume-title":"Theoretical Computer Science, 276(1):51--81","year":"2002","key":"e_1_3_2_1_5_1","unstructured":"1 ) evolutionary algorithm. Theoretical Computer Science, 276(1):51--81 , 2002 . 1) evolutionary algorithm. Theoretical Computer Science, 276(1):51--81, 2002."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36494-3_37"},{"key":"e_1_3_2_1_8_1","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"Graham R. L.","year":"1994","unstructured":"R. L. Graham , D. E. Knuth , and O. Patashnik . Concrete Mathematics: A Foundation for Computer Science . Addison-Wesley Longman , 2 nd edition, 1994 . R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Longman, 2nd edition, 1994.","edition":"2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23857-4_40"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9134-2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10596-009-9142-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185365"},{"issue":"2","key":"e_1_3_2_1_16_1","first-page":"243","article-title":"Hypergeometric solutions of linear recurrences with polynomial coefficients","volume":"14","author":"M.","year":"1992","unstructured":"M. Petkov\\v sek. Hypergeometric solutions of linear recurrences with polynomial coefficients . Journal of Symbolic Computation , 14 ( 2 ): 243 -- 264 , 1992 . M. Petkov\\v sek. Hypergeometric solutions of linear recurrences with polynomial coefficients. Journal of Symbolic Computation, 14(2):243--264, 1992.","journal-title":"Journal of Symbolic Computation"},{"key":"e_1_3_2_1_17_1","first-page":"232","article-title":"Particle swarm optimisation of hardness in nickel diamond electro composites","volume":"1","author":"Ramanathan K.","year":"2009","unstructured":"K. Ramanathan , V. M. Periasamy , M. Pushpavanam , and U. Natarajan . Particle swarm optimisation of hardness in nickel diamond electro composites . Archives of Computational Materials Science and Surface Engineering , 1 : 232 -- 236 , 2009 . K. Ramanathan, V. M. Periasamy, M. Pushpavanam, and U. Natarajan. Particle swarm optimisation of hardness in nickel diamond electro composites. Archives of Computational Materials Science and Surface Engineering, 1:232--236, 2009.","journal-title":"Archives of Computational Materials Science and Surface Engineering"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814612"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIBCB.2015.7300314"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389114"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.03.002"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2007.368038"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826068"},{"key":"e_1_3_2_1_26_1","first-page":"349","volume-title":"Evolutionary Optimization","author":"Wegener I.","year":"2002","unstructured":"I. Wegener . Evolutionary Optimization , chapter Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions, pages 349 -- 369 . Springer US , Boston, MA , 2002 . I. Wegener. Evolutionary Optimization, chapter Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions, pages 349--369. Springer US, Boston, MA, 2002."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.agrformet.2016.10.019"}],"event":{"name":"FOGA '17: Foundations of Genetic Algorithms XIV","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Copenhagen Denmark","acronym":"FOGA '17"},"container-title":["Proceedings of the 14th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3040718.3040721","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3040718.3040721","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:57Z","timestamp":1750273497000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3040718.3040721"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,12]]},"references-count":26,"alternative-id":["10.1145\/3040718.3040721","10.1145\/3040718"],"URL":"https:\/\/doi.org\/10.1145\/3040718.3040721","relation":{},"subject":[],"published":{"date-parts":[[2017,1,12]]},"assertion":[{"value":"2017-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}