{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:28Z","timestamp":1759637608160,"version":"3.40.3"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581145"},{"type":"electronic","value":"9783030581152"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58115-2_43","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"619-633","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Exponential Upper Bounds for the Runtime of Randomized Search Heuristics"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2015.04.008","volume":"605","author":"Y Akimoto","year":"2015","unstructured":"Akimoto, Y., Morales, S.A., Teytaud, O.: Analysis of runtime of optimization algorithms for noisy functions over discrete codomains. Theor. Comput. Sci. 605, 42\u201350 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-99259-4_10","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"D Antipov","year":"2018","unstructured":"Antipov, D., Doerr, B.: Precise runtime analysis for plateaus. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 117\u2013128. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_10"},{"doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics. World Scientific Publishing (2011)","key":"43_CR3","DOI":"10.1142\/7438"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-99259-4_14","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"C Bian","year":"2018","unstructured":"Bian, C., Qian, C., Tang, K.: Towards a running time analysis of the $$(1+1)$$-EA for OneMax and LeadingOnes under general bit-wise noise. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 165\u2013177. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_14"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L Bianchi","year":"2009","unstructured":"Bianchi, L., Dorigo, M., Gambardella, L.M., Gutjahr, W.J.: A survey on metaheuristics for stochastic combinatorial optimization. Nat. Comput. 8, 239\u2013287 (2009). https:\/\/doi.org\/10.1007\/s11047-008-9098-4","journal-title":"Nat. Comput."},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15844-5_1","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S B\u00f6ttcher","year":"2010","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 1\u201310. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_1"},{"doi-asserted-by":"crossref","unstructured":"Colin, S., Doerr, B., F\u00e9rey, G.: Monotonic functions in EC: anything but monotone! In: Genetic and Evolutionary Computation Conference, GECCO 2014, pp. 753\u2013760. ACM (2014)","key":"43_CR7","DOI":"10.1145\/2576768.2598338"},{"doi-asserted-by":"crossref","unstructured":"Dang, D., Lehre, P.K.: Simplified runtime analysis of estimation of distribution algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2015, pp. 513\u2013518. ACM (2015)","key":"43_CR8","DOI":"10.1145\/2739480.2754814"},{"doi-asserted-by":"crossref","unstructured":"Dang-Nhu, R., Dardinier, T., Doerr, B., Izacard, G., Nogneng, D.: A new analysis method for evolutionary optimization of dynamic and noisy objective functions. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 1467\u20131474. ACM (2018)","key":"43_CR9","DOI":"10.1145\/3205455.3205563"},{"doi-asserted-by":"crossref","unstructured":"Doerr, B.: Exponential upper bounds for the runtime of randomized search heuristics. CoRR abs\/2004.05733 (2020)","key":"43_CR10","DOI":"10.1007\/978-3-030-58115-2_43"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., Ebel, F.: From black-box complexity to designing new genetic algorithms. Theor. Comput. Sci. 567, 87\u2013104 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00453-011-9585-3","volume":"65","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Goldberg, L.A.: Adaptive drift analysis. Algorithmica 65, 224\u2013250 (2013). https:\/\/doi.org\/10.1007\/s00453-011-9585-3","journal-title":"Algorithmica"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/EVCO_a_00055","volume":"21","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Jansen, T., Sudholt, D., Winzen, C., Zarges, C.: Mutation rate matters even when optimizing monotone functions. Evol. Comput. 21, 1\u201321 (2013)","journal-title":"Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 777\u2013784. ACM (2017)","key":"43_CR14","DOI":"10.1145\/3071178.3071301"},{"key":"43_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4","volume-title":"Theory of Evolutionary Computation-Recent Developments in Discrete Optimization","year":"2020","unstructured":"Doerr, B., Neumann, F. (eds.): Theory of Evolutionary Computation-Recent Developments in Discrete Optimization. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4"},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Sutton, A.M.: When resampling to cope with noise, use median, not mean. In: Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 242\u2013248. ACM (2019)","key":"43_CR16","DOI":"10.1145\/3321707.3321837"},{"key":"43_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1007\/978-3-540-24854-5_107","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"S Droste","year":"2004","unstructured":"Droste, S.: Analysis of the (1 + 1) EA for a noisy OneMax. In: Deb, K. (ed.) GECCO 2004. LNCS, vol. 3102, pp. 1088\u20131099. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24854-5_107"},{"key":"43_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0056845","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"S Droste","year":"1998","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the optimization of unimodal functions with the $$(1+1)$$ evolutionary algorithm. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 13\u201322. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056845"},{"key":"43_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276, 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR20","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2428556.2428575","volume":"56","author":"FV Fomin","year":"2013","unstructured":"Fomin, F.V., Kaski, P.: Exact exponential algorithms. Commun. ACM 56, 80\u201388 (2013)","journal-title":"Commun. ACM"},{"key":"43_CR21","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. TTCSAES. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7"},{"doi-asserted-by":"crossref","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Sutton, A.M.: Robustness of ant colony optimization to noise. In: Genetic and Evolutionary Computation Conference, GECCO 2015, pp. 17\u201324. ACM (2015)","key":"43_CR22","DOI":"10.1145\/2739480.2754723"},{"key":"43_CR23","first-page":"477","volume":"21","author":"T Friedrich","year":"2017","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Sutton, A.M.: The compact genetic algorithm is efficient under extreme Gaussian noise. IEEE Trans. Evol. Comput. 21, 477\u2013490 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"43_CR24","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evol. Comput. 7, 173\u2013203 (1999)","journal-title":"Evol. Comput."},{"key":"43_CR25","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s00453-015-0072-0","volume":"75","author":"C Gie\u00dfen","year":"2016","unstructured":"Gie\u00dfen, C., K\u00f6tzing, T.: Robustness of populations in stochastic environments. Algorithmica 75, 462\u2013489 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0072-0","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Happ, E., Johannsen, D., Klein, C., Neumann, F.: Rigorous analyses of fitness-proportional selection for optimizing linear functions. In: Genetic and Evolutionary Computation Conference, GECCO 2008, pp. 953\u2013960. ACM (2008)","key":"43_CR26","DOI":"10.1145\/1389095.1389277"},{"key":"43_CR27","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127, 51\u201381 (2001)","journal-title":"Artif. Intell."},{"key":"43_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-73482-6_4","volume-title":"Foundations of Genetic Algorithms","author":"T Jansen","year":"2007","unstructured":"Jansen, T.: On the brittleness of evolutionary algorithms. In: Stephens, C.R., Toussaint, M., Whitley, D., Stadler, P.F. (eds.) FOGA 2007. LNCS, vol. 4436, pp. 54\u201369. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73482-6_4"},{"key":"43_CR29","series-title":"The Computer Science Perspective","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms","author":"T Jansen","year":"2013","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms. The Computer Science Perspective. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-17339-4"},{"key":"43_CR30","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jda.2005.01.002","volume":"4","author":"T Jansen","year":"2006","unstructured":"Jansen, T., Wegener, I.: On the analysis of a dynamic evolutionary algorithm. J. Discrete Algorithms 4, 181\u2013199 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"43_CR31","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin, Y., Branke, J.: Evolutionary optimization in uncertain environments - a survey. IEEE Trans. Evol. Comput. 9, 303\u2013317 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"43_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-15844-5_25","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"PK Lehre","year":"2010","unstructured":"Lehre, P.K.: Negative drift in populations. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 244\u2013253. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_25"},{"key":"43_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-99259-4_1","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"J Lengler","year":"2018","unstructured":"Lengler, J.: A general dichotomy of evolutionary algorithms on monotone functions. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 3\u201315. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_1"},{"key":"43_CR34","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-29414-4_2","volume-title":"Theory of Evolutionary Computation","author":"J Lengler","year":"2020","unstructured":"Lengler, J.: Drift analysis. Theory of Evolutionary Computation. NCS, pp. 89\u2013131. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_2"},{"unstructured":"M\u00fchlenbein, H.: How genetic algorithms really work: mutation and hill climbing. In: Parallel problem solving from nature, PPSN 1992, pp. 15\u201326. Elsevier (1992)","key":"43_CR35"},{"key":"43_CR36","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-030-29414-4_7","volume-title":"Theory of Evolutionary Computation","author":"F Neumann","year":"2020","unstructured":"Neumann, F., Pourhassan, M., Roostapour, V.: Analysis of evolutionary algorithms in dynamic and stochastic environments. Theory of Evolutionary Computation. NCS, pp. 323\u2013357. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_7"},{"key":"43_CR37","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-29414-4_4","volume-title":"Theory of Evolutionary Computation","author":"F Neumann","year":"2020","unstructured":"Neumann, F., Sutton, A.M.: Parameterized complexity analysis of randomized search heuristics. Theory of Evolutionary Computation. NCS, pp. 213\u2013248. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_4"},{"key":"43_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization -Algorithms and Their Computational Complexity","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization -Algorithms and Their Computational Complexity. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16544-3"},{"key":"43_CR39","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2015.01.002","volume":"605","author":"PS Oliveto","year":"2015","unstructured":"Oliveto, P.S., Witt, C.: Improved time complexity analysis of the simple genetic algorithm. Theoret. Comput. Sci. 605, 21\u201341 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"43_CR40","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s00453-016-0212-1","volume":"78","author":"T Paix\u00e3o","year":"2017","unstructured":"Paix\u00e3o, T., Heredia, J.P., Sudholt, D., Trubenov\u00e1, B.: Towards a runtime comparison of natural and artificial evolution. Algorithmica 78, 681\u2013713 (2017)","journal-title":"Algorithmica"},{"key":"43_CR41","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s00453-018-0488-4","volume":"81","author":"C Qian","year":"2019","unstructured":"Qian, C., Bian, C., Jiang, W., Tang, K.: Running time analysis of the $${(1+1)}$$-EA for OneMax and LeadingOnes under bit-wise noise. Algorithmica 81, 749\u2013795 (2019)","journal-title":"Algorithmica"},{"key":"43_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco_a_00170","volume":"26","author":"C Qian","year":"2018","unstructured":"Qian, C., Yu, Y., Zhou, Z.: Analyzing evolutionary optimization in noisy environments. Evol. Comput. 26, 1\u201341 (2018)","journal-title":"Evol. Comput."},{"key":"43_CR43","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2013.09.036","volume":"545","author":"JE Rowe","year":"2014","unstructured":"Rowe, J.E., Sudholt, D.: The choice of the offspring population size in the (1, $$\\lambda $$) evolutionary algorithm. Theoret. Comput. Sci. 545, 20\u201338 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"43_CR44","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2012.2202241","volume":"17","author":"D Sudholt","year":"2013","unstructured":"Sudholt, D.: A new method for lower bounds on the running time of evolutionary algorithms. IEEE Trans. Evol. Comput. 17, 418\u2013435 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"doi-asserted-by":"publisher","unstructured":"Sudholt, D.: Analysing the robustness of evolutionary algorithms to noise:refined runtime bounds and an example where noise is beneficial. Algorithmica (2020, to appear). https:\/\/doi.org\/10.1007\/s00453-020-00671-0","key":"43_CR45","DOI":"10.1007\/s00453-020-00671-0"},{"key":"43_CR46","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00453-011-9606-2","volume":"64","author":"D Sudholt","year":"2012","unstructured":"Sudholt, D., Thyssen, C.: A simple ant colony optimizer for stochastic shortest path problems. Algorithmica 64, 643\u2013672 (2012). https:\/\/doi.org\/10.1007\/s00453-011-9606-2","journal-title":"Algorithmica"},{"key":"43_CR47","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1017\/S0963548304006650","volume":"14","author":"I Wegener","year":"2005","unstructured":"Wegener, I., Witt, C.: On the optimization of monotone polynomials by simple randomized search heuristics. Comb. Probab. Comput. 14, 225\u2013247 (2005)","journal-title":"Comb. Probab. Comput."},{"key":"43_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-31856-9_4","volume-title":"STACS 2005","author":"C Witt","year":"2005","unstructured":"Witt, C.: Worst-case and average-case approximations by simple randomized search heuristics. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 44\u201356. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31856-9_4"},{"key":"43_CR49","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S0963548312000600","volume":"22","author":"C Witt","year":"2013","unstructured":"Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Comb. Probab. Comput. 22, 294\u2013318 (2013)","journal-title":"Comb. Probab. Comput."},{"key":"43_CR50","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.tcs.2012.09.022","volume":"469","author":"M Xiao","year":"2013","unstructured":"Xiao, M., Nagamochi, H.: Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs. Theoret. Comput. Sci. 469, 92\u2013104 (2013)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,30]],"date-time":"2021-03-30T12:39:01Z","timestamp":1617107941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"268","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}