{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:00Z","timestamp":1750220760116,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:00:00Z","timestamp":1593043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Russian Science Foundation"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,25]]},"DOI":"10.1145\/3377930.3390246","type":"proceedings-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T19:29:12Z","timestamp":1593458952000},"page":"516-523","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["If unsure, shuffle"],"prefix":"10.1145","author":[{"given":"Sumit","family":"Mishra","sequence":"first","affiliation":[{"name":"IIIT Guwahati, Guwahati, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Buzdalov","sequence":"additional","affiliation":[{"name":"ITMO University, Saint Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914855"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205469"},{"volume-title":"International Conference on Evolutionary Multi-Criterion Optimization (EMO'2019)","author":"Buzdalov Maxim","key":"e_1_3_2_1_3_1","unstructured":"Maxim Buzdalov . 2019. Make Evolutionary Multiobjective Algorithms Scale Better with Advanced Data Structures: Van Emde Boas Tree for Non-Dominated Sorting . In International Conference on Evolutionary Multi-Criterion Optimization (EMO'2019) . Springer . Lecture Notes in Computer Science Vol. 11411, East Lansing, MI, USA, 66--77. ISBN: 978-3-030-12597-4. Maxim Buzdalov. 2019. Make Evolutionary Multiobjective Algorithms Scale Better with Advanced Data Structures: Van Emde Boas Tree for Non-Dominated Sorting. In International Conference on Evolutionary Multi-Criterion Optimization (EMO'2019). Springer. Lecture Notes in Computer Science Vol. 11411, East Lansing, MI, USA, 66--77. ISBN: 978-3-030-12597-4."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10762-2_52"},{"key":"e_1_3_2_1_5_1","first-page":"54156","volume-title":"Classifying Metamodeling Methods for Evolutionary Multi-Objective Optimization: First Results. In International Conference on Evolutionary Multi-Criterion Optimization (EMO'2017)","volume":"10173","author":"Deb Kalyanmoy","year":"2017","unstructured":"Kalyanmoy Deb , Rayan Hussein , Proteek Roy , and Gregorio Toscano . 2017 . Classifying Metamodeling Methods for Evolutionary Multi-Objective Optimization: First Results. In International Conference on Evolutionary Multi-Criterion Optimization (EMO'2017) . Springer. Lecture Notes in Computer Science Vol. 10173 , M\u00fcnster, Germany, 160--175. ISBN: 978-3-319- 54156 - 54153 . Kalyanmoy Deb, Rayan Hussein, Proteek Roy, and Gregorio Toscano. 2017. Classifying Metamodeling Methods for Evolutionary Multi-Objective Optimization: First Results. In International Conference on Evolutionary Multi-Criterion Optimization (EMO'2017). Springer. Lecture Notes in Computer Science Vol. 10173, M\u00fcnster, Germany, 160--175. ISBN: 978-3-319-54156-3."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_2_1_7_1","volume-title":"Generalizing the Improved Run-Time Complexity Algorithm for Non-Dominated Sorting. In 2013 Genetic and Evolutionary Computation Conference (GECCO'2013)","author":"Fortin F\u00e9lix-Antoine","year":"2013","unstructured":"F\u00e9lix-Antoine Fortin , Simon Greiner , and Marc Parizeau . 2013 . Generalizing the Improved Run-Time Complexity Algorithm for Non-Dominated Sorting. In 2013 Genetic and Evolutionary Computation Conference (GECCO'2013) . ACM Press, New York, USA, 615--622. ISBN: 978-1-4503- 1963-8. F\u00e9lix-Antoine Fortin, Simon Greiner, and Marc Parizeau. 2013. Generalizing the Improved Run-Time Complexity Algorithm for Non-Dominated Sorting. In 2013 Genetic and Evolutionary Computation Conference (GECCO'2013). ACM Press, New York, USA, 615--622. ISBN: 978-1-4503-1963-8."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00204"},{"key":"e_1_3_2_1_9_1","volume-title":"Exploiting the Trade-Off-The Benefits of Multiple Objectives in Data Clustering. In International Conference on Evolutionary Multi-Criterion Optimization (EMO'2005)","volume":"3410","author":"Handl Julia","year":"2005","unstructured":"Julia Handl and Joshua Knowles . 2005 . Exploiting the Trade-Off-The Benefits of Multiple Objectives in Data Clustering. In International Conference on Evolutionary Multi-Criterion Optimization (EMO'2005) . Springer. Lecture Notes in Computer Science Vol. 3410 , Guanajuato, M\u00e9xico, 547--560. Julia Handl and Joshua Knowles. 2005. Exploiting the Trade-Off-The Benefits of Multiple Objectives in Data Clustering. In International Conference on Evolutionary Multi-Criterion Optimization (EMO'2005). Springer. Lecture Notes in Computer Science Vol. 3410, Guanajuato, M\u00e9xico, 547--560."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.817234"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00108ED1V01Y200802AIM003"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222060"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3067695.3076074"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00041"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377929.3389900"},{"key":"e_1_3_2_1_16_1","volume-title":"Coello Coello","author":"Mishra Sumit","year":"2018","unstructured":"Sumit Mishra , Samrat Mondal , Sriparna Saha , and Carlos A . Coello Coello . 2018 . GBOS : Generalized Best Order Sort Algorithm for Non-Dominated Sorting. Swarm and Evolutionary Computation 43 (December 2018), 244--264. Sumit Mishra, Samrat Mondal, Sriparna Saha, and Carlos A. Coello Coello. 2018. GBOS: Generalized Best Order Sort Algorithm for Non-Dominated Sorting. Swarm and Evolutionary Computation 43 (December 2018), 244--264."},{"key":"e_1_3_2_1_17_1","volume-title":"MBOS: Modified Best Order Sort Algorithm for Performing Non-dominated Sorting. In 2018 IEEE Congress on Evolutionary Computation (CEC'2018)","author":"Mishra Sumit","year":"2018","unstructured":"Sumit Mishra , Sriparna Saha , and Samrat Mondal . 2018 . MBOS: Modified Best Order Sort Algorithm for Performing Non-dominated Sorting. In 2018 IEEE Congress on Evolutionary Computation (CEC'2018) . IEEE Press, Rio de Janeiro, Brazil, 725--732. ISBN: 978-1-5090-6017-7. Sumit Mishra, Sriparna Saha, and Samrat Mondal. 2018. MBOS: Modified Best Order Sort Algorithm for Performing Non-dominated Sorting. In 2018 IEEE Congress on Evolutionary Computation (CEC'2018). IEEE Press, Rio de Janeiro, Brazil, 725--732. ISBN: 978-1-5090-6017-7."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2968301"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22300-6_51"},{"key":"e_1_3_2_1_20_1","volume-title":"Metamodeling for Multimodal Selection Functions in Evolutionary Multi-Objective Optimization. In 2017 Genetic and Evolutionary Computation Conference (GECCO'2017)","author":"Roy Proteek","year":"2017","unstructured":"Proteek Roy , Rayan Hussein , and Kalyanmoy Deb . 2017 . Metamodeling for Multimodal Selection Functions in Evolutionary Multi-Objective Optimization. In 2017 Genetic and Evolutionary Computation Conference (GECCO'2017) . ACM Press, Berlin, Germany, 625--632. ISBN: 978-1-4503-4920-8. Proteek Roy, Rayan Hussein, and Kalyanmoy Deb. 2017. Metamodeling for Multimodal Selection Functions in Evolutionary Multi-Objective Optimization. In 2017 Genetic and Evolutionary Computation Conference (GECCO'2017). ACM Press, Berlin, Germany, 625--632. ISBN: 978-1-4503-4920-8."},{"key":"e_1_3_2_1_21_1","volume-title":"High Dimensional Model Representation for Solving Expensive Multi-Objective Optimization Problems. In 2016 IEEE Congress on Evolutionary Computation (CEC'2016)","author":"Roy Proteek Chandan","year":"2016","unstructured":"Proteek Chandan Roy and Kalyanmoy Deb . 2016 . High Dimensional Model Representation for Solving Expensive Multi-Objective Optimization Problems. In 2016 IEEE Congress on Evolutionary Computation (CEC'2016) . IEEE Press, Vancouver, Canada, 2490--2497. ISBN: 978-1-5090-0623-6. Proteek Chandan Roy and Kalyanmoy Deb. 2016. High Dimensional Model Representation for Solving Expensive Multi-Objective Optimization Problems. In 2016 IEEE Congress on Evolutionary Computation (CEC'2016). IEEE Press, Vancouver, Canada, 2490--2497. ISBN: 978-1-5090-0623-6."},{"key":"e_1_3_2_1_22_1","first-page":"1","article-title":"An Efficient Nondominated Sorting Algorithm for Large Number of Fronts","volume":"99","author":"Roy Proteek Chandan","year":"2018","unstructured":"Proteek Chandan Roy , Kalyanmoy Deb , and Md Monirul Islam . 2018 . An Efficient Nondominated Sorting Algorithm for Large Number of Fronts . IEEE Transactions on Cybernetics 99 (2018), 1 -- 11 . Proteek Chandan Roy, Kalyanmoy Deb, and Md Monirul Islam. 2018. An Efficient Nondominated Sorting Algorithm for Large Number of Fronts. IEEE Transactions on Cybernetics 99 (2018), 1--11.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908961.2931684"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1994.2.3.221"},{"key":"e_1_3_2_1_25_1","volume-title":"An Efficient Nondominated Sorting Algorithm. In 2018 Genetic and Evolutionary Computation Conference (GECCO'2018)","author":"Wang Junchen","year":"2018","unstructured":"Junchen Wang , Changhe Li , Yiya Diao , Sanyou Zeng , and Hui Wang . 2018 . An Efficient Nondominated Sorting Algorithm. In 2018 Genetic and Evolutionary Computation Conference (GECCO'2018) . ACM, 203--204. Junchen Wang, Changhe Li, Yiya Diao, Sanyou Zeng, and Hui Wang. 2018. An Efficient Nondominated Sorting Algorithm. In 2018 Genetic and Evolutionary Computation Conference (GECCO'2018). ACM, 203--204."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TEVC.2014.2308305","article-title":"An Efficient Approach to Nondominated Sorting for Evolutionary Multiobjective Optimization","volume":"19","author":"Zhang Xingyi","year":"2015","unstructured":"Xingyi Zhang , Ye Tian , Ran Cheng , and Jin Yaochu . 2015 . An Efficient Approach to Nondominated Sorting for Evolutionary Multiobjective Optimization . IEEE Transactions on Evolutionary Computation 19 , 2 (April 2015), 201--213. Xingyi Zhang, Ye Tian, Ran Cheng, and Jin Yaochu. 2015. An Efficient Approach to Nondominated Sorting for Evolutionary Multiobjective Optimization. IEEE Transactions on Evolutionary Computation 19, 2 (April 2015), 201--213.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2567648"}],"event":{"name":"GECCO '20: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Canc\u00fan Mexico","acronym":"GECCO '20"},"container-title":["Proceedings of the 2020 Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390246","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377930.3390246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:00Z","timestamp":1750200060000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3390246"}},"subtitle":["deductive sort is \u0398(\n            <i>MN<\/i>\n            <sup>3<\/sup>\n            ), but\n            <i>O<\/i>\n            (\n            <i>MN<\/i>\n            <sup>2<\/sup>\n            ) in expectation over input permutations"],"short-title":[],"issued":{"date-parts":[[2020,6,25]]},"references-count":27,"alternative-id":["10.1145\/3377930.3390246","10.1145\/3377930"],"URL":"https:\/\/doi.org\/10.1145\/3377930.3390246","relation":{},"subject":[],"published":{"date-parts":[[2020,6,25]]},"assertion":[{"value":"2020-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}