{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:05:00Z","timestamp":1750694700677},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_30","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"348-359","source":"Crossref","is-referenced-by-count":12,"title":["Orientability of Random Hypergraphs and the Power of Multiple Choices"],"prefix":"10.1007","author":[{"given":"Nikolaos","family":"Fountoulakis","sequence":"first","affiliation":[]},{"given":"Konstantinos","family":"Panagiotou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/rsa.1019","volume":"19","author":"T. Bohman","year":"2001","unstructured":"Bohman, T., Frieze, A.: Avoiding a Giant Component. Random Structures & Algorithms\u00a019, 75\u201385 (2001)","journal-title":"Random Structures & Algorithms"},{"key":"30_CR2","unstructured":"Bohman, T., Frieze, A., Krivelevich, M., Loh, P., Sudakov, B.: Ramsey Games with Giants (Submitted)"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1002\/rsa.20038","volume":"25","author":"T. Bohman","year":"2004","unstructured":"Bohman, T., Frieze, A., Wormald, N.: Avoiding a Giant Component in Half the Edge Set of a Random Graph. Random Structures & Algorithms\u00a025, 432\u2013449 (2004)","journal-title":"Random Structures & Algorithms"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/rsa.20085","volume":"28","author":"T. Bohman","year":"2006","unstructured":"Bohman, T., Kim, J.H.: A Phase Transition for Avoiding a Giant Component. Random Structures & Algorithms\u00a028(2), 195\u2013214 (2006)","journal-title":"Random Structures & Algorithms"},{"key":"30_CR5","first-page":"469","volume-title":"SODA 2007","author":"J.A. Cain","year":"2007","unstructured":"Cain, J.A., Sanders, P., Wormald, N.: The Random Graph Threshold for k-orientiability and a Fast Algorithm for Optimal Multiple-choice Allocation. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA 2007, pp. 469\u2013476. SIAM, Philadelphia (2007)"},{"issue":"4","key":"30_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/rsa.20040","volume":"25","author":"C. Cooper","year":"2004","unstructured":"Cooper, C.: The Cores of Random Hypergraphs with a Given Degree Sequence. Random Structures & Algorithms\u00a025(4), 353\u2013375 (2004)","journal-title":"Random Structures & Algorithms"},{"issue":"4","key":"30_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0020-0190(02)00500-8","volume":"86","author":"L. Devroye","year":"2003","unstructured":"Devroye, L., Morin, P.: Cuckoo Hashing: Further Analysis. Information Processing Letters\u00a086(4), 215\u2013219 (2003)","journal-title":"Information Processing Letters"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Goerdt, A., Mitzenmacher, M., Montanari, A., Pagh, R., Rink, M.: Tight Thresholds for Cuckoo Hashing via XORSAT. In: Proceedings of ICALP (to appear, 2010)","DOI":"10.1007\/978-3-642-14165-2_19"},{"key":"30_CR9","first-page":"795","volume-title":"SODA 2009","author":"M. Dietzfelbinger","year":"2009","unstructured":"Dietzfelbinger, M., Schellbach, U.: On Risks of Using Cuckoo Hashing with Simple Universal Hash Classes. In: Mathieu, C. (ed.) SODA 2009, pp. 795\u2013804. SIAM, Philadelphia (2009)"},{"issue":"1-2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2007.02.054","volume":"380","author":"M. Dietzfelbinger","year":"2007","unstructured":"Dietzfelbinger, M., Weidling, C.: Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. Theoretical Computer Science\u00a0380(1-2), 47\u201368 (2007)","journal-title":"Theoretical Computer Science"},{"key":"30_CR11","unstructured":"Drmota, M., Kutzelnigg, R.: A Precise Analysis of Cuckoo Hashing (submitted)"},{"key":"30_CR12","first-page":"17","volume":"5","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the Evolution of Random Graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences\u00a05, 17\u201361 (1960)","journal-title":"Publication of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"30_CR13","first-page":"459","volume-title":"SODA 2007","author":"D. Fernholz","year":"2007","unstructured":"Fernholz, D., Ramachandran, V.: The k-orientability Thresholds for G\n                  \n                    n, p\n                  . In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA 2007, pp. 459\u2013468. SIAM, Philadelphia (2007)"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-36494-3_25","volume-title":"STACS 2003","author":"D. Fotakis","year":"2003","unstructured":"Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.: Space efficient hash tables with worst case constant access time. In: Habib, M., Alt, H. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 271\u2013282. Springer, Heidelberg (2003)"},{"key":"30_CR15","unstructured":"Frieze, A., Melsted, P.: Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables (2009) (manuscript), \n                    \n                      http:\/\/arxiv.org\/abs\/0910.5535"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Gao, P., Wormald, N.: Load Balancing and Orientability Thresholds for Random Hypergraphs. In: Proceedings of STOC (to appear, 2010)","DOI":"10.1145\/1806689.1806705"},{"key":"30_CR17","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000)"},{"key":"30_CR18","unstructured":"Kim, J.H.: Poisson Cloning Model for Random Graphs (2006) (manuscript)"},{"key":"30_CR19","first-page":"746","volume-title":"SODA 2008","author":"M. Mitzenmacher","year":"2008","unstructured":"Mitzenmacher, M., Vadhan, S.: Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream. In: Teng, S.-H. (ed.) SODA 2008, pp. 746\u2013755. SIAM, Philadelphia (2008)"},{"issue":"1","key":"30_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1002\/rsa.20061","volume":"27","author":"M. Molloy","year":"2005","unstructured":"Molloy, M.: Cores in Random Hypergraphs and Boolean Formulas. Random Structures & Algorithms\u00a027(1), 124\u2013135 (2005)","journal-title":"Random Structures & Algorithms"},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44676-1_10","volume-title":"Algorithms - ESA 2001","author":"R. Pagh","year":"2001","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo Hashing. In: auf der Heide, M. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 121\u2013133. Springer, Heidelberg (2001)"},{"issue":"5","key":"30_CR22","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00493-007-2163-2","volume":"27","author":"J. Spencer","year":"2007","unstructured":"Spencer, J., Wormald, N.: Birth Control for Giants. Combinatorica\u00a027(5), 587\u2013628 (2007)","journal-title":"Combinatorica"}],"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-642-14165-2_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:20:33Z","timestamp":1619785233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}