{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:58:47Z","timestamp":1725861527308},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_27","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T11:50:21Z","timestamp":1468929021000},"page":"330-341","source":"Crossref","is-referenced-by-count":3,"title":["Balanced Allocation on Graphs: A Random Walk Approach"],"prefix":"10.1007","author":[{"given":"Ali","family":"Pourmiri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1142\/S0219199707002551","volume":"9","author":"N Alon","year":"2007","unstructured":"Alon, N., Benjamini, I., Lubetzky, E., Sodin, S.: Non-backtracking random walks mix faster. Commun. Contemp. Math. 9, 585\u2013603 (2007)","journal-title":"Commun. Contemp. Math."},{"issue":"1","key":"27_CR2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s11856-009-0112-z","volume":"174","author":"N Alon","year":"2009","unstructured":"Alon, N., Lubetzky, E.: Poisson approximation for non-backtracking random walks. Israel J. Math. 174(1), 227\u2013252 (2009)","journal-title":"Israel J. Math."},{"issue":"1","key":"27_CR3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y Azar","year":"1999","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. SIAM J. Comput. 29(1), 180\u2013200 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"27_CR4","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.jpdc.2011.10.006","volume":"72","author":"P Berenbrink","year":"2012","unstructured":"Berenbrink, P., Brinkmann, A., Friedetzky, T., Nagel, L.: Balls into bins with related random choices. J. Parallel Distrib. Comput. 72(2), 246\u2013253 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Bogdan, P., Sauerwald, T., Stauffer, A., Sun, H.: Balls into bins via local search. In: Proceedings of the 24th Symposium Discrete Algorithms (SODA), pp. 16\u201334 (2013)","DOI":"10.1137\/1.9781611973105.2"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Byers, J.W., Considine, J., Mitzenmacher, M.: Geometric generalizations of the power of two choices. In: Proceedings of the 16th Symposium Parallelism in Algorithms and Architectures (SPAA), pp. 54\u201363 (2004)","DOI":"10.1145\/1007912.1007921"},{"issue":"4","key":"27_CR7","doi-asserted-by":"crossref","first-page":"1738","DOI":"10.1137\/080729542","volume":"23","author":"C Cooper","year":"2009","unstructured":"Cooper, C., Frieze, A.M., Radzik, T.: Multiple random walks in random regular graphs. SIAM J. Discrete Math. 23(4), 1738\u20131761 (2009)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"27_CR8","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s00493-014-2897-6","volume":"34","author":"X Dahan","year":"2014","unstructured":"Dahan, X.: Regular graphs of large girth and arbitrary degree. Combinatorica 34(4), 407\u2013426 (2014)","journal-title":"Combinatorica"},{"key":"27_CR9","unstructured":"Godfrey, B.: Balls, bins with structure: balanced allocations on hypergraphs. In: Proceedings of the 19th Symposium Discrete Algorithms (SODA), pp. 511\u2013517 (2008)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Kenthapadi, K., Panigrahy, R.: Balanced allocation on graphs. In: Proceedings of the 17th Symposium Discrete Algorithms (SODA), pp. 434\u2013443 (2006)","DOI":"10.1145\/1109557.1109606"},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-1-4615-0013-1_9","volume":"1","author":"M Mitzenmacher","year":"2001","unstructured":"Mitzenmacher, M., Richa, A.W., Sitaraman, R.: The power of two random choices: a survey of technique and results. Handb. Randomized Comput. 1, 255\u2013312 (2001)","journal-title":"Handb. Randomized Comput."},{"key":"27_CR12","doi-asserted-by":"publisher","unstructured":"Peres, Y., Talwar, K., Wieder, U.: Graphical balanced allocations and the $$(1 + \\beta )$$ -choice process. Random Struct. Algorithms (2014). doi: 10.1002\/rsa.20558","DOI":"10.1002\/rsa.20558"},{"issue":"4","key":"27_CR13","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1145\/792538.792546","volume":"50","author":"B V\u00f6cking","year":"2003","unstructured":"V\u00f6cking, B.: How asymmetry helps load balancing. J. ACM 50(4), 568\u2013589 (2003)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:44:15Z","timestamp":1498315455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}