{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:11Z","timestamp":1750307171363,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,26]],"date-time":"2012-10-26T00:00:00Z","timestamp":1351209600000},"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":[[2012,10,26]]},"DOI":"10.1145\/2393216.2393227","type":"proceedings-article","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T15:04:07Z","timestamp":1352819047000},"page":"57-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A statistical approach to the relative performance analysis of sorting algorithms"],"prefix":"10.1145","author":[{"given":"Niraj Kumar","family":"Singh","sequence":"first","affiliation":[{"name":"Birla Institute of Technology Mesra, Ranchi, Jharkhand, India"}]},{"given":"Soubhik","family":"Chakraborty","sequence":"additional","affiliation":[{"name":"Birla Institute of Technology Mesra, Ranchi, Jharkhand, India"}]}],"member":"320","published-online":{"date-parts":[[2012,10,26]]},"reference":[{"volume-title":"Lambert Academic Publishing","year":"2010","author":"Chakraborty S.","key":"e_1_3_2_1_1_1"},{"issue":"3","key":"e_1_3_2_1_2_1","first-page":"16","article-title":"2009. Will the Weight Based Statistical Bounds Revolutionize the IT?","volume":"7","author":"Chakraborty S.","year":"2009","journal-title":"International Journal of Computational Cognition"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Fang K. T. Li R. and Sudjianto A. 2006. Design and Modeling of Computer Experiments Chapman and Hall (2006).   Fang K. T. Li R. and Sudjianto A. 2006. Design and Modeling of Computer Experiments Chapman and Hall (2006).","DOI":"10.1201\/9781420034899"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/355588.365103"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Hoare C. A. R. 1962. Quicksort. The Computer Journal (1962) 5 (1): 10--16 doi: 10.1093\/comjnl\/5.1.10.  Hoare C. A. R. 1962. Quicksort . The Computer Journal (1962) 5 (1): 10--16 doi: 10.1093\/comjnl\/5.1.10.","DOI":"10.1093\/comjnl\/5.1.10"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Sacks J. Weltch W. Mitchel T. and Wynn H. 1989. Design and Analysis of Computer Experiments Statistical Science 4 (4) 1989.  Sacks J. Weltch W. Mitchel T. and Wynn H. 1989. Design and Analysis of Computer Experiments Statistical Science 4 (4) 1989.","DOI":"10.1214\/ss\/1177012413"},{"key":"e_1_3_2_1_7_1","unstructured":"Singh N. K. and Chakraborty S. Smart Sort: Design and Analysis of a Fast Efficient and Robust Comparison Based Internal Sort Algorithm. arXiv:1204.5083v1 {cs.DS}.  Singh N. K. and Chakraborty S. Smart Sort: Design and Analysis of a Fast Efficient and Robust Comparison Based Internal Sort Algorithm . arXiv:1204.5083v1 {cs.DS}."},{"issue":"4","key":"e_1_3_2_1_8_1","volume":"7","author":"Sourabh S. K.","year":"2009","journal-title":"International Journal of Computational Cognition"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.01.016"},{"key":"e_1_3_2_1_10_1","unstructured":"Sourabh S. K. and Chakraborty S. How Robust is Quick sort Average Complexity? arXiv:0811.4376v1 {cs.DS}.  Sourabh S. K. and Chakraborty S. How Robust is Quick sort Average Complexity? arXiv:0811.4376v1 {cs.DS}."}],"event":{"name":"CCSEIT '12: The Second International Conference on Computational Science, Engineering","sponsor":["Avinashilingam University Avinashilingam University"],"location":"Coimbatore UNK India","acronym":"CCSEIT '12"},"container-title":["Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2393216.2393227","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2393216.2393227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:46Z","timestamp":1750240486000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2393216.2393227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,26]]},"references-count":10,"alternative-id":["10.1145\/2393216.2393227","10.1145\/2393216"],"URL":"https:\/\/doi.org\/10.1145\/2393216.2393227","relation":{},"subject":[],"published":{"date-parts":[[2012,10,26]]},"assertion":[{"value":"2012-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}