{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:19Z","timestamp":1725664039549},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582014"},{"type":"electronic","value":"9783540485667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_94","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:33:53Z","timestamp":1330270433000},"page":"508-519","source":"Crossref","is-referenced-by-count":19,"title":["Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing"],"prefix":"10.1007","author":[{"given":"S.","family":"Nikoletseas","sequence":"first","affiliation":[]},{"given":"K.","family":"Palem","sequence":"additional","affiliation":[]},{"given":"P.","family":"Spirakis","sequence":"additional","affiliation":[]},{"given":"M.","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"42_CR1","first-page":"155","volume":"18","author":"D. Angluin","year":"1979","unstructured":"D. Angluin and L. Valiant, \u201cFast Probabilistic Algorithms for Hamiltonian Circuits and Matchings\u201d, JCSS, vol. 18, pp. 155\u2013193, 1979.","journal-title":"JCSS"},{"key":"42_CR2","unstructured":"B. Bollobas, \u201cRandom Graphs\u201d, Academic Press, 1985."},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"B. Bollobas and A. G. Thomason, \u201cRandom Graphs of small order\u201d, Random Graphs, Annals of Discr. Math., pp. 47\u201397, 1985.","DOI":"10.1016\/S0304-0208(08)73612-0"},{"key":"42_CR4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S. Even","year":"1975","unstructured":"S. Even and R. E. Tarjan, \u201cNetwork flow and testing graph connectivity\u201d, SLAM J. Comput., vol. 4, pp. 507\u2013518, 1975.","journal-title":"SLAM J. Comput."},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"J. Hastad, T. Leighton and M. Newman, \u201cFast Computation Using Faulty Hypercubes\u201d, Proc. 21st ACM Symp. on Theory of Computing, pp. 251\u2013263, 1989.","DOI":"10.21236\/ADA211910"},{"key":"42_CR6","first-page":"232","volume":"4","author":"S. Janson","year":"1993","unstructured":"S. Janson, D. Knuth, T. Luczak, B. Pittel, \u201cThe birth of the giant component\u201d, Random Structures and Algorithms, vol.4, pp. 232\u2013355, 1993.","journal-title":"Random Structures and Algorithms"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Z. Kedem, K. Palem, and P. Spirakis, \u201cEfficient Robust Parallel Computations\u201d, Proc. 22nd ACM Symp. on Theory of Computing, pp. 138\u2013148, 1990.","DOI":"10.1145\/100216.100231"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Z. Kedem, K. Palem, A. Raghunathan and P. Spirakis, \u201cCombining Tentative and Definite Executions for Very Fast Dependable Parallel Computing\u201d, Proc. 23nd ACM Symp. on Theory of Computing, 1991.","DOI":"10.1145\/103418.103459"},{"key":"42_CR9","volume-title":"Technical Report","author":"Z. Kedem","year":"1993","unstructured":"Z. Kedem, K. Palem, P. Spirakis and M. Yung, \u201cFaulty Random Graphs: reliable efficient-on-the-average network computing\u201d, Computer Technology Institute (Patras, Greece) Technical Report, 1993."},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"D. Peleg and E. Upfal, \u201cConstructing Disjoint Paths on Expander Graphs\u201d, Proc. 19th ACM Symp. on Theory of Computing, pp. 264\u2013273, 1987.","DOI":"10.1145\/28395.28424"},{"issue":"no.2","key":"42_CR11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M. Rabin","year":"1989","unstructured":"M. Rabin, \u201cEfficient Dispersal of Information for Security, Load Balancing and Fault Tolerance\u201d, JACM, vol. 36, no. 2, pp. 335\u2013348, 1989.","journal-title":"JACM"},{"key":"42_CR12","unstructured":"J. Spencer, \u201cTen Lectures on the Probabilistic Method\u201d, SIAM, 1987."},{"key":"42_CR13","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L. Valiant","year":"1979","unstructured":"L. Valiant, \u201cThe complexity of enumeration and reliability problems\u201d, SIAM J. Comp., vol. 8, pp. 410\u2013421, 1979.","journal-title":"SIAM J. Comp."},{"issue":"no.8","key":"42_CR14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. Valiant","year":"1990","unstructured":"L. Valiant, \u201cA Bridging Model for Parallel Computation\u201d, CACM, vol. 33, no. 8, pp. 103\u2013111, 1990.","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_94.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:33Z","timestamp":1605647913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}