{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:01:09Z","timestamp":1648890069765},"reference-count":2,"publisher":"Informa UK Limited","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2004,7]]},"DOI":"10.1080\/00207160410001715311","type":"journal-article","created":{"date-parts":[[2004,6,29]],"date-time":"2004-06-29T15:47:08Z","timestamp":1088524028000},"page":"803-812","source":"Crossref","is-referenced-by-count":0,"title":["A Markov chain model for dynamic binary search tree behaviour"],"prefix":"10.1080","volume":"81","author":[{"given":"William E.","family":"Wright","sequence":"first","affiliation":[]}],"member":"301","reference":[{"key":"b1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00263500"},{"key":"b2","volume-title":"The Art of Computer Programming","volume":"3","author":"Knuth DE","year":"1973"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160410001715311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,14]],"date-time":"2016-12-14T01:04:35Z","timestamp":1481677475000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160410001715311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7]]},"references-count":2,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2004,7]]}},"alternative-id":["10.1080\/00207160410001715311"],"URL":"https:\/\/doi.org\/10.1080\/00207160410001715311","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,7]]}}}