{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:54:40Z","timestamp":1773320080380,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424949","type":"print"},{"value":"9783540446798","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44679-6_48","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T17:00:37Z","timestamp":1265734837000},"page":"420-431","source":"Crossref","is-referenced-by-count":6,"title":["Cluttered Orderings for the Complete Graph"],"prefix":"10.1007","author":[{"given":"Myra B.","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles J.","family":"Colbourn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dalibor","family":"Froncek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"key":"48_CR1","volume-title":"Decompositions of Graphs","author":"J. Bos\u00e1k","year":"1990","unstructured":"Juraj Bos\u00e1k Decompositions of Graphs. Kluwer Academic Publishers, Dordrecht, 1990."},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(99)00228-0","volume":"102","author":"Y. MengChee","year":"2000","unstructured":"Yeow MengChee, Charles J. Colbourn and Alan C.H. Ling Asymptotically optimal erasure-resilient codes for large disk arrays. Discrete Applied Mathematics 102 (2000), 3\u201336.","journal-title":"Discrete Applied Mathematics"},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/176979.176981","volume":"26","author":"P. M. Chen","year":"1994","unstructured":"Peter M. Chen, Edward K. Lee, Garth A. Gibson, Randy H. Katz and David A. Patterson RAID: High-performance, reliable secondary storage. ACM Computing Surveys 26 (1994) 145\u2013185.","journal-title":"ACM Computing Surveys"},{"key":"48_CR4","unstructured":"Myra B. Cohen Performance analysis of triple erasure codes in large disk arrays. Master\u2019s thesis, University of Vermont, 1999."},{"key":"48_CR5","unstructured":"M.B. Cohen and C.J. Colbourn Optimal and pessimal orderings of Steiner triple systems in disk arrays. Theoretical Computer Science, to appear."},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"M.B. Cohen and C.J. Colbourn Steiner triple systems as multiple erasure codes in large disk arrays. Proceedings of IPCCC 2000 (19th IEEE International Conference on Performance, Computing and Communications), 2000, pp. 288\u2013294.","DOI":"10.1109\/PCCC.2000.830330"},{"key":"48_CR7","unstructured":"M.B. Cohen and C.J. Colbourn Ladder orderings of pairs and RAID performance. submitted for publication, 2000."},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"M.B. Cohen and C.J. Colbourn Orderingedg es for double erasure codes. Proceedings of the Symposium on Parallel Algorithms and Architectures, Crete, July 2001, to appear.","DOI":"10.1145\/378580.378650"},{"key":"48_CR9","unstructured":"Garth A. Gibson Redundant Disk Arrays, Reliable Parallel Secondary Storage. MIT Press, 1992."},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/BF01185210","volume":"12","author":"L. Hellerstein","year":"1994","unstructured":"Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz and David A. Patterson Codingtec hniques for handlingfailures in large disk arrays. Algorithmica 12 (1994) 182\u2013208.","journal-title":"Algorithmica"},{"key":"48_CR11","unstructured":"Mark C. Holland On-Line Data Reconstruction In Redundant Disk Arrays. PhD thesis, Carnegie Mellon University, 1994."},{"key":"48_CR12","unstructured":"Edward K. Lee Software and performance issues in the implementation of a RAID prototype. Technical Report CSD-90-573, University of California at Berkeley, 1990."},{"key":"48_CR13","unstructured":"Edward K. Lee Performance Modeling and Analysis of Disk Arrays. PhD thesis, University of California at Berkeley, 1993."},{"key":"48_CR14","unstructured":"Paul Massiglia The RAID Book, A Storage System Technology Handbook, 6th Edition. The RAID Advisory Board, 1997."},{"key":"48_CR15","first-page":"349","volume-title":"Theory of Graphs (Internat. Sympos., Rome, 1966)","author":"A. Rosa","year":"1967","unstructured":"Alexander Rosa On certain valuations of the vertices of a graph. Theory of Graphs (Internat. Sympos., Rome, 1966), Gordon and Breach, New York, 1967, pp. 349\u2013355."},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"K. Salem and H. Garcia-Molina Disk striping. In Proceedings of the 2nd International Conference on Data Engineering, pages 336\u2013342, Washington, D. C., 1986. IEEE.","DOI":"10.1109\/ICDE.1986.7266238"},{"key":"48_CR17","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/173682.165143","volume":"21","author":"D. Stodolsky","year":"1993","unstructured":"Daniel Stodolsky, Garth Gibson, and Mark Holland Parity logging: Overcoming the small write problem in redundant disk arrays. Computer Architecture News 21 (1993), 64\u201375.","journal-title":"Computer Architecture News"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44679-6_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T21:33:31Z","timestamp":1558820011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}