{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:08:44Z","timestamp":1648948124527},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems and Software"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0164-1212(01)00014-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:36:14Z","timestamp":1027614974000},"page":"221-226","source":"Crossref","is-referenced-by-count":0,"title":["How good is the critical factor concept in estimating the average number of character comparisons per item in string sorting?"],"prefix":"10.1016","volume":"57","author":[{"given":"Suleiman Hussein","family":"Mustafa","sequence":"first","affiliation":[]},{"given":"Fawaz Ahmed","family":"Masoud","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0164-1212(01)00014-0_BIB1","doi-asserted-by":"crossref","unstructured":"Arge, L., et al., 1997. On sorting strings in external memory. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC `97), Elpaso (TX), pp. 540\u2013548","DOI":"10.1145\/258533.258647"},{"key":"10.1016\/S0164-1212(01)00014-0_BIB2","first-page":"360","article-title":"Fast algorithms for sorting and searching strings","author":"Bently","year":"1996","journal-title":"Proc. ACM-SIAM Symp. Discrete Algorithms"},{"key":"10.1016\/S0164-1212(01)00014-0_BIB3","unstructured":"Daily, F.J., 1972. In: Allen, K., Harold, L. (Eds.), Encyclopedia of Library and Information Science, vol. 8, Marcel Dekker, New York, pp. 405\u2013431"},{"key":"10.1016\/S0164-1212(01)00014-0_BIB4","series-title":"Algorithms from P to NP","first-page":"489","article-title":"Sorting: a case study in efficient coding","author":"Moret","year":"1990"},{"key":"10.1016\/S0164-1212(01)00014-0_BIB5","unstructured":"Naps, T.L., Pothering, G.J. Algorithms abstraction and efficiency. In: Introduction to Data Structures and Algorithm Analysis with Pascal. West Publishing, St. Paul, USA, 1992, pp. 1\u201344"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121201000140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121201000140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T19:08:36Z","timestamp":1578769716000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0164121201000140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0164121201000140"],"URL":"https:\/\/doi.org\/10.1016\/s0164-1212(01)00014-0","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}