{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:41:25Z","timestamp":1725795685903},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_34","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"399-410","source":"Crossref","is-referenced-by-count":4,"title":["Distributed Computing on Core-Periphery Networks: Axiom-Based Design"],"prefix":"10.1007","author":[{"given":"Chen","family":"Avin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Borokhovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zvi","family":"Lotker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/S0097539704441848","volume":"35","author":"Z. Lotker","year":"2005","unstructured":"Lotker, Z., Patt-Shamir, B., Pavlov, E., Peleg, D.: Minimum-weight spanning tree construction in o(log log n) communication rounds. SIAM J. Computing\u00a035(1), 120\u2013131 (2005)","journal-title":"SIAM J. Computing"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Wattenhofer, R.: Tight bounds for parallel randomized load balancing. In: STOC, pp. 11\u201320 (2011)","DOI":"10.1145\/1993636.1993639"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Lenzen, C.: Optimal deterministic routing and sorting on the congested clique. In: PODC, pp. 42\u201350 (2013)","DOI":"10.1145\/2484239.2501983"},{"key":"34_CR4","unstructured":"Avin, C., Lotker, Z., Pignolet, Y.A., Turkel, I.: From caesar to twitter: An axiomatic approach to elites of social networks. CoRR abs\/1111.3374 (2012)"},{"key":"34_CR5","unstructured":"Fujita, M., Krugman, P.R., Venables, A.J.: The spatial economy: Cities, regions, and international trade. MIT Press (2001)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Krugman, P.: Increasing Returns and Economic Geography. The Journal of Political Economy\u00a099(3), 483\u2013499 (1991)","DOI":"10.1086\/261763"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"46111","DOI":"10.1103\/PhysRevE.72.046111","volume":"72","author":"P. Holme","year":"2005","unstructured":"Holme, P.: Core-periphery organization of complex networks. Physical Review E\u00a072, 46111 (2005)","journal-title":"Physical Review E"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.comnet.2005.07.014","volume":"50","author":"J. Liang","year":"2006","unstructured":"Liang, J., Kumar, R., Ross, K.W.: The fasttrack overlay: A measurement study. Computer Networks\u00a050, 842 (2006)","journal-title":"Computer Networks"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Baset, S., Schulzrinne, H.: An analysis of the skype peer-to-peer internet telephony protocol. In: INFOCOM, pp. 1\u201311 (2006)","DOI":"10.1109\/INFOCOM.2006.312"},{"key":"34_CR10","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill (1998)"},{"key":"34_CR11","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann (1995)"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Adamic, L.: The small world web. Research and Advanced Technology for Digital Libraries, 852\u2013852 (1999)","DOI":"10.1007\/3-540-48155-9_27"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Bonanno, G., Caldarelli, G., Lillo, F., Mantegna, R.: Topology of correlation-based minimal spanning trees in real and model markets. Phys. Rev. E\u00a068 (2003)","DOI":"10.1103\/PhysRevE.68.046130"},{"key":"34_CR15","unstructured":"Chen, C., Morris, S.: Visualizing evolving networks: Minimum spanning trees versus pathfinder networks. In: INFOVIS, pp. 67\u201374 (2003)"},{"issue":"6","key":"34_CR16","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s00446-005-0127-6","volume":"18","author":"Z. Lotker","year":"2006","unstructured":"Lotker, Z., Patt-Shamir, B., Peleg, D.: Distributed MST for constant diameter graphs. Distributed Computing\u00a018(6), 453\u2013460 (2006)","journal-title":"Distributed Computing"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Avin, C., Borokhovich, M., Lotker, Z., Peleg, D.: Distributed computing on core-periphery networks: Axiom-based design. CoRR abs\/1404.6561 (2014)","DOI":"10.1007\/978-3-662-43951-7_34"},{"issue":"1-3","key":"34_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0012-365X(00)00224-7","volume":"233","author":"J. Nesetril","year":"2001","unstructured":"Nesetril, J., Milkova, E., Nesetrilova, H.: Otakar boruvka on minimum spanning tree problem translation of both the 1926 papers, comments, history. Discrete Mathematics\u00a0233(1-3), 3\u201336 (2001)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:16:25Z","timestamp":1558908985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}