{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:14Z","timestamp":1750307414720,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806705","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"97-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Load balancing and orientability thresholds for random hypergraphs"],"prefix":"10.1145","author":[{"given":"Pu","family":"Gao","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas C.","family":"Wormald","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The probabilistic method","author":"Alon N.","year":"2008","unstructured":"N. Alon and J. Spencer . The probabilistic method . Wiley--Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons , Inc., Hoboken, NJ. xviii 352 pp., third edition, 2008 . N. Alon and J. Spencer. The probabilistic method. Wiley--Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., Hoboken, NJ. xviii 352 pp., third edition, 2008."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335411"},{"key":"e_1_3_2_1_4_1","volume-title":"North-Holland","author":"Bollob\u00e1s B\u00e9la","year":"1985","unstructured":"B\u00e9la Bollob\u00e1s and Alan M. Frieze . On matchings and hamiltonian cycles in random graphs. In Random graphs '83 (Poznan', 1983), pages 23--46. North-Holland Math. Stud., 118 , North-Holland , Amsterdam , 1985 . B\u00e9la Bollob\u00e1s and Alan M. Frieze. On matchings and hamiltonian cycles in random graphs. In Random graphs '83 (Poznan', 1983), pages 23--46. North-Holland Math. Stud., 118, North-Holland, Amsterdam, 1985."},{"key":"e_1_3_2_1_5_1","first-page":"469","volume-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Cain J.","year":"2007","unstructured":"J. Cain , P. Sanders , and N. Wormald . The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation . In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 469 -- 476 , January 2007 . J. Cain, P. Sanders, and N. Wormald. The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 469--476, January 2007."},{"key":"e_1_3_2_1_6_1","first-page":"81","article-title":"Encores on cores. Electronic Journal of Combinatorics, 13","author":"Cain J.","year":"2006","unstructured":"J. Cain and N. Wormald . Encores on cores. Electronic Journal of Combinatorics, 13 : RP 81 , 2006 . J. Cain and N. Wormald. Encores on cores. Electronic Journal of Combinatorics, 13:RP 81, 2006.","journal-title":"RP"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020103"},{"key":"e_1_3_2_1_8_1","volume-title":"Combinatorial optimization. (English summary)","author":"Cook William J.","year":"1998","unstructured":"William J. Cook , William H. Cunningham , William R. Pulleyblank , and Alexander Schrijver . Combinatorial optimization. (English summary) . Wiley-Interscience Series in Discrete Mathematics and Optimization. A Wiley-Interscience Publication. John Wiley & Sons , Inc., New York, x 355 pp., 1998 . William J. Cook, William H. Cunningham, William R. Pulleyblank, and Alexander Schrijver. Combinatorial optimization. (English summary). Wiley-Interscience Series in Discrete Mathematics and Optimization. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New York, x 355 pp., 1998."},{"key":"e_1_3_2_1_9_1","unstructured":". Dietzfelbinger A. Goerdt M. Mitzenmacher A. Montanari R. Pagh and M. Rink. Tight Thresholds for Cuckoo Hashing via XORSAT. preprint available at http:\/\/arxiv.org\/abs\/0912.0287.  . Dietzfelbinger A. Goerdt M. Mitzenmacher A. Montanari R. Pagh and M. Rink. Tight Thresholds for Cuckoo Hashing via XORSAT. preprint available at http:\/\/arxiv.org\/abs\/0912.0287."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/165231.165246"},{"key":"e_1_3_2_1_11_1","unstructured":". Frieze and P. Melsted. Maximum Matchings in Random Bipartite Graphs and the Space Utilization of CuckooHashtables. preprint available athttp:\/\/arxiv.org\/abs\/0910.5535.  . Frieze and P. Melsted. Maximum Matchings in Random Bipartite Graphs and the Space Utilization of CuckooHashtables. preprint available athttp:\/\/arxiv.org\/abs\/0910.5535."},{"key":"e_1_3_2_1_12_1","unstructured":". Fountoulakis and K. Panagiotou. Sharp Load Thresholds for CuckooHashing. preprint available at http:\/\/arxiv.org\/abs\/0910.5147.  . Fountoulakis and K. Panagiotou. Sharp Load Thresholds for CuckooHashing. preprint available at http:\/\/arxiv.org\/abs\/0910.5147."},{"key":"e_1_3_2_1_13_1","first-page":"459","volume-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Fernholz D.","year":"2007","unstructured":"D. Fernholz and V. Ramachandran . The k-orientability thresholds for Gn,p . In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 459 -- 468 January 2007 . D. Fernholz and V. Ramachandran. The k-orientability thresholds for Gn,p. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 459--468 January 2007."},{"key":"e_1_3_2_1_14_1","volume-title":"Orientability thresholds for random hypergraphs","author":"Gao P.","year":"2010","unstructured":"P. Gao and N. Wormald . Orientability thresholds for random hypergraphs . 2010 , preprint. P. Gao and N. Wormald. Orientability thresholds for random hypergraphs. 2010, preprint."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0016-0032(65)90340-6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129743"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01275671"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(96)00032-1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-1-4615-0013-1_9","volume-title":"Handbook of randomized computing","author":"Mitzenmacher M.","year":"2001","unstructured":"M. Mitzenmacher , A. Richa , and R. Sitaraman . The power of two random choices: a survey of techniques and results . In Handbook of randomized computing , volume I , II, pages 255 -- 312 . Comb. Optim., 9, Kluwer Acad . Publ., Dordrecht, 2001 . M. Mitzenmacher, A. Richa, and R. Sitaraman. The power of two random choices: a survey of techniques and results. In Handbook of randomized computing, volume I, II, pages 255--312. Comb. Optim., 9, Kluwer Acad. Publ., Dordrecht, 2001."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0987-0"},{"key":"e_1_3_2_1_21_1","volume-title":"Combinatorial optimization. Polyhedra and efficiency","author":"Schrijver Alexander","year":"2003","unstructured":"Alexander Schrijver . Combinatorial optimization. Polyhedra and efficiency , volume B. Algorithms and Combinatorics, 24 , Springer-Verlag , Berlin , 2003 . pp. i--xxxiv. Alexander Schrijver. Combinatorial optimization. Polyhedra and efficiency, volume B. Algorithms and Combinatorics, 24, Springer-Verlag, Berlin, 2003. pp. i--xxxiv."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004612"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts USA","acronym":"STOC'10"},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806705","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806705","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:36Z","timestamp":1750246776000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":22,"alternative-id":["10.1145\/1806689.1806705","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806705","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}