{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:53:10Z","timestamp":1743011590089,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_41","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"516-527","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ultra-Fast Load Balancing on Scale-Free Networks"],"prefix":"10.1007","author":[{"given":"Karl","family":"Bringmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Rothenberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Boillat, J.E.: Load balancing and poisson equation in a graph. Concurrency: Pract. Exper., 2, 289\u2013313 (1990)","DOI":"10.1002\/cpe.4330020403"},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-642-35311-6_30","volume-title":"Internet and Network Economics","author":"C Borgs","year":"2012","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Khanna, S., Lucier, B.: The power of local information in social networks. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 406\u2013419. Springer, Heidelberg (2012)"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F Chung","year":"2002","unstructured":"Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proceedings of the National Academy of Sciences 99, 15879\u201315882 (2002)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"058701","DOI":"10.1103\/PhysRevLett.90.058701","volume":"90","author":"R Cohen","year":"2003","unstructured":"Cohen, R., Havlin, S.: Scale-free networks are ultrasmall. Phys. Rev. Lett. 90, 058701 (2003)","journal-title":"Phys. Rev. Lett."},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-30541-2_13","volume-title":"Algorithms and Models for the Web Graph","author":"C Cooper","year":"2012","unstructured":"Cooper, C., Radzik, T., Siantos, Y.: A fast algorithm to find all high degree vertices in graphs with a power law degree sequence. In: Bonato, A., Janssen, J. (eds.) WAW 2012. LNCS, vol. 7323, pp. 165\u2013178. Springer, Heidelberg (2012)"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","volume":"7","author":"G Cybenko","year":"1989","unstructured":"Cybenko, G.: Load balancing for distributed memory multiprocessors. J. Parallel and Distributed Comput. 7, 279\u2013301 (1989)","journal-title":"J. Parallel and Distributed Comput."},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/S0167-8191(99)00018-6","volume":"25","author":"R Diekmann","year":"1999","unstructured":"Diekmann, R., Frommer, A., Monien, B.: Efficient schemes for nearest neighbor load balancing. Parallel Computing 25, 789\u2013812 (1999)","journal-title":"Parallel Computing"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511581274"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R., Sauerwald, T.: Discrete load balancing is (almost) as easy as continuous load balancing. In: 29th Symp. Principles of Distributed Computing (PODC), pp. 346\u2013354 (2010)","DOI":"10.1145\/1835698.1835780"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in social networks. In: 23rd Symp. Discrete Algorithms (SODA), pp. 1642\u20131660 (2012)","DOI":"10.1137\/1.9781611973099.130"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in Facebook: A case study of unbiased sampling of OSNs. In: 29th IEEE Conf. Computer Communications (INFOCOM), pp. 2498\u20132506 (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Graham, F.C., Radcliffe, M.: On the spectra of general random graphs. Electr. J. Comb. 18 (2011)","DOI":"10.37236\/702"},{"key":"41_CR13","unstructured":"Huebner, K.H., Dewhirst, D.L., Smith, D.E., Byrom, T.G.: The Finite Element Methods for Engineers. Wiley (2001)"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. AMS (2008)","DOI":"10.1090\/mbk\/058"},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167\u2013256 (2003)","journal-title":"SIAM Review"},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Subramanian, R., Scherson, I.D.: An analysis of diffusive load-balancing. In: 6th Symp. Parallelism in Algorithms and Architectures (SPAA), pp. 220\u2013225 (1994)","DOI":"10.1145\/181014.181361"},{"key":"41_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.peva.2005.01.003","volume":"63","author":"S Surana","year":"2006","unstructured":"Surana, S., Godfrey, B., Lakshminarayanan, K., Karp, R., Stoica, I.: Load balancing in dynamic structured peer-to-peer systems. Performance Evaluation 63, 217\u2013240 (2006)","journal-title":"Performance Evaluation"},{"key":"41_CR18","unstructured":"van der Hofstad, R.: Random graphs and complex networks (2011). www.win.tue.nl\/rhofstad\/NotesRGCN.pdf"},{"key":"41_CR19","doi-asserted-by":"publisher","first-page":"1032","DOI":"10.1016\/j.simpat.2009.03.003","volume":"17","author":"D Zhanga","year":"2009","unstructured":"Zhanga, D., Jianga, C., Li, S.: A fast adaptive load balancing method for parallel particle-based simulations. Simulation Modelling Practice and Theory 17, 1032\u20131042 (2009)","journal-title":"Simulation Modelling Practice and Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:23:19Z","timestamp":1674228199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}