{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:49Z","timestamp":1725664009008},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581840"},{"type":"electronic","value":"9783540484776"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58184-7_144","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:30:12Z","timestamp":1330270212000},"page":"725-736","source":"Crossref","is-referenced-by-count":2,"title":["A general method for maximizing the error-detecting ability of distributed algorithms"],"prefix":"10.1007","author":[{"given":"Martina","family":"Schollmeyer","sequence":"first","affiliation":[]},{"given":"Bruce","family":"McMillin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"3","key":"60_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01660031","volume":"1","author":"W. Dally","year":"1986","unstructured":"W. Dally and C. Seitz. The torus routing chip. Journal of Distributed Computing, 1(3):187\u2013196, 1986.","journal-title":"Journal of Distributed Computing"},{"key":"60_CR2","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1109\/TC.1985.1676536","volume":"C-34","author":"J. Fortes","year":"1985","unstructured":"J. Fortes and C. Raghavendra. Graceful degradable processor arrays. IEEE Trans. On Computers, C-34:1033\u20131044, November 1985.","journal-title":"IEEE Trans. On Computers"},{"key":"60_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, 1979."},{"key":"60_CR4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R.W. Hamming","year":"1950","unstructured":"R.W. Hamming. Error detecting and error correcting codes. Bell Syst. Tech. J., 29:147\u2013160, April 1950.","journal-title":"Bell Syst. Tech. J."},{"key":"60_CR5","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1109\/TC.1976.1674712","volume":"C-25","author":"J. Hayes","year":"1976","unstructured":"J. Hayes. A graph model for fault-tolerant computing systems. IEEE Trans. On Computers, C-25:875\u2013883, September 1976.","journal-title":"IEEE Trans. On Computers"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"H. Lutfiyya, M. Schollmeyer, and B. McMillin. Fault-tolerant distributed sort generated from a verification proof outline. 2nd Responsive Systems Symposium, 1992. Springer Verlag.","DOI":"10.1007\/978-3-7091-9288-7_5"},{"key":"60_CR7","unstructured":"B. McMillin. Reliable parallel processing: The application-oriented paradigm. Ph.D Thesis, Computer Science Department, Michigan State University, 1988."},{"issue":"4","key":"60_CR8","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1109\/71.149960","volume":"3","author":"B. McMillin","year":"1992","unstructured":"B. McMillin and L. Ni. Reliable distributed sorting through the application-oriented fault tolerance paradigm. IEEE Trans. of Parallel and Distributed Computing, 3(4):411\u2013420, 1992.","journal-title":"IEEE Trans. of Parallel and Distributed Computing"},{"key":"60_CR9","first-page":"133","volume":"II","author":"P. Ramanathan","year":"1992","unstructured":"P. Ramanathan and S. Chalasani. Resource placement in k-ary n-cubes. Proc. Intern. Conf. on Parallel Processing, II:133\u2013140, 1992.","journal-title":"Proc. Intern. Conf. on Parallel Processing"},{"key":"60_CR10","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TC.1983.1676134","volume":"C-32","author":"A. Rosenberg","year":"1983","unstructured":"A. Rosenberg. The diogenes approach to testable fault-tolerant arrays of processors. IEEE Trans. On Computers, C-32:902\u2013910, October 1983.","journal-title":"IEEE Trans. On Computers"},{"key":"60_CR11","unstructured":"M. Schollmeyer and B. McMillin. A general method for maximizing the error-detecting ability of distributed algorithms. UMR Department of Computer Science Technical Report CS-93-16, 1993."}],"container-title":["Lecture Notes in Computer Science","PARLE'94 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58184-7_144.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:14Z","timestamp":1605647894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58184-7_144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581840","9783540484776"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-58184-7_144","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}