{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T22:03:52Z","timestamp":1753740232642},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642358425"},{"type":"electronic","value":"9783642358432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35843-2_31","type":"book-chapter","created":{"date-parts":[[2013,1,10]],"date-time":"2013-01-10T21:24:54Z","timestamp":1357853094000},"page":"356-368","source":"Crossref","is-referenced-by-count":5,"title":["Mixed Hypergraphs for Linear-Time Construction of Denser Hashing-Based Data Structures"],"prefix":"10.1007","author":[{"given":"Michael","family":"Rink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/978-3-642-04128-0_66","volume-title":"Algorithms - ESA 2009","author":"M. Aum\u00fcller","year":"2009","unstructured":"Aum\u00fcller, M., Dietzfelbinger, M., Rink, M.: Experimental Variations of a Theoretically Good Retrieval Data Structure. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 742\u2013751. Springer, Heidelberg (2009)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/978-3-642-04128-0_61","volume-title":"Algorithms - ESA 2009","author":"D. Belazzougui","year":"2009","unstructured":"Belazzougui, D., Botelho, F.C., Dietzfelbinger, M.: Hash, Displace, and Compress. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 682\u2013693. Springer, Heidelberg (2009)"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-73951-7_13","volume-title":"Algorithms and Data Structures","author":"F.C. Botelho","year":"2007","unstructured":"Botelho, F.C., Pagh, R., Ziviani, N.: Simple and Space-Efficient Minimal Perfect Hash Functions. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 139\u2013150. Springer, Heidelberg (2007)"},{"key":"31_CR4","unstructured":"Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables. In: Proc. 15th SODA, pp. 30\u201339 (2004)"},{"issue":"4","key":"31_CR5","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 Struct. Algorithms\u00a025(4), 353\u2013375 (2004)","journal-title":"Random Struct. Algorithms"},{"key":"31_CR6","unstructured":"Dietzfelbinger, M., Goerdt, A., Mitzenmacher, M., Montanari, A., Pagh, R., Rink, M.: Tight Thresholds for Cuckoo Hashing via XORSAT. CoRR abs\/0912.0287 (2009), \n                      \n                        http:\/\/arxiv.org\/abs\/0912.0287"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-14165-2_19","volume-title":"Automata, Languages and Programming","author":"M. Dietzfelbinger","year":"2010","unstructured":"Dietzfelbinger, M., Goerdt, A., Mitzenmacher, M., Montanari, A., Pagh, R., Rink, M.: Tight Thresholds for Cuckoo Hashing via XORSAT. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 213\u2013225. Springer, Heidelberg (2010)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-70575-8_32","volume-title":"Automata, Languages and Programming","author":"M. Dietzfelbinger","year":"2008","unstructured":"Dietzfelbinger, M., Pagh, R.: Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 385\u2013396. Springer, Heidelberg (2008)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-14165-2_30","volume-title":"Automata, Languages and Programming","author":"N. Fountoulakis","year":"2010","unstructured":"Fountoulakis, N., Panagiotou, K.: Orientability of Random Hypergraphs and the Power of Multiple Choices. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 348\u2013359. Springer, Heidelberg (2010)"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Invertible Bloom Lookup Tables. In: Proc. 49th Communication, Control, and Computing (Allerton), pp. 792\u2013799 (2011)","DOI":"10.1109\/Allerton.2011.6120248"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-57899-4_49","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Havas","year":"1994","unstructured":"Havas, G., Majewski, B.S., Wormald, N.C., Czech, Z.J.: Graphs, Hypergraphs and Hashing. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol.\u00a0790, pp. 153\u2013165. Springer, Heidelberg (1994)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Kim, J.H.: Poisson cloning model for random graphs. In: Proc. ICM Madrid 2006, vol.\u00a0III, pp. 873\u2013898 (2006)","DOI":"10.4171\/022-3\/43"},{"key":"31_CR13","unstructured":"Luby, M.: LT Codes. In: Proc. 43rd FOCS, p. 271 (2002)"},{"issue":"2","key":"31_CR14","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/18.910575","volume":"47","author":"M. Luby","year":"2001","unstructured":"Luby, M., Mitzenmacher, M., Shokrollahi, M.A., Spielman, D.A.: Efficient Erasure Correcting Codes. IEEE Transactions on Information Theory\u00a047(2), 569\u2013584 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Luby, M., Mitzenmacher, M., Shokrollahi, M.A., Spielman, D.A., Stemann, V.: Practical Loss-Resilient Codes. In: Proc. 29th STOC, pp. 150\u2013159 (1997)","DOI":"10.1145\/258533.258573"},{"issue":"6","key":"31_CR16","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1093\/comjnl\/39.6.547","volume":"39","author":"B.S. Majewski","year":"1996","unstructured":"Majewski, B.S., Wormald, N.C., Havas, G., Czech, Z.J.: A Family of Perfect Hashing Methods. Comput. J.\u00a039(6), 547\u2013554 (1996)","journal-title":"Comput. J."},{"key":"31_CR17","unstructured":"Maymounkov, P.: Online codes (Extended Abstract). Tech. Rep. TR2002-833, New York University (2002)"},{"key":"31_CR18","unstructured":"Molloy, M.: The pure literal rule threshold and cores in random hypergraphs. In: Proc. 15th SODA, pp. 672\u2013681 (2004)"},{"key":"31_CR19","unstructured":"Rink, M.: On Thresholds for the Appearance of 2-cores in Mixed Hypergraphs. CoRR abs\/1204.2131 (2012), \n                      \n                        http:\/\/arxiv.org\/abs\/1204.2131"},{"issue":"6","key":"31_CR20","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A. Shokrollahi","year":"2006","unstructured":"Shokrollahi, A.: Raptor Codes. IEEE Transactions on Information Theory\u00a052(6), 2551\u20132567 (2006)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2013: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35843-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T08:41:32Z","timestamp":1557477692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35843-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642358425","9783642358432"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35843-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}