{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T16:52:02Z","timestamp":1673283122191},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,5,1]],"date-time":"1981-05-01T00:00:00Z","timestamp":357523200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11765,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1981,5]]},"DOI":"10.1016\/0097-3165(81)90034-0","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"351-353","source":"Crossref","is-referenced-by-count":3,"title":["On permutations with limited repetition"],"prefix":"10.1016","volume":"30","author":[{"given":"Haim","family":"Mendelson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(81)90034-0_BIB1","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S0021-9800(69)80019-0","article-title":"More birthday surprises","volume":"7","author":"Dwass","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0097-3165(81)90034-0_BIB2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing\u2014A fast access method for dynamic files","volume":"4","author":"Fagin","year":"1979","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0097-3165(81)90034-0_BIB3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0021-9800(66)80025-X","article-title":"Permutations with limited repetitions","volume":"1","author":"Frucht","year":"1966","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0097-3165(81)90034-0_BIB4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0021-9800(67)80075-9","article-title":"Extensions of the birthday surprise","volume":"3","author":"Klamkin","year":"1967","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0097-3165(81)90034-0_BIB5","article-title":"Analysis of Extendible Hashing","author":"Mendelson","year":"1981"},{"key":"10.1016\/0097-3165(81)90034-0_BIB6","series-title":"An Introduction to Combinatorial Analysis","author":"Riordan","year":"1958"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316581900340?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316581900340?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T08:56:05Z","timestamp":1548752165000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316581900340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,5]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,5]]}},"alternative-id":["0097316581900340"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(81)90034-0","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1981,5]]}}}