{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:46:20Z","timestamp":1725551180556},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240761"},{"type":"electronic","value":"9783540305361"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30536-1_3","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T23:31:39Z","timestamp":1270078299000},"page":"16-27","source":"Crossref","is-referenced-by-count":0,"title":["A Framework for Automatic Identification of the Best Checkpoint and Recovery Protocol"],"prefix":"10.1007","author":[{"given":"Himadri S.","family":"Paul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arobinda","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Elnozahy, E.N., Alvisi, L., Wang, Y.M., Johnson, D.B.: A survey of rollback-recovery protocols in message-passing systems 34(3), 375\u2013408 (September 2002)","DOI":"10.1145\/568522.568525"},{"key":"3_CR2","unstructured":"Fortin, S.: The graph isomorphism problem. Technical Report 96-20, University of Alberta, CS dept. (July 1996)"},{"key":"3_CR3","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 2nd edn. The John Hopkins University Press (1989)"},{"key":"3_CR4","volume-title":"Applied Iterative Methods","author":"L. Hageman","year":"1981","unstructured":"Hageman, L., Young, D.: Applied Iterative Methods. Academic Press, New York (1981)"},{"key":"3_CR5","volume-title":"Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1992)"},{"issue":"15","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1002\/cpe.743","volume":"15","author":"H.S. Paul","year":"2003","unstructured":"Paul, H.S., Gupta, A., Badrinath, R.: Performance comparison of checkpoint and recovery protocols. Journal of Concurrency and Computation: Practice and Experience\u00a015(15), 1363\u20131386 (2003)","journal-title":"Journal of Concurrency and Computation: Practice and Experience"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. Journal of the ACM\u00a023(3), 31\u201342 (1976)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing - IWDC 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30536-1_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:58:23Z","timestamp":1605761903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30536-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240761","9783540305361"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30536-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}