{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T01:56:31Z","timestamp":1700099791302},"reference-count":0,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":[],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0196-6774(02)00206-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T19:37:24Z","timestamp":1034105844000},"page":"52-62","source":"Crossref","is-referenced-by-count":12,"title":["Rates of convergence for Quicksort"],"prefix":"10.1016","volume":"44","author":[{"given":"R","family":"Neininger","sequence":"first","affiliation":[]}],"member":"78","container-title":["Journal of Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196-6774(02)00206-7?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196-6774(02)00206-7?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T09:58:23Z","timestamp":1554803903000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677402002067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":0,"journal-issue":{"issue":"1"},"alternative-id":["S0196-6774(02)00206-7"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(02)00206-7","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}