{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:05:01Z","timestamp":1648929901512},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":[[1992,6]]},"DOI":"10.1016\/0020-0190(92)90243-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"223-228","source":"Crossref","is-referenced-by-count":0,"title":["A parallelization of Miller's nlog n isomorphism technique"],"prefix":"10.1016","volume":"42","author":[{"given":"C.J.","family":"Colbourn","sequence":"first","affiliation":[]},{"given":"D.R.","family":"Stinson","sequence":"additional","affiliation":[]},{"given":"L.","family":"Teirlinck","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90243-O_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/800061.808726","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983","journal-title":"Proc. Fifteenth Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90243-O_BIB2","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1112\/plms\/s3-41.3.557","article-title":"Embedding partial Steiner triple systems","volume":"41","author":"Andersen","year":"1980","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0020-0190(92)90243-O_BIB3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/800061.808746","article-title":"Canonical labeling of graphs","author":"Babai","year":"1983","journal-title":"Proc. Fifteenth Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90243-O_BIB4","first-page":"191","article-title":"Combinatorial isomorphism problems involving 1-factorizations","volume":"9","author":"Colbourn","year":"1980","journal-title":"Ars Combin."},{"key":"10.1016\/0020-0190(92)90243-O_BIB5","first-page":"289","article-title":"An analysis technique for Steiner triple systems","volume":"23","author":"Colbourn","year":"1979","journal-title":"Congr. Numer."},{"key":"10.1016\/0020-0190(92)90243-O_BIB6","first-page":"67","article-title":"Algorithmic aspects of combinatorial designs: a survey","volume":"26","author":"Colbourn","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0020-0190(92)90243-O_BIB7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(81)90012-3","article-title":"Concerning the complexity of deciding isomorphism of block designs","volume":"3","author":"Colbourn","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(92)90243-O_BIB8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1146\/annurev.cs.03.060188.001313","article-title":"Parallel algorithmic techniques for combinatorial computation","volume":"3","author":"Eppstein","year":"1988","journal-title":"Ann. Rev. Comput. Sci."},{"key":"10.1016\/0020-0190(92)90243-O_BIB9","first-page":"191","article-title":"On a problem in combinations","volume":"2","author":"Kirkman","year":"1847","journal-title":"Cambridge and Dublin Math. J."},{"key":"10.1016\/0020-0190(92)90243-O_BIB10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/800133.804331","article-title":"On the nlog n isomorphism technique","author":"Miller","year":"1978","journal-title":"Proc. Tenth Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90243-O_BIB11","first-page":"213","article-title":"Isomorphism testing of Steiner triple systems: canonical forms","volume":"19","author":"Stinson","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/0020-0190(92)90243-O_BIB12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","article-title":"Implementation of simultaneous memory access in models that forbid it","volume":"4","author":"Vishkin","year":"1983","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290243O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290243O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:29Z","timestamp":1555144049000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290243O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["002001909290243O"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90243-o","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}