{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:28Z","timestamp":1725664168733},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_93","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:59:06Z","timestamp":1330257546000},"page":"421-432","source":"Crossref","is-referenced-by-count":16,"title":["Expander properties in random regular graphs with edge faults"],"prefix":"10.1007","author":[{"given":"Sotiris E.","family":"Nikoletseas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"37_CR1","unstructured":"B. Bollobas, \u201cRandom Graphs\u201d, Academic Press, 1985."},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"A. Broder and E. Shamir, \u201cOn the second eigenvalue of random regular graphs\u201d, Proc. 19st ACM Symp. on Theory of Computing, pp. 286\u2013294, 1987.","DOI":"10.1109\/SFCS.1987.45"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"J. Friedman, J. Kahn and E. Szemeredi, \u201cOn the second eigenvalue of random regular graphs\u201d, Proc. 21st ACM Symp. on Theory of Computing, pp. 286\u2013294, 1989.","DOI":"10.1145\/73007.73063"},{"key":"37_CR4","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":"37_CR5","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":"37_CR6","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":"37_CR7","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":"37_CR8","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":"37_CR9","unstructured":"D. E. Knuth, \u201cThe Art of Computer Programming\u201d, vol. 1, 2nd edition, Addison Wesley, 1973."},{"issue":"10","key":"37_CR10","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"C-34","author":"C. Leiserson","year":"1985","unstructured":"C. Leiserson, \u201cFat-trees: Universal networks for hardware-efficient supercomputing\u201d, IEEE Transactions on Computers, C-34 (10), pp. 892\u2013900, October 1985.","journal-title":"IEEE Transactions on Computers"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"S. Nikoletseas, K. Palem, P. Spirakis and M. Yung, \u201cShort Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing\u201d, 21st International Colloquium on Automata, Languages and Programming (ICALP), pp. 508\u2013519, 1994.","DOI":"10.1007\/3-540-58201-0_94"},{"key":"37_CR12","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"},{"key":"37_CR13","volume-title":"The Mathematics of Networks","author":"N. Pippenger","year":"1982","unstructured":"N. Pippenger, \u201cTelephone switching networks\u201d, The Mathematics of Networks, AMS, Providence, 1982."},{"issue":"no.2","key":"37_CR14","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":"37_CR15","doi-asserted-by":"crossref","unstructured":"A. Sinclair, \u201cAlgorithms for random generation and Counting\u201d, ed. Birkhauser, 1992.","DOI":"10.1007\/978-1-4612-0323-0"},{"issue":"no.8","key":"37_CR16","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","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:25:17Z","timestamp":1605630317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}