{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T05:12:35Z","timestamp":1772514755051,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1984,11,1]],"date-time":"1984-11-01T00:00:00Z","timestamp":468115200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1984,11]]},"DOI":"10.1016\/0020-0190(84)90062-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"253-254","source":"Crossref","is-referenced-by-count":7,"title":["Permutations of bounded degree generate groups of polynomial diameter"],"prefix":"10.1016","volume":"19","author":[{"given":"Pierre","family":"McKenzie","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(84)90062-0_BIB1","series-title":"Problems in Group Theory","author":"Dixon","year":"1967"},{"key":"10.1016\/0020-0190(84)90062-0_BIB2","first-page":"152","article-title":"On the diameter of permutation groups","author":"Driscoll","year":"1983","journal-title":"Proc. 15th ACM STOC"},{"key":"10.1016\/0020-0190(84)90062-0_BIB3","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0196-6774(81)90029-8","article-title":"The minimum-length generator sequence problem is NP-hard","volume":"2","author":"Even","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(84)90062-0_BIB4","first-page":"36","article-title":"Polynomial time algorithms for permutation groups","author":"Furst","year":"1980","journal-title":"Proc. 21st IEEE FOCS"},{"key":"10.1016\/0020-0190(84)90062-0_BIB5","first-page":"154","article-title":"The parallel complexity of the abelian permutation group membership problem","author":"McKenzie","year":"1983","journal-title":"Proc. 24th IEEE FOCS"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900620?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900620?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:58:43Z","timestamp":1555073923000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019084900620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,11]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1984,11]]}},"alternative-id":["0020019084900620"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(84)90062-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1984,11]]}}}