{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:19Z","timestamp":1772164039299,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T00:00:00Z","timestamp":1339372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,11]]},"DOI":"10.1145\/2254756.2254764","type":"proceedings-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T09:03:31Z","timestamp":1339405411000},"page":"41-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Bipartite graph structures for efficient balancing of heterogeneous loads"],"prefix":"10.1145","author":[{"given":"Mathieu","family":"Leconte","sequence":"first","affiliation":[{"name":"Technicolor - INRIA, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Lelarge","sequence":"additional","affiliation":[{"name":"INRIA - Ecole Normale Sup\u00e9rieure, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Massouli\u00e9","sequence":"additional","affiliation":[{"name":"Technicolor, Issy-les-Moulineaux, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Lecture Notes in Computer Science","volume-title":"auf der Heide, and P","author":"Abramsky S.","year":"2010","unstructured":"S. Abramsky , C. Gavoille , C. Kirchner , F. M. auf der Heide, and P . G. Spirakis, editors. ICALP 2010 , volume 6198 of Lecture Notes in Computer Science . Springer , 2010. S. Abramsky, C. Gavoille, C. Kirchner, F. M. auf der Heide, and P. G. Spirakis, editors. ICALP 2010, volume 6198 of Lecture Notes in Computer Science. Springer, 2010."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.08.002"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-09444-0_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90178-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/090753115"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"Bollob\u00e1s B.","year":"2001","unstructured":"B. Bollob\u00e1s . Random Graphs . Cambridge University Press , 2001 . B. Bollob\u00e1s. Random Graphs. Cambridge University Press, 2001."},{"key":"e_1_3_2_1_7_1","volume-title":"Feb.","author":"Bordenave C.","year":"2011","unstructured":"C. Bordenave , M. Lelarge , and J. Salez . Matchings on infinite graphs. ArXiv e-prints , Feb. 2011 . C. Bordenave, M. Lelarge, and J. Salez. Matchings on infinite graphs. ArXiv e-prints, Feb. 2011."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of IPTPS","author":"Boufkhad Y.","year":"2008","unstructured":"Y. Boufkhad , F. Mathieu , F. de Montgolfier , D. Perino , and L. Viennot . Achievable catalog size in peer-to-peer video-on-demand systems . In Proc. of IPTPS , 2008 . Y. Boufkhad, F. Mathieu, F. de Montgolfier, D. Perino, and L. Viennot. Achievable catalog size in peer-to-peer video-on-demand systems. In Proc. of IPTPS, 2008."},{"key":"e_1_3_2_1_9_1","first-page":"213","volume-title":"Abramsky et al. DBLP: CONF ICALP\/2010--1","author":"Dietzfelbinger M.","unstructured":"M. Dietzfelbinger , A. Goerdt , M. Mitzenmacher , A. Montanari , R. Pagh , and M. Rink . Tight thresholds for cuckoo hashing via xorsat . In Abramsky et al. DBLP: CONF ICALP\/2010--1 , pages 213 -- 225 . M. Dietzfelbinger, A. Goerdt, M. Mitzenmacher, A. Montanari, R. Pagh, and M. Rink. Tight thresholds for cuckoo hashing via xorsat. In Abramsky et al. DBLP: CONF ICALP\/2010--1, pages 213--225."},{"key":"e_1_3_2_1_10_1","first-page":"348","volume-title":"Abramsky et al. DBLP: CONF ICALP\/2010--1","author":"Fountoulakis N.","unstructured":"N. Fountoulakis and K. Panagiotou . Orientability of random hypergraphs and the power of multiple choices . In Abramsky et al. DBLP: CONF ICALP\/2010--1 , pages 348 -- 359 . N. Fountoulakis and K. Panagiotou. Orientability of random hypergraphs and the power of multiple choices. In Abramsky et al. DBLP: CONF ICALP\/2010--1, pages 348--359."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970333"},{"key":"e_1_3_2_1_12_1","volume-title":"available at: http:\/\/www.di.ens.fr\/large\/","author":"Lelarge M.","year":"2012","unstructured":"M. Lelarge . A new approach to the orientation of random hypergraphs. available at: http:\/\/www.di.ens.fr\/large\/ , 2012 . M. Lelarge. A new approach to the orientation of random hypergraphs. available at: http:\/\/www.di.ens.fr\/large\/, 2012."},{"key":"e_1_3_2_1_13_1","series-title":"North-Holland Mathematics Studies","volume-title":"Matching theory","author":"Lov\u00e1sz L.","year":"1986","unstructured":"L. Lov\u00e1sz and M. D. Plummer . Matching theory , volume 121 of North-Holland Mathematics Studies . North-Holland Publishing Co. , Amsterdam , 1986 . Annals of Discrete Mathematics, 29. L. Lov\u00e1sz and M. D. Plummer. Matching theory, volume 121 of North-Holland Mathematics Studies. North-Holland Publishing Co., Amsterdam, 1986. Annals of Discrete Mathematics, 29."},{"key":"e_1_3_2_1_14_1","volume-title":"Handbook of randomized computing","author":"Mitzenmacher M.","year":"2001","unstructured":"M. Mitzenmacher , A. Richa , and R. Siaraman . The power two random choices: a survey of techniques and results . In Handbook of randomized computing , volume 1 , 2001 . M. Mitzenmacher, A. Richa, and R. Siaraman. The power two random choices: a survey of techniques and results. In Handbook of randomized computing, volume 1, 2001."},{"key":"e_1_3_2_1_15_1","first-page":"133","volume-title":"Proceedings of the American Association of Artificial Intelligence National Conference on AI","author":"Pearl J.","year":"1982","unstructured":"J. Pearl . Reverend bayes on inference engines: A distributed hierarchical approach . In Proceedings of the American Association of Artificial Intelligence National Conference on AI , pages 133 -- 136 , Pittsburgh, PA , 1982 . J. Pearl. Reverend bayes on inference engines: A distributed hierarchical approach. In Proceedings of the American Association of Artificial Intelligence National Conference on AI, pages 133--136, Pittsburgh, PA, 1982."},{"key":"e_1_3_2_1_16_1","volume-title":"networks of plausible inference","author":"Pearl J.","year":"1988","unstructured":"J. Pearl . Probabilistic reasoning in intelligent systems : networks of plausible inference . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA, 1988 . J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1988."},{"key":"e_1_3_2_1_17_1","volume-title":"Mar.","author":"Salez J.","year":"2011","unstructured":"J. Salez . The cavity method for counting spanning subgraphs subject to local constraints. ArXiv e-prints , Mar. 2011 . J. Salez. The cavity method for counting spanning subgraphs subject to local constraints. ArXiv e-prints, Mar. 2011."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.071209"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935250"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.2.250"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11422778_57"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"V. Vazirani. Approximation Algorithms. Springer 2003.   V. Vazirani. Approximation Algorithms. Springer 2003.","DOI":"10.1007\/978-3-662-04565-7"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934900"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935322"}],"event":{"name":"SIGMETRICS '12: ACM SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems","location":"London England, UK","acronym":"SIGMETRICS '12","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","IFIP International Federation for Information Processing"]},"container-title":["Proceedings of the 12th ACM SIGMETRICS\/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2254756.2254764","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2254756.2254764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:20:49Z","timestamp":1750224049000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2254756.2254764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,11]]},"references-count":24,"alternative-id":["10.1145\/2254756.2254764","10.1145\/2254756"],"URL":"https:\/\/doi.org\/10.1145\/2254756.2254764","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2318857.2254764","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,6,11]]},"assertion":[{"value":"2012-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}