{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:33Z","timestamp":1725484653016},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_28","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T02:33:34Z","timestamp":1180492414000},"page":"293-305","source":"Crossref","is-referenced-by-count":0,"title":["Packing Arrays"],"prefix":"10.1007","author":[{"given":"Brett","family":"Stevens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Mendelsohn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"28_CR1","first-page":"259","volume":"42","author":"K. A. S. Abdel-Ghaffar","year":"1996","unstructured":"K. A. S. Abdel-Ghaffar. On the number of mutually orthogonal partial latin squares. Ars Combin., 42:259\u2013286, 1996.","journal-title":"Ars Combin."},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/151284.151288","volume":"18","author":"K. A. S. Abdel-Ghaffar","year":"1993","unstructured":"K. A. S. Abdel-Ghaffar and A. E. Abbadi. Optimal disk allocation for partial match queries. ACM Transactions on Database Systems, 18(1):132\u2013156, Mar. 1993.","journal-title":"ACM Transactions on Database Systems"},{"key":"28_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803888","volume-title":"Combinatorics: Topics, Techniques, Algorithms","author":"P. J. Cameron","year":"1994","unstructured":"P. J. Cameron. Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press, Cambridge, 1994."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1027389907339","volume":"9","author":"C. Colbourn","year":"1996","unstructured":"C. Colbourn and D. Kreher. Concerning di.erence methods. Des. Codes Cryptogr., 9:61\u201370, 1996.","journal-title":"Des. Codes Cryptogr."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1008393607487","volume":"20","author":"C. Colbourn","year":"2000","unstructured":"C. Colbourn and S. Zhao. Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems. Des. Codes Cryptogr., 20:219\u2013227, 2000.","journal-title":"Des. Codes Cryptogr."},{"volume-title":"The CRC Handbook of Combinatorial Designs","year":"1996","key":"28_CR6","unstructured":"C. J. Colbourn and J. H. Dinitz, editors. The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton, 1996."},{"key":"28_CR7","unstructured":"P. Danziger, M. Greig, and B. Stevens. Geometrical constructions of classuniformly resolvable structures. Unpublished Manuscript."},{"key":"28_CR8","unstructured":"P. Danziger and B. Stevens. On class-uniformly resolvable frames. Unpublished Manuscript."},{"key":"28_CR9","unstructured":"P. Danziger and B. Stevens. On class-uniformly resolvable groupdi visible designs. Discrete Math. (Submitted)."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/1520-6610(2001)9:2<79::AID-JCD1000>3.0.CO;2-B","volume":"9","author":"P. Danziger","year":"2001","unstructured":"P. Danziger and B. Stevens. Class-uniformly resolvable designs. J. Combin. Des., 9:79\u201399, 2001.","journal-title":"J. Combin. Des."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(91)90281-6","volume":"92","author":"E. Lamken","year":"1991","unstructured":"E. Lamken, R. Rees, and S. Vanstone. Class-uniformly resolvable pairwise balanced designs with block sizes two and three. Discrete Math., 92:197\u2013209, 1991.","journal-title":"Discrete Math."},{"key":"28_CR12","volume-title":"R\u00e9cr\u00e9ations Math\u00e9matiques","author":"E. Lucas","year":"1883","unstructured":"E. Lucas. R\u00e9cr\u00e9ations Math\u00e9matiques, volume 2. Gauthier-Villars, Paris, 1883."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jcd.3180010106","volume":"1","author":"N. J. A. Sloane","year":"1993","unstructured":"N. J. A. Sloane. Covering arrays and intersecting codes. J. Combin. Des., 1:51\u201363, 1993.","journal-title":"J. Combin. Des."},{"key":"28_CR14","unstructured":"B. Stevens. Transversal Covers and Packings. Ph.D. thesis, University of Toronto, Toronto, 1998."},{"key":"28_CR15","unstructured":"B. Stevens, A. Ling, and E. Mendelsohn. A direct construction of transversal covers using groupdi visible designs. Ars Combin. (To Appear)."},{"key":"28_CR16","unstructured":"B. Stevens and E. Mendelsohn. Packing arrays and packing designs. Des. Codes Cryptogr. (To Appear)."},{"issue":"3","key":"28_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/(SICI)1520-6610(1999)7:3<185::AID-JCD3>3.0.CO;2-3","volume":"7","author":"B. Stevens","year":"1999","unstructured":"B. Stevens and E. Mendelsohn. New recursive methods for transversal covers. J. Combin. Des., 7(3):185\u2013203, 1999.","journal-title":"J. Combin. Des."},{"issue":"3","key":"28_CR18","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1023\/A:1008329410829","volume":"15","author":"B. Stevens","year":"1998","unstructured":"B. Stevens, L. Moura, and E. Mendelsohn. Lower bounds for transversal covers. Des. Codes Cryptogr., 15(3):279\u2013299, 1998.","journal-title":"Des. Codes Cryptogr."},{"key":"28_CR19","unstructured":"W. Wallis, editor. Computational and Constructive Design Theory, volume 368 of Mathematics and Its Applications. Kluwer Academic Publishers, Dordrecht, 1996."},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/(SICI)1520-6610(1996)4:3<177::AID-JCD2>3.0.CO;2-C","volume":"4","author":"D. Wevrick","year":"1996","unstructured":"D. Wevrick and S. A. Vanstone. Class-uniformly resolvable designs with block sizes 2 and 3. J. Combin. Des., 4:177\u2013202, 1996.","journal-title":"J. Combin. Des."},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(74)90148-4","volume":"9","author":"R. M. Wilson","year":"1974","unstructured":"Richard M. Wilson. Concerning the number of mutually orthogonal Latin squares. Discrete Math., 9:181\u2013198, 1974.","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T01:00:09Z","timestamp":1550365209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}